Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints
arXiv:0706.4297 · doi:10.1007/s00041-008-9039-8
Abstract
Regularization of ill-posed linear inverse problems via penalization has been proposed for cases where the solution is known to be (almost) sparse. One way to obtain the minimizer of such an penalized functional is via an iterative soft-thresholding algorithm. We propose an alternative implementation to -constraints, using a gradient method, with projection on -balls. The corresponding algorithm uses again iterative soft-thresholding, now with a variable thresholding parameter. We also propose accelerated versions of this iterative method, using ingredients of the (linear) steepest descent method. We prove convergence in norm for one of these projected gradient methods, without and with acceleration.
24 pages, 5 figures. v2: added reference, some amendments, 27 pages
References in corpus (1)
Cited by in corpus (13)
- NESTA: A Fast and Accurate First-order Method for Sparse Recovery
- Linear convergence of iterative soft-thresholding
- Hessian Schatten-Norm Regularization for Linear Inverse Problems
- Online Sparse System Identification and Signal Reconstruction using Projections onto Weighted Balls
- Meaning of Interior Tomography
- Accelerating gradient projection methods for -constrained signal recovery by steplength selection rules
- On the performance of algorithms for the minimization of -penalized functionals
- Polyquant CT: direct electron and mass density reconstruction from a single polyenergetic source
- A projected gradient method for sparsity regularization
- An Accelerated Nonlinear Contrast Source Inversion Scheme For Sparse Electromagnetic Imaging
- The Stochastic Properties of -Regularized Spherical Gaussian Fields
- Greedy Algorithms for Hybrid Compressed Sensing
- Continuous Time Locally Stationary Wavelet Processes