Iteratively reweighted \(\ell _1\) algorithms with extrapolation
From MaRDI portal
Publication:2419549
DOI10.1007/s10589-019-00081-1zbMath1420.90071arXiv1710.07886OpenAlexW2964039038MaRDI QIDQ2419549
Publication date: 13 June 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.07886
Related Items
Nonconvex flexible sparsity regularization: theory and monotone numerical schemes ⋮ An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis ⋮ Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints ⋮ Doubly iteratively reweighted algorithm for constrained compressed sensing models ⋮ Open issues and recent advances in DC programming and DCA ⋮ Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints ⋮ Relating \(\ell_p\) regularization and reweighted \(\ell_1\) regularization ⋮ An accelerated IRNN-iteratively reweighted nuclear norm algorithm for nonconvex nonsmooth low-rank minimization problems ⋮ A residual-based algorithm for solving a class of structured nonsmooth optimization problems ⋮ An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing
Uses Software
Cites Work
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Primal-dual subgradient methods for convex problems
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- A mathematical introduction to compressive sensing
- Gradient methods for minimizing composite functions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Convex analysis and nonlinear optimization. Theory and examples.
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Introductory lectures on convex optimization. A basic course.
- A proximal difference-of-convex algorithm with extrapolation
- Templates for convex cone problems with applications to sparse signal recovery
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Adaptive restart for accelerated gradient schemes
- Techniques of variational analysis
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
- Decoding by Linear Programming
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Sparse Reconstruction by Separable Approximation
- Variational analysis of spectral functions simplified
- Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
- Regularization and Variable Selection Via the Elastic Net
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Some methods of speeding up the convergence of iteration methods
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems
