Efficient Minimization Algorithms for Compressive Sensing Based on Proximity Operator
arXiv:1506.05374
Abstract
This paper considers solving the unconstrained -norm () regularized least squares (-LS) problem for recovering sparse signals in compressive sensing. We propose two highly efficient first-order algorithms via incorporating the proximity operator for nonconvex -norm functions into the fast iterative shrinkage/thresholding (FISTA) and the alternative direction method of multipliers (ADMM) frameworks, respectively. Furthermore, in solving the nonconvex -LS problem, a sequential minimization strategy is adopted in the new algorithms to gain better global convergence performance. Unlike most existing -minimization algorithms, the new algorithms solve the -minimization problem without smoothing (approximating) the -norm. Meanwhile, the new algorithms scale well for large-scale problems, as often encountered in image processing. We show that the proposed algorithms are the fastest methods in solving the nonconvex -minimization problem, while offering competent performance in recovering sparse signals and compressible images compared with several state-of-the-art algorithms.
arXiv commentThis paper has been withdrawn by the author due to a crucial error in the convergence analysis
References in corpus (13)
- Least Angle Regression
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Rejoinder to "Least angle regression" by Efron et al
- Message Passing Algorithms for Compressed Sensing
- Generalized Orthogonal Matching Pursuit
- Templates for Convex Cone Problems with Applications to Sparse Signal Recovery