Sparse and low-rank matrix decompositions

We consider the following fundamental problem: given a matrix that is the sum of an unknown sparse matrix and an unknown low-rank matrix, is it possible to exactly recover the two components? Such a capability enables a considerable number of applications, but the goal is both ill-posed and NP-hard...

Full description

Bibliographic Details
Main Authors: Chandrasekaran, Venkat (Contributor), Sanghavi, Sujay (Contributor), Parrilo, Pablo A. (Contributor), Willsky, Alan S. (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers, 2010-10-07T17:14:23Z.
Subjects:
Online Access:Get fulltext