Accelerating gradient projection methods for _1-constrained signal recovery by steplength selection rules
From MaRDI portal
(Redirected from Publication:837553)
Accelerating gradient projection methods for \(\ell 1\)-constrained signal recovery by steplength selection rules
Accelerating gradient projection methods for \(\ell 1\)-constrained signal recovery by steplength selection rules
Abstract: We propose a new gradient projection algorithm that compares favorably with the fastest algorithms available to date for -constrained sparse recovery from noisy data, both in the compressed sensing and inverse problem frameworks. The method exploits a line-search along the feasible direction and an adaptive steplength selection based on recent strategies for the alternation of the well-known Barzilai-Borwein rules. The convergence of the proposed approach is discussed and a computational study on both well-conditioned and ill-conditioned problems is carried out for performance evaluations in comparison with five other algorithms proposed in the literature.
Recommendations
- Accelerated projected gradient method for linear inverse problems with sparsity constraints
- An iteratively approximated gradient projection algorithm for sparse signal reconstruction
- Accelerated projected steepest descent method for nonlinear inverse problems with sparsity constraints
- A gradient projection method for the sparse signal reconstruction in compressive sensing
- A box constrained gradient projection algorithm for compressed sensing
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 2221955 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Nonmonotone Line Search Technique for Newton’s Method
- A new approach to variable selection in least squares problems
- A scaled gradient projection method for constrained image deblurring
- Accelerated projected gradient method for linear inverse problems with sparsity constraints
- An EM algorithm for wavelet-based image restoration
- An algorithm for total variation minimization and applications
- An improved gradient projection-based decomposition technique for support vector machines
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Atomic Decomposition by Basis Pursuit
- Compressed sensing
- Gradient Method with Retards and Generalizations
- Gradient methods with adaptive step-sizes
- Gradient projection methods for quadratic programs and applications in training support vector machines
- Inexact spectral projected gradient methods on convex sets
- Least angle regression. (With discussion)
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- New adaptive stepsize selections in gradient methods
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- On the asymptotic behaviour of some new gradient methods
- On the performance of algorithms for the minimization of ℓ 1 -penalized functionals
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery by Proximal Forward-Backward Splitting
- Sparse Reconstruction by Separable Approximation
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Two-Point Step Size Gradient Methods
Cited in
(23)- Accelerated projected steepest descent method for nonlinear inverse problems with sparsity constraints
- On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems
- A cyclic block coordinate descent method with generalized gradient projections
- A Barzilai-Borwein type method for minimizing composite functions
- Gradient-based algorithms with applications to signal-recovery problems
- A projected gradient method for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization
- Barzilai–Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems
- Another hybrid approach for solving monotone operator equations and application to signal processing
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
- Proximal splitting methods in signal processing
- Gradient iteration with \(\ell _{p}\)-norm constraints
- An improved backtracking line search method for 2D projected gradient method
- A box constrained gradient projection algorithm for compressed sensing
- Elastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of Solutions
- An adaptive gradient projection algorithm for piecewise convex optimization and its application in compressed spectrum sensing
- A cyclic projected gradient method
- On the steplength selection in gradient methods for unconstrained optimization
- An iteratively approximated gradient projection algorithm for sparse signal reconstruction
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- A new spectral method for \(l_1\)-regularized minimization
- Projected gradient iteration for nonlinear operator equation
- A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring
- Spectral properties of Barzilai-Borwein rules in solving singly linearly constrained optimization problems subject to lower and upper bounds
This page was built for publication: Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q837553)
