Rank-Sparsity Incoherence for Matrix Decomposition


Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-rank components. Such a problem arises in a number of applications in model and system identification and is intractable to solve in general. In this paper we consider a convex… (More)
DOI: 10.1137/090761793

3 Figures and Tables



Citations per Year

759 Citations

Semantic Scholar estimates that this publication has 759 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics