Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2008, Pages 3065-3070

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

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b California Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROLLERS; HEURISTIC ALGORITHMS;

ACCURATE PREDICTION; CONTROL APPLICATIONS; LINEAR CONSTRAINTS; OPTIMIZATION PROBLEMS; PRACTICAL PROBLEMS; PROBABILISTIC BOUNDS; RANK OF A MATRIXES; REALIZATION THEORY;

PROBABILITY DISTRIBUTIONS;

EID: 62949189702     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2008.4739332     Document Type: Conference Paper

References (18)

1. R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, "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.
2. C. Beck and R. D'Andrea, "Computational study and comparisons of LFT reducibility methods," in Proceedings of the American Control Conference, 1998.
3. E. J. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inform. Theory, vol. 52, no. 2, pp. 489-509, 2006.
4. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4203-4215, 2005.
5. D. L. Donoho and J. Tanner, "Neighborliness of randomly projected simplices in high dimensions," Proc. Natl. Acad. Sci. USA, vol. 102, no. 27, pp. 9452-9457, 2005.
6. -, "Sparse nonnegative solution of underdetermined linear equations by linear programming," Proc. Natl. Acad. Sci. USA, vol. 102, no. 27, pp. 9446-9451, 2005.
7. L. El Ghaoui and P. Gahinet, "Rank minimization under LMI constraints: A framework for output feedback problems," in Proceedings of the European Control Conference, 1993.
8. M. Fazel, "Matrix rank minimization with applications," Ph. D. dissertation, Stanford University, 2002.
9. M. Fazel, H. Hindi, and S. Boyd, "A rank minimization heuristic with application to minimum order system approximation," in Proceedings of the American Control Conference, 2001.
10. R. A. Horn and C. R. Johnson, Topics in Matrix Analysis. New York: Cambridge University Press, 1991.
11. N. Linial, E. London, and Y. Rabinovich, "The geometry of graphs and some of its algorithmic applications," Combinatorica, vol. 15, pp. 215-245, 1995.
12. M. Mesbahi and G. P. Papavassilopoulos, "On the rank minimization problem over a positive semidefinite linear matrix inequality," IEEE Transactions on Automatic Control, vol. 42, no. 2, pp. 239-243, 1997.
13. P. A. Parrilo and S. Khatri, "On cone-invariant linear matrix inequalities," IEEE Trans. Automat. Control, vol. 45, no. 8, pp. 1558-1563, 2000.
14. B. Recht, M. Fazel, and P. Parrilo, "Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization," Submitted. Preprint Available at http://www.ist.caltech.edu/brecht/publications.html.
15. B. Recht, W. Xu, and B. Hassibi, "Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization," California Institute of Technology, Tech. Rep., 2008, preprint available at http://arxiv.org/abs/0809.1260.
16. J. D. M. Rennie and N. Srebro, "Fast maximum margin matrix factorization for collaborative prediction," in Proceedings of the International Conference of Machine Learning, 2005.
17. M. Stojnic, W. Xu, and B. Hassibi, "Compressed sensing - probabilistic analysis of a null-space characterization," in IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2008.
18. J. F. Sturm, "Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones," Optimization Methods and Software, vol. 11-12, pp. 625-653, 1999.