Rank-sparsity incoherence for matrix decomposition

SIAM Journal on Optimization

Volumn 21, Issue 2, 2011, Pages 572-596

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

^a USA   (United States)

^b The University of Texas at Austin   (United States)

Author keywords

Convex relaxation; L1 norm minimization; Matrix decomposition; Nuclear norm minimization; Rank; Semidefinite programming; Sparsity; Uncertainty principle

Indexed keywords

CONVEX RELAXATION; L1 NORM MINIMIZATION; MATRIX DECOMPOSITION; NUCLEAR NORM MINIMIZATION; RANK; SEMI-DEFINITE PROGRAMMING; SPARSITY; UNCERTAINTY PRINCIPLES;

CONVEX OPTIMIZATION; RELAXATION PROCESSES;

MATRIX ALGEBRA;

EID: 79960591511     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/090761793     Document Type: Article

References (33)

1. D. P. BERTSEKAS, A. NEDIC, AND A. E. OZDAGLAR, Convex Analysis and Optimization, Athena Scientific, Belmont, MA, 2003.
2. B. BOLLOBÁS, Random Graphs, Cambridge University Press, London, 2001.
3. E. J. CANDEÀS, J. ROMBERG, AND T. TAO, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inform. Theory, 52 (2006), pp. 489-509. (Pubitemid 43174093)
4. E. J. CANDEÀS AND B. RECHT, Exact Matrix Completion via Convex Optimization, ArXiv 0805.4471v1, 2008.
5. E. J. CANDEÀS, X. LI, Y. MA, AND J. WRIGHT, Robust Principal Component Analysis?, preprint.
6. V. CHANDRASEKARAN, S. SANGHAVI, P. A. PARRILO, AND A. S. WILLSKY, Sparse and low-rank matrix decompositions, in Proceedings of the 15th IFAC Symposium on System Identification, 2009.
7. V. CHANDRASEKARAN, P. A. PARRILO, AND A. S. WILLSKY, Latent-Variable Graphical Model Selection via Convex Optimization, preprint, 2010.
8. B. CODENOTTI, Matrix rigidity, Linear Algebra Appl., 304 (2000), pp. 181-192.
9. D. L. DONOHO AND X. HUO, Uncertainty principles and ideal atomic decomposition, IEEE Trans. Inform. Theory, 47 (2001), pp. 2845-2862. (Pubitemid 33053488)
10. 1 minimization, Proc. Nat. Acad. Sci. USA, 100 (2003), pp. 2197-2202. (Pubitemid 36297476)
11. 1-norm solution is also the sparsest solution, Comm. Pure Appl. Math., 59 (2006), pp. 797-829. (Pubitemid 43667226)
12. D. L. DONOHO, Compressed sensing, IEEE Trans. Inform. Theory, 52 (2006), pp. 1289-1306.
13. M. FAZEL AND J. GOODMAN, Approximations for Partially Coherent Optical Imaging Systems, Technical Report, Department of Electrical Engineering, Stanford University, Palo Alto, CA, 1998.
14. M. FAZEL, Matrix Rank Minimization with Applications, Ph.D. thesis, Department of Electrical Engineering, Stanford University, Palo Alto, CA, 2002.
15. M. FAZEL, H. HINDI, AND S. BOYD, Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices, in Proceedings of the American Control Conference, 2003.
16. J. GOODMAN, Introduction to Fourier Optics, Roberts, Greenwood Village, CO, 2004.
17. J. HARRIS, Algebraic Geometry: A First Course, Springer-Verlag, Berlin, 1995.
18. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, London, 1990.
19. S. L. LAURITZEN, Graphical Models, Oxford University Press, London, 1996.
20. J. LOFBERG, YALMIP: A toolbox for modeling and optimization in MATLAB, in Proceedings of the 2004 IEEE International Symposium on Computer Aided Control Systems Design, Taiwan, 2004, pp. 284-289; also available online from http://control.ee.ethz.ch/~joloef/yalmip.php. (Pubitemid 40788529)
21. S. LOKAM, Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity, in Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, 1995, pp. 6-15.
22. M. MAHAJAN AND J. SARMA, On the compelxity of matrix rank and rigidity, Theory Comput. Syst., 46 (2010), pp. 9-26.
23. M. MESBAHI AND G. P. PAPAVASSILOPOULOS, On the rank minimization problem over a positive semidefinite linear matrix inequality, IEEE Trans. Automat. Control, 42 (1997), pp. 239-243. (Pubitemid 127760583)
24. Y. C. PATI AND T. KAILATH, Phase-shifting masks for microlithography: Automated design and mask requirements, J. Opti. Soc. Amer. A, 11 (1994), pp. 2438-2452.
25. B. RECHT, M. FAZEL, AND P. A. PARRILO, Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization, SIAM Rev., 52 (2007), pp. 471-501.
26. B. RECHT, personal communication, 2009.
27. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1996.
28. I. SCHUR, Bemerkungen zur Theorie der beschrankten Bilinearformen mit unendlich vielen Verander-lischen, J. Reine. Angew. Math., 140 (1911), pp. 1-28.
29. E. SONTAG, Mathematical Control Theory, Springer-Verlag, New York, 1998.
30. K. C. TOH, M. J. TODD, AND R. H. TUTUNCU, SDPT3 - a MATLAB software package for semidefinite-quadratic-linear programming, http://www.math.nus.edu. sg/~mattohkc/sdpt3.html.
31. L. G. VALIANT, Graph-theoretic arguments in low-level complexity, in Mathematical Foundations of Computer Science 1977, Lecture Notes in Comput. Sci. 53, Springer-Verlag, Berlin, 1977, pp. 162-176.
32. L. VANDENBERGHE AND S. BOYD, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95. (Pubitemid 126610912)
33. G. A. WATSON, Characterization of the subdifferential of some matrix norms, Linear Algebra Appl., 170 (1992), pp. 1039-1053.