Sparse and low-rank matrix decompositions

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 15, Issue PART 1, 2009, Pages 1493-1498

  Chandrasekaran, Venkat ^a   Sanghavi, Sujay ^b   Parrilo, Pablo A ^a   Willsky, Alan S ^a  

^a Department of Electrical Engineering and Computer Science   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXACT SOLUTION; HIGH PROBABILITY; LOW-RANK MATRICES; MATRIX; MATRIX DECOMPOSITION; NP-HARD; OPTIMIZATION FORMULATIONS; SEMIDEFINITE PROGRAMS; SIMULATION RESULT; SPARSE MATRICES; SUFFICIENT CONDITIONS;

CONVEX OPTIMIZATION;

DECOMPOSITION;

EID: 80051618405     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3182/20090706-3-FR-2004.0221     Document Type: Conference Paper

References (17)

1. D. P. Bertsekas, A. Nedic, and A. E. Ozdaglar. Convex Analysis and Optimization. Athena Scientic, Belmont, MA, 2003.
2. B. Bollobas. Random graphs. Cambridge University Press, 2001.
3. E. J. Candes, J. Romberg, and T. Tao. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory, volume 52, number 2, pages 489-509, 2006. (Pubitemid 43174093)
4. E. J. Candes and B. Recht. Exact Matrix Completion Via Convex Optimization. Submitted for publication, 2008.
5. 1-norm solution is also the sparsest solution. Communications on Pure and Applied Mathematics, volume 59, issue 6, pages 797-829, 2006. (Pubitemid 43667226)
6. D. L. Donoho. Compressed sensing. IEEE Transactions on Information Theory, volume 52, number 4, pages 1289-1306, 2006.
7. 1 Minimization. Proceedings of the National Academy of Sciences, volume 100, pages 2197-2202, 2003. (Pubitemid 36297476)
8. M. Fazel. Matrix Rank Minimization with Applications. PhD thesis, Department of Electrical Engineering, Stanford University, 2002.
9. S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications. Bulletin of the American Mathematical Society, volume 43, number 4, pages 439-561, 2006. (Pubitemid 44448254)
10. S. L. Lauritzen. Graphical Models. Oxford University Press, 1996.
11. M. Mesbahi and G. P. Papavassilopoulos. On the rank minimization problem over a positive semidefinite linear matrix inequality. IEEE Transactions on Automatic Control, volume 42, number 2, pages 239-243, 1997. (Pubitemid 127760583)
12. B. Recht, M. Fazel, and P. A. Parrilo. Guaranteed Minimum Rank Solutions to Linear Matrix Equations via Nuclear Norm Minimization. Submitted to SIAM Review, 2007.
13. K. C. Toh, M.J. Todd, and R. H. Tutuncu. SDPT3 - a MATLAB software package for semidefinite-quadratic-linear programming. Available from http://www.math.nus.edu.sg/mattohkc/sdpt3.html.
14. L. G. Valiant. Graph-theoretic arguments in low-level complexity. 6th Symposium on Mathematical Foundations of Computer Science, pages 162-176, 1977.
15. L. Vandenberghe and S. Boyd. Semidefinite Programming. SIAM Review, volume 38, number 1, pages 49-95, 1996. (Pubitemid 126610912)
16. G. A. Watson. Characterization of the subdifferential of some matrix norms. Linear Algebra and Applications, volume 170, pages 1039-1053, 1992.
17. YALMIP: A Toolbox for Modeling and Optimization in MATLAB. Proceedings of the CACSD Conference, Taiwan, 2004. URL http://control.ee.ethz.ch/joloef/ yalmip.php.