Recovering Structured Signals in Noise: Least-Squares Meets Compressed Sensing
- 1 January 2015
- book chapter
- Published by Springer Nature
- p. 97-141
Abstract
No abstract availableKeywords
This publication has 42 references indexed in Scilit:
- Living on the Edge: A Geometric Theory of Phase Transitions in Convex Optimization2013
- Computational and statistical tradeoffs via convex relaxationProceedings of the National Academy of Sciences, 2013
- Square-root lasso: pivotal recovery of sparse signals via conic programmingBiometrika, 2011
- The LASSO Risk for Gaussian MatricesIEEE Transactions on Information Theory, 2011
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed SensingIEEE Transactions on Information Theory, 2011
- Simultaneous analysis of Lasso and Dantzig selectorThe Annals of Statistics, 2009
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- The Dantzig selector: Statistical estimation when p is much larger than nThe Annals of Statistics, 2007
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?IEEE Transactions on Information Theory, 2006
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006