Sparse recovery by non-convex optimization – instance optimality
Authors:
- Rayan SaabRSRayan Saab
- Özgür YılmazÖYÖzgür Yılmaz
- 1 July 2010
- journal article
- Published by Elsevier in Applied and Computational Harmonic Analysis
- Vol. 29 (1) , 30-48
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Sparsest solutions of underdetermined linear systems via -minimization forApplied and Computational Harmonic Analysis, 2009
- Stability and Instance Optimality for Gaussian Measurements in Compressed SensingFoundations of Computational Mathematics, 2009
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$IEEE Transactions on Information Theory, 2009
- Compressed sensing and best 𝑘-term approximationJournal of the American Mathematical Society, 2008
- Restricted isometry properties and nonconvex compressive sensingInverse Problems, 2008
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Recovery of Short, Complex Linear Combinations Via$ell _1$MinimizationIEEE Transactions on Information Theory, 2005
- Uncertainty principles and ideal atomic decompositionIEEE Transactions on Information Theory, 2001
- Banach-Mazur distances and projections onp-convex specesMathematische Zeitschrift, 1981