On the conditioning of random subdictionaries

Applied and Computational Harmonic Analysis

Volumn 25, Issue 1, 2008, Pages 1-24

  Tropp, Joel A ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Banach space probability; Basis pursuit; Coherence; Convex optimization; Dictionary; Random matrix; Regularization; Sparsity; Uncertainty principle; Underdetermined linear system

Indexed keywords

APPROXIMATION THEORY; BANACH SPACES; COMPUTATIONAL GEOMETRY; LINEAR SYSTEMS; UNCERTAINTY ANALYSIS; VECTORS;

BANACH SPACE PROBABILITY; BASIS PURSUITS; CONVEX OPTIMIZATION; RANDOM MATRIX; REGULARIZATION; SPARSITY; UNCERTAINTY PRINCIPLES; UNDERDETERMINED LINEAR SYSTEMS;

RANDOM PROCESSES;

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

References (38)

1. Aubrun G. Sampling convex bodies: A random matrix approach. Proc. Amer. Math. Soc. 135 (2007) 1293-1303
2. R. Baraniuk, M. Davenport, R. DeVore, M. Wakin, A simple proof of the restricted isometry property for random matrices, Constr. Approx. (2007), in press
3. Bourgain J. Random points in isotropic convex sets. Convex Geometric Analysis. Berkeley, CA, 1996. Math. Sci. Res. Inst. Publ. vol. 34 (1999), Cambridge Univ. Press, Cambridge 53-58
4. Bourgain J., and Tzafriri L. Invertibility of "large" submatrices with applications to the geometry of Banach spaces and harmonic analysis. Israel J. Math. 57 2 (1987) 137-224
5. Bourgain J., and Tzafriri L. On a problem of Kadison and Singer. J. Reine Angew. Math. 420 (1991) 1-43
6. Buchholz A. Operator Khintchine inequality in non-commutative probability. Math. Ann. 319 (2001) 1-16
7. A. Cohen, W. Dahmen, R. DeVore, Compressed sensing and best k-term approximation, J. Amer. Math. Soc. (2006), submitted for publication
8. Chen S.S., Donoho D.L., and Saunders M.A. Atomic decomposition by Basis Pursuit. SIAM J. Sci. Comput. 20 1 (1999) 33-61
9. E.J. Candès, J. Romberg, Quantitative robust uncertainty principles and optimally sparse decompositions, Found. Comput. Math. (2006), in press
10. Candès E., Romberg J., and Tao T. Robust uncertainty principles: Exact signal reconstruction from highly incomplete Fourier information. IEEE Trans. Inform. Theory 52 2 (2006) 489-509
11. Candès E.J., and Tao T. Near-optimal signal recovery from random projections: Universal encoding strategies?. IEEE Trans. Inform. Theory 52 12 (2006) 5406-5425
12. 1 minimization. Proc. Natl. Acad. Sci. 100 (2003) 2197-2202
13. Donoho D.L., and Huo X. Uncertainty principles and ideal atomic decomposition. IEEE Trans. Inform. Theory 47 (2001) 2845-2862
14. Davis G., Mallat S., and Avellaneda M. Greedy adaptive approximation. Constr. Approx. 13 (1997) 57-98
15. Donoho D.L., and Stark P.B. Uncertainty principles and signal recovery. SIAM J. Appl. Math. 49 3 (1989) 906-931
16. D.L. Donoho, J. Tanner, Counting faces of randomly projected polytopes when the projection radically lowers dimension, Dept. of Statistics Technical Report 2006-11, Stanford Univ., 2006
17. Elad M., and Bruckstein A.M. A generalized uncertainty principle and sparse representation in pairs of bases. IEEE Trans. Inform. Theory 48 9 (2002) 2558-2567
18. Fuchs J.-J. On sparse representations in arbitrary redundant bases. IEEE Trans. Inform. Theory 50 6 (2004) 1341-1344
19. Gribonval R., and Nielsen M. Sparse representations in unions of bases. IEEE Trans. Inform. Theory 49 12 (2003) 3320-3325
20. Haagerup U. The best constants in the Khintchine inequality. Studia Math. 70 (1982) 231-283
21. 5) volume algorithm for convex bodies. Random Structures Algorithms II 13 (1997) 1-50
22. p(1 < p < ∞). C. R. Acad. Sci. Paris, Sér. I 303 7 (1986) 289-292
23. Ledoux M., and Talagrand M. Probability in Banach Spaces: Isoperimetry and Processes (1991), Springer
24. Mendelson S., and Pajor A. On singular values of matrices with independent rows. Bernoulli 12 (2006) 761-773
25. Natarajan B.K. Sparse approximate solutions to linear systems. SIAM J. Comput. 24 (1995) 227-234
26. Peshkir G., and Shiryaev A.N. The Khintchine inequalities and martingale expanding sphere of their action. Russian Math. Surveys 50 5 (1995) 849-904
27. Rudelson M. Random vectors in the isotropic position. J. Funct. Anal. 164 (1999) 60-72
28. M. Rudelson, R. Vershynin, Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements, in: Proc. 40th Annual Conference on Information Sciences and Systems, Princeton, 2006
29. M. Rudelson, R. Vershynin, Sampling from large matrices: An approach through geometric functional analysis, J. Assoc. Comput. Mach. (2007), in press
30. Strohmer T., and Heath R.W. Grassmannian frames with applications to coding and communication. Appl. Comput. Harmon. Anal. 14 3 (2003) 257-275
31. Simon B. Trace Ideals and Their Applications. second ed. (2005), American Mathematical Society
32. Tomczak-Jaegermann N. Banach-Mazur Distances and Finite-Dimensional Operator Ideals. Pitman Monogr. Surv. Pure Appl. Math. vol. 38 (1989), Longman
33. 1 minimization. IEEE Trans. Inform. Theory 51 4 (2005) 1568-1570
34. Tropp J.A. Just relax: Convex programming methods for subset selection and sparse approximation. IEEE Trans. Inform. Theory 52 3 (2006) 1030-1051
35. J.A. Tropp, The random paving property for uniformly bounded matrices, J. Fourier Anal. Appl. (2006), submitted for publication
36. J.A. Tropp, On the linear independence of spikes and sines, in preparation
37. Vershynin R. Random sets of isomorphism of linear operators on Hilbert space. High Dimensional Probability. Lecture Notes-Monogr. Ser. vol. 51 (2005), IMS 148-154
38. Zygmund A. Trigonometric Series. third ed. (2002), Cambridge Univ. Press