A fast algorithm for nonconvex approaches to sparse recovery problems
- 1 September 2013
- journal article
- Published by Elsevier in Signal Processing
- Vol. 93 (9) , 2636-2647
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Iterative Reweighted $\ell_1$ and $\ell_2$ Methods for Finding Sparse SolutionsIEEE Journal of Selected Topics in Signal Processing, 2010
- Iteratively reweighted least squares minimization for sparse recoveryCommunications on Pure and Applied Mathematics, 2009
- One-step sparse estimates in nonconcave penalized likelihood modelsThe Annals of Statistics, 2008
- Iterated Hard Shrinkage for Minimization Problems with Sparsity ConstraintsSIAM Journal on Scientific Computing, 2008
- An Interior-Point Method for Large-Scale -Regularized Least SquaresIEEE Journal of Selected Topics in Signal Processing, 2007
- Compressive sampling2007
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Signal Recovery by Proximal Forward-Backward SplittingMultiscale Modeling & Simulation, 2005
- On the Convergence of a Sequential Penalty Function Method for Constrained MinimizationSIAM Journal on Numerical Analysis, 1989
- Iteratively Reweighted Least Squares: Algorithms, Convergence Analysis, and Numerical ComparisonsSIAM Journal on Scientific and Statistical Computing, 1988