Null space conditions and thresholds for rank minimization

Mathematical Programming

Volumn 127, Issue 1, 2011, Pages 175-202

  Recht, Benjamin ^a   Xu, Weiyu ^b   Hassibi, Babak ^b  

^a University of Wisconsin Madison   (United States)

^b California Institute of Technology   (United States)

Author keywords

Compressed sensing; Convex optimization; Gaussian processes; Matrix norms; Random matrices; Rank

Indexed keywords

COMPRESSED SENSING; GAUSSIAN PROCESSES; MATRIX NORMS; RANDOM MATRICES; RANK;

ALGORITHMS; CONVEX OPTIMIZATION; GAUSSIAN DISTRIBUTION; GAUSSIAN NOISE (ELECTRONIC); MATHEMATICAL OPERATORS; OPTIMIZATION; QUADRATIC PROGRAMMING; SIGNAL RECONSTRUCTION;

MATRIX ALGEBRA;

EID: 79952759680     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0422-2     Document Type: Article

References (38)

1. Ames, B.P.W., Vavasis, S.A.: Nuclear norm minimization for the planted clique and biclique problems (2009). Submitted to Mathematical Programming. Preprint available at http://arxiv.org/abs/0901.3348v1
2. Amit, Y., Fink, M., Srebro, N., Ullman, S.: Uncovering shared structures in multiclass classification. In: Proceedings of the International Conference of Machine Learning (2007)
3. Argyriou, A., Micchelli, C.A., Pontil, M.: Convex multi-task feature learning. Machine Learning (2008). Published online first at http://www.springerlink.com/
4. Z.D. Bai 1999 Methodologies in spectral analysis of large dimensional random matrices Statistica Sinica 9 3 611 661 0949.60077 1711663
5. Baraniuk, R., Davenport, M., DeVore, R., Wakin, M.: A simple proof of the restricted isometry property for random matrices. Constructive Approximation (2008). To Appear. Preprint available at http://dsp.rice.edu/cs/jlcs-v03.pdf
6. Beck, C., D'Andrea, R.: Computational study and comparisons of LFT reducibility methods. In: Proceedings of the American Control Conference (1998)
7. J.F. Cai E.J. Candès Z. Shen 2008 A singular value thresholding algorithm for matrix completion SIAM J. Optim. 20 4 1956 1982 10.1137/080738970
8. E. Candès B. Recht 2009 Exact matrix completion via convex optimization Found. Comput. Math. 9 6 717 772 05662128 10.1007/s10208-009-9045-5 2565240
9. E.J. Candès J. Romberg T. Tao 2006 Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information IEEE Trans. Inf. Theory 52 2 489 509 10.1109/TIT.2005.862083 (Pubitemid 43174093)
10. E.J. Candès T. Tao 2005 Decoding by linear programming IEEE Trans. Inf. Theory 51 12 4203 4215 10.1109/TIT.2005.858979 (Pubitemid 41800353)
11. D. Donoho 2006 High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension Discret. Comput. Geom. 35 4 617 652 1095.52500 10.1007/s00454-005-1220-0 2225676 (Pubitemid 43701356)
12. D. Donoho X. Huo 2001 Uncertainty principles and ideal atomic decomposition IEEE Trans. Inf. Theory 47 7 2845 2862 1019.94503 10.1109/18.959265 1872845 (Pubitemid 33053488)
13. D.L. Donoho J. Tanner 2005 Neighborliness of randomly projected simplices in high dimensions Proc. Natl. Acad. Sci. USA 102 27 9452 9457 1135.60300 10.1073/pnas.0502258102 2168716 (Pubitemid 40981702)
14. D.L. Donoho J. Tanner 2005 Sparse nonnegative solution of underdetermined linear equations by linear programming Proc. Natl. Acad. Sci. USA 102 27 9446 9451 10.1073/pnas.0502269102 2168715 (Pubitemid 40981701)
15. Fazel, M.: Matrix Rank Minimization with Applications. Ph.D. thesis, Stanford University (2002)
16. Fazel, M., Hindi, H., Boyd, S.: A rank minimization heuristic with application to minimum order system approximation. In: Proceedings of the American Control Conference (2001)
17. El Ghaoui, L., Gahinet, P.: Rank minimization under LMI constraints: a framework for output feedback problems. In: Proceedings of the European Control Conference (1993)
18. Y. Gordon 1985 Some inequalities for Gaussian processes and applications Israel J. Math. 50 265 289 0663.60034 10.1007/BF02759761 800188
19. Y. Gordon 1988 Gaussian processes and almost spherical sections of convex bodies Ann. Probab. 16 180 188 0639.60046 10.1214/aop/1176991893 920263
20. Ledoux M., Talagrand M.: Probability in Banach Spaces. Springer, Berlin (1991)
21. Lee, K., Bresler, Y.: Efficient and guaranteed rank minimization by atomic decomposition. In: IEEE International Symposium on Information Theory (2009)
22. N. Linial E. London Y. Rabinovich 1995 The geometry of graphs and some of its algorithmic applications Combinatorica 15 215 245 0827.05021 10.1007/BF01200757 1337355
23. Z. Liu L. Vandenberghe 2009 Interior-point method for nuclear norm approximation with application to system identification SIAM J. Matrix Anal. Appl. 31 3 1235 1256 10.1137/090755436 2558821
24. Ma, S., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization (2008). Preprint available at http://www. optimization-online.org/DB-HTML/2008/11/2151.html
25. V.A. Marčenko L.A. Pastur 1967 Distributions of eigenvalues for some sets of random matrices Math. USSR-Sbornik 1 457 483 10.1070/ SM1967v001n04ABEH001994
26. Meka, R., Jain, P., Caramanis, C., Dhillon, I.S.: Rank minimization via online learning. In: Proceedings of the International Conference on Machine Learning (2008)
27. M. Mesbahi G.P. Papavassilopoulos 1997 On the rank minimization problem over a positive semidefinite linear matrix inequality IEEE Trans. Autom. Control 42 2 239 243 0872.93029 10.1109/9.554402 1438452 (Pubitemid 127760583)
28. P.A. Parrilo S. Khatri 2000 On cone-invariant linear matrix inequalities IEEE Trans. Automat. Control 45 8 1558 1563 0988.93029 10.1109/9.871772 1797416
29. B. Recht M. Fazel P. Parrilo 2010 Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization SIAM Rev. 52 3 471 501 1198.90321 10.1137/070697835 2680543
30. Recht, B., Xu, W., Hassibi, B.: Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization. In: Proceedings of the 47th IEEE Conference on Decision and Control (2008)
31. Rennie, J.D.M., Srebro, N.: Fast maximum margin matrix factorization for collaborative prediction. In: Proceedings of the International Conference of Machine Learning (2005)
32. D. Slepian 1962 The one-sided barrier problem for Gaussian noise Bell Syst. Tech. J. 41 463 501 133183
33. Stojnic, M., Xu, W., Hassibi, B.: Compressed sensing - probabilistic analysis of a null-space characterization. In: IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP) (2008)
34. J.F. Sturm 1999 Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones Optim. Methods Softw. 11-12 625 653 10.1080/10556789908805766 1778433
35. Szarek, S.J.: Metric entropy of homogeneous spaces. In: Quantum probability (Gdańsk, 1997), Banach Center Publ., vol. 43, pp. 395-410. Polish Acad. Sci., Warsaw (1998). Preprint available at arXiv:math/ 9701213v1
36. K.Q. Weinberger L.K. Saul 2006 Unsupervised learning of image manifolds by semidefinite programming Int. J. Comput. Vis. 70 1 77 90 10.1007/s11263-005- 4939-z (Pubitemid 43855868)
37. M. Yuan A. Ekici Z. Lu R. Monteiro 2007 Dimension reduction and coefficient estimation in multivariate linear regression J. Roy. Stat. Soc. Ser. B 69 329 346 10.1111/j.1467-9868.2007.00591.x 2323756
38. 1 minimization: go over or under? Tech. Rep. TR05-09, Rice CAAM Department (2005)