Phase transitions for greedy sparse approximation algorithms

Applied and Computational Harmonic Analysis

Volumn 30, Issue 2, 2011, Pages 188-203

  Blanchard, Jeffrey D ^a   Cartis, Coralia ^b   Tanner, Jared ^b   Thompson, Andrew ^b  

^a GRINNELL COLLEGE   (United States)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Compressed sensing; Gaussian matrices; Greedy algorithms; Phase transitions; Restricted isometry property; Sparse solutions to underdetermined systems

Indexed keywords

COMPRESSED SENSING; GAUSSIANS; GREEDY ALGORITHMS; RESTRICTED ISOMETRY PROPERTY; SPARSE SOLUTIONS TO UNDERDETERMINED SYSTEMS;

GAUSSIAN DISTRIBUTION; LINEAR SYSTEMS; MATRIX ALGEBRA; PHASE TRANSITIONS; SIGNAL RECONSTRUCTION;

APPROXIMATION ALGORITHMS;

EID: 78751566708     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2010.07.001     Document Type: Article

References (38)

1. B. Bah, and J. Tanner Improved bounds on restricted isometry constants for Gaussian matrices arXiv:1003.3299v2 2010 submitted for publication
2. Ewout van den Berg, and Michael P. Friedlander Probing the pareto frontier for basis pursuit solutions SIAM J. Sci. Comput. 31 2 2008 890 912
3. Dimitri P. Bertsekas Nonlinear Programming second edition 1999 Athena Scientific
4. Jeffrey D. Blanchard, Coralia Cartis, and Jared Tanner Decay properties for restricted isometry constants IEEE Signal Process. Lett. 16 7 2009 572 575
5. Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner, Compressed sensing: How sharp is the restricted isometry property? SIAM Rev., in press.
6. Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner, and Andrew Thompson Phase transitions for greedy sparse approximation algorithms arXiv:1004.1821v1 2009
7. Jeffrey D. Blanchard, and Andrew Thompson On support sizes of restricted isometry constants Appl. Comput. Harmon. Anal. 29 3 2010 382 390
8. T. Blumensath, and M.E. Davies Iterative hard thresholding for compressed sensing Appl. Comput. Harmon. Anal. 27 3 2009 265 274
9. A.M. Bruckstein, David L. Donoho, and Michael Elad From sparse solutions of systems of equations to sparse modeling of signals and images SIAM Rev. 51 1 2009 34 81
10. Emmanuel J. Candès Compressive sampling International Congress of Mathematicians vol. III 2006 Eur. Math. Soc. Zürich 1433 1452
11. Emmanuel J. Candès, and Terence Tao Decoding by linear programming IEEE Trans. Inform. Theory 51 12 2005 4203 4215
12. Albert Cohen, Wolfgand Dahmen, Ronald DeVore, Instance optimal decoding by thresholding in compressed sensing, Technical Report, 2008.
13. W. Dai, and O. Milenkovic Subspace pursuit for compressive sensing signal reconstruction IEEE Trans. Inform. Theory 55 5 2009 2230 2249
14. M.A. Davenport, and M.B. Wakin Analysis of orthogonal matching pursuit using the restricted isometry property arXiv:0909.0083v1 2009 submitted for publication
15. David L. Donoho, Neighborly polytopes and sparse solution of underdetermined linear equations, Technical Report, Department of Statistics, Stanford University, 2004.
16. David L. Donoho Compressed sensing IEEE Trans. Inform. Theory 52 4 2006 1289 1306
17. David L. Donoho High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension Discrete Comput. Geom. 35 4 2006 617 652
18. David L. Donoho, and Arian Maleki Optimally tuned iterative thresholding algorithms for compressed sensing IEEE Selected Topics Signal Process. 4 2 2010 330 341
19. David L. Donoho, Victoria Stodden, Breakdown point of model selection when the number of variables exceeds the number of observations, in: Proceedings of the International Joint Conference on Neural Networks, 2006.
20. David L. Donoho, and Jared Tanner Sparse nonnegative solutions of underdetermined linear equations by linear programming Proc. Natl. Acad. Sci. USA 102 27 2005 9446 9451
21. David L. Donoho, and Jared Tanner Counting faces of randomly projected polytopes when the projection radically lowers dimension J. Amer. Math. Soc. 22 1 2009 1 53
22. David L. Donoho, and Jared Tanner Precise undersampling theorems Proc. IEEE 98 6 2010 913 924
23. David L. Donoho, and Yaakov Tsaig Fast solution of l1 minimization problems when the solution may be sparse IEEE Trans. Inform. Theory 54 11 2008 4789 4812
24. David L. Donoho, Yaakov Tsaig, Iddo Drori, Jean-Luc Stark, Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit, Technical Report, Department of Statistics, Stanford University, 2006.
25. Mário A.T. Figueiredo, Robert D. Nowak, and Stephen J. Wright Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems IEEE Selected Topics Signal Process. 1 4 2007 586 597
26. S. Foucart, and M.-J. Lai Sparsest solutions of underdetermined linear systems via q -minimization for 0 < q ≤ 1 Appl. Comput. Harmon. Anal. 26 3 2009 395 407
27. Rahul Garg, and Rohit Khandekar Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property ICML '09: Proceedings of the 26th Annual International Conference on Machine Learning 2009 ACM New York, NY, USA 337 344
28. B.K. Natarajan Sparse approximate solutions to linear systems SIAM J. Comput. 24 2 1995 227 234
29. Deanna Needell, and Joel Tropp CoSaMP: Iterative signal recovery from incomplete and inaccurate samples Appl. Comput. Harmon. Anal. 26 3 2009 301 321
30. Deanna Needell, and Roman Vershynin Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit Found. Comput. Math. 9 3 2009 317 334
31. Yurii Nesterov Introductory Lectures on Convex Optimization 2004 Kluwer Academic Publishers Dordrecht, The Netherlands
32. Yurii Nesterov, Gradient methods for minimizing composite objective functions, CORE Discussion Paper 2007/76, Center for Operations Research and Econometrics, Université Catholique de Louvain, Belgium, 2007.
33. Yurii Nesterov, and Arkadi Nemirovski Interior Point Polynomial Methods in Convex Programming 1994 SIAM Philadelphia, PA
34. Jorge Nocedal, and Stephen J. Wright Numerical Optimization second edition 2006 Springer Verlag
35. Mark Rudelson, and Roman Vershynin On sparse reconstruction from Fourier and Gaussian measurements Comm. Pure Appl. Math. 61 8 2008 1025 1045
36. C.E. Shannon Communication in the presence of noise Proc. Inst. of Radio Engineers 37 1 1949 10 21
37. Joel A. Tropp, and Steven J. Wright Computational methods for sparse solution of linear inverse problems Proc. IEEE 98 6 2010 948 958
38. W. Xu, B. Hassibi, Compressed sensing over the Grassmann manifold: A unified analytical framework, in: Forty-Sixth Annual Allerton Conference, 2008.