Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules

DOI10.1016/j.acha.2009.02.003zbMath1170.65318arXiv0902.4424MaRDI QIDQ837553

Luca Zanni, Mario Bertero, Riccardo Zanella, Ignace Loris, Christine De Mol

Publication date: 20 August 2009

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0902.4424

zbMATH Keywords

inverse problem; sparsity; gradient projection method; \(\ell _{1}\)-penalty

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

Related Items

Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds, A projected gradient method for αℓ ₁ − βℓ ₂ sparsity regularization ^**, On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems, A Barzilai-Borwein type method for minimizing composite functions, Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing, Gradient iteration with \(\ell _{p}\)-norm constraints, A box constrained gradient projection algorithm for compressed sensing, Projected gradient iteration for nonlinear operator equation, A cyclic block coordinate descent method with generalized gradient projections, A cyclic projected gradient method, Steplength selection in gradient projection methods for box-constrained quadratic programs, A new spectral method for \(l_1\)-regularized minimization, A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring, On the steplength selection in gradient methods for unconstrained optimization, Proximal Splitting Methods in Signal Processing, Elastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of Solutions

Uses Software

• CONV_QP
• GPDT
• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Accelerated projected gradient method for linear inverse problems with sparsity constraints
• Gradient methods with adaptive step-sizes
• New adaptive stepsize selections in gradient methods
• An algorithm for total variation minimization and applications
• Least angle regression. (With discussion)
• An improved gradient projection-based decomposition technique for support vector machines
• On the asymptotic behaviour of some new gradient methods
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
• An EM algorithm for wavelet-based image restoration
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• A scaled gradient projection method for constrained image deblurring
• On the performance of algorithms for the minimization of ℓ ₁ -penalized functionals
• Two-Point Step Size Gradient Methods
• Atomic Decomposition by Basis Pursuit
• Gradient Method with Retards and Generalizations
• Inexact spectral projected gradient methods on convex sets
• A new approach to variable selection in least squares problems
• 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
• Gradient projection methods for quadratic programs and applications in training support vector machines
• Signal Recovery by Proximal Forward-Backward Splitting
• The cyclic Barzilai-–Borwein method for unconstrained optimization
• Compressed sensing