Testing the nullspace property using semidefinite programming

Mathematical Programming

Volumn 127, Issue 1, 2011, Pages 123-144

  D'Aspremont, Alexandre ^a   El Ghaoui, Laurent ^b  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Compressed sensing; Nullspace property; Restricted isometry constant; Semidefinite programming

Indexed keywords

ASYMPTOTIC PROPERTIES; CARDINALITIES; COMPRESSED SENSING; DESIGN MATRIX; LINEAR PROGRAMS; MATRIX; NULLSPACE PROPERTY; NUMERICAL EXAMPLE; RANDOM MATRICES; RESTRICTED ISOMETRY CONSTANT; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE RELAXATION; SPARSE EIGENVALUES; SPARSE SOLUTIONS; TRACTABLE ALGORITHMS;

EIGENVALUES AND EIGENFUNCTIONS; MATHEMATICAL PROGRAMMING; NUMERICAL ANALYSIS; SIGNAL RECONSTRUCTION;

MATRIX ALGEBRA;

EID: 79952762842     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0416-0     Document Type: Article

References (24)

1. F. Affentranger R. Schneider 1992 Random projections of regular simplices Discrete Comput. Geom. 7 1 219 226 0751.52002 10.1007/BF02187839 1149653
2. A. Barvinok 2007 Integration and optimization of multivariate polynomials by restriction onto a random subspace Foundations Comput. Math. 7 2 229 244 1132.68069 10.1007/s10208-005-0178-x 2324417
3. Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V.: Linear matrix inequalities in system and control theory. SIAM (1994)
4. E. Candès T. Tao 2006 Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inform. Theory 52 12 5406 5425 10.1109/TIT.2006.885507 2300700 (Pubitemid 46445381)
5. E.J. Candès T. Tao 2005 Decoding by linear programming IEEE Trans. Inform. Theory 51 12 4203 4215 10.1109/TIT.2005.858979 2243152 (Pubitemid 41800353)
6. A. Cohen W. Dahmen R. DeVore 2009 Compressed sensing and best k-term approximation J. AMS 22 1 211 231 2449058
7. A. d'Aspremont L. El Ghaoui M. Jordan G.R.G. Lanckriet 2007 A direct formulation for sparse PCA using semidefinite programming SIAM Rev. 49 3 434 448 1128.90050 10.1137/050645506 2353806 (Pubitemid 47377693)
8. A. d'Aspremont F. Bach L. El Ghaoui 2008 Optimal solutions for sparse principal component analysis J. Mach. Learn. Res. 9 1269 1294 2426043
9. D. Donoho X. Huo 2001 Uncertainty principles and ideal atomic decomposition IEEE Trans. Inform. Theory 47 7 2845 2862 1019.94503 10.1109/18.959265 1872845 (Pubitemid 33053488)
10. D. Donoho J. Tanner 2008 Counting the faces of randomly-projected hypercubes and orthants, with applications Arxiv Preprint arXiv 08073590
11. D.L. Donoho J. Tanner 2005 Sparse nonnegative solutions of underdetermined linear equations by linear programming Proc. Natl. Acad. Sci. 102 27 9446 9451 10.1073/pnas.0502269102 2168715 (Pubitemid 40981701)
12. M. Goemans D. Williamson 1995 Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming J ACM 42 1115 1145 0885.68088 10.1145/227683.227684 1412228
13. Ibragimov, I., Sudakov, V., Tsirelson, B.: Norms of Gaussian sample functions. In: Proceedings of the third Japan USSR symposium on probability theory, lecture notes in math, vol. 550, pp. 20-41 (1976)
14. 1 minimization. ArXiv 08092650 (2008)
15. Lee, K., Bresler, Y.: Computing performance guarantees for compressed sensing. In: IEEE International Conference on Acoustics, Speech and Signal Processing, 2008. ICASSP 2008, pp 5129-5132 (2008)
16. Massart, P.: Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII (2007)
17. C. Moler C. Van Loan 2003 Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later SIAM Rev. 45 1 3 49 1030.65029 10.1137/S00361445024180 1981253
18. Nesterov Y.: Introductory Lectures on Convex Optimization. Springer, Heidelberg (2003)
19. Y. Nesterov 2005 Smooth minimization of non-smooth functions Math. Program. 103 1 127 152 1079.90102 10.1007/s10107-004-0552-5 2166537 (Pubitemid 40537674)
20. Y. Nesterov 2007 Smoothing technique and its applications in semidefinite optimization Math. Program. 110 2 245 259 1126.90058 10.1007/s10107-006-0001-8 2313779 (Pubitemid 46504991)
21. J. Sturm 1999 Using SEDUMI 1.0x, a MATLAB toolbox for optimization over symmetric cones Optim. Method. Sofw. 11 625 653 10.1080/10556789908805766 1778433
22. K.C. Toh M.J. Todd R.H. Tutuncu 1999 SDPT3-a MATLAB software package for semidefinite programming Optim. Method. Sofw. 11 545 581 10.1080/ 10556789908805762 1778429
23. A. Vershik P. Sporyshev 1992 Asymptotic behavior of the number of faces of random polyhedra and the neighborliness problem Selecta Math Soviet 11 2 181 201 0791.52011 1166627
24. 1- minimization: Go over or under. Rice University CAAM Technical report TR05-09 (2005)