A new spectral method for \(l_1\)-regularized minimization

DOI10.3934/ipi.2015.9.257zbMath1308.65100MaRDI QIDQ2254769

Yanyan Li

Publication date: 6 February 2015

Published in: Inverse Problems and Imaging (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/ipi.2015.9.257

zbMATH Keywords

global convergence; convex optimization; numerical experiment; compressed sensing; spectral residual method; \(l_1\)-regularized; monotone line search

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

90C06: Large-scale problems in mathematical programming

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
• SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality
• Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
• A coordinate gradient descent method for nonsmooth separable minimization
• Estimation of the optimal constants and the thickness of thin films using unconstrained optimization
• Modified two-point stepsize gradient methods for unconstrained optimization
• A nonsmooth version of Newton's method
• Optimization theory and methods. Nonlinear programming
• R-linear convergence of the Barzilai and Borwein gradient method
• Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
• Gradient-Based Methods for Sparse Recovery
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• The Split Bregman Method for L1-Regularized Problems
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• A scaled gradient projection method for constrained image deblurring
• Two-Point Step Size Gradient Methods
• Alternate minimization gradient method
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Sparse Reconstruction by Separable Approximation
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• A Nonmonotone Line Search Technique for Newton’s Method
• Mathematical Programming for Data Mining: Formulations and Challenges
• On the Barzilai and Borwein choice of steplength for the gradient method
• Fast Image Recovery Using Variable Splitting and Constrained Optimization
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Signal Recovery by Proximal Forward-Backward Splitting
• Minimization algorithms based on supervisor and searcher cooperation