# Rank-Sparsity Incoherence for Matrix Decomposition

@article{Chandrasekaran2011RankSparsityIF, title={Rank-Sparsity Incoherence for Matrix Decomposition}, author={V. Chandrasekaran and S. Sanghavi and P. Parrilo and A. Willsky}, journal={SIAM J. Optim.}, year={2011}, volume={21}, pages={572-596} }

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. Suc...

#### Figures and Topics from this paper

#### 954 Citations

Low-Rank/Sparse-Inverse Decomposition via Woodbury

- Mathematics, Computer Science
- OR
- 2016

Based on the Woodbury matrix identity, we present a heuristic and a test-problem generation method for decomposing an invertible input matrix into a low-rank component and a component having a sparse… Expand

Matrix Completion and Low-Rank Matrix Recovery

- Mathematics
- 2014

This chapter is a natural development following Chap. 7. In other words, Chaps. 7 and 8 may be viewed as two parallel developments. In Chap. 7, compressed sensing exploits the sparsity structure in a… Expand

Exact recovery of low-rank plus compressed sparse matrices

- Mathematics, Computer Science
- 2012 IEEE Statistical Signal Processing Workshop (SSP)
- 2012

Analysis and simulations confirm that the said convex program can recover the unknowns for sufficiently low-rank and sparse enough components, along with a compression matrix possessing an isometry property. Expand

Bayesian methods for sparse and low-rank matrix problems

- Computer Science
- 2016

This paper presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and expensive process of manually cataloging and cataloging individual atoms and molecules in a discrete-time manner. Expand

Sparse and Low-Rank Tensor Decomposition

- Computer Science, Mathematics
- NIPS
- 2015

An efficient computational algorithm is presented that modifies Leurgans' algorithm for tensor factorization via the notion of tensor contraction and uses well-understood convex techniques for solving the reduced matrix sub-problem which then allows the full decomposition of the tensor. Expand

Sparse and low-rank matrix decompositions

- Mathematics
- 2009

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… Expand

Sparse and low-rank matrix decompositions

- Mathematics
- 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
- 2009

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… Expand

Randomized subspace learning approach for high dimensional low rank plus sparse matrix decomposition

- Mathematics, Computer Science
- 2015 49th Asilomar Conference on Signals, Systems and Computers
- 2015

The high dimensional matrix decomposition problem is converted to a subspace learning problem, which is a low-dimensional optimization problem, and the proposed method uses a small random subset of the data rather than the whole big data matrix. Expand

Robust Algorithms for Low-Rank and Sparse Matrix Models

- Computer Science
- 2018

A selection of images from around the world can be found at www.dropboxusercontent.com/taskbar/s3/index.php?action=detail&task=detail and are safe to store and retrieval. Expand

Rank-one and sparse matrix decomposition for dynamic MRI

- Mathematics
- 2015

We introduce a rank-one and sparse matrix decomposition model for dynamic magnetic resonance imaging (MRI). Since
$l_p$-norm $(0 < p < 1)$ is generally nonconvex, nonsmooth,
non-Lipschitz, we… Expand

#### References

SHOWING 1-10 OF 50 REFERENCES

Sparse and low-rank matrix decompositions

- Mathematics
- 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
- 2009

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… Expand

Exact matrix completion via convex optimization

- Mathematics, Computer Science
- CACM
- 2012

It is demonstrated that in very general settings, one can perfectly recover all of the missing entries from most sufficiently large subsets by solving a convex programming problem that finds the matrix with the minimum nuclear norm agreeing with the observed entries. Expand

On the rank minimization problem over a positive semidefinite linear matrix inequality

- Mathematics, Computer Science
- IEEE Trans. Autom. Control.
- 1997

We consider the problem of minimizing the rank of a positive semidefinite matrix, subject to the constraint that an affine transformation of it is also positive semidefinite. Our method for solving… Expand

Exact Matrix Completion via Convex Optimization

- Mathematics, Computer Science
- Found. Comput. Math.
- 2009

It is proved that one can perfectly recover most low-rank matrices from what appears to be an incomplete set of entries, and that objects other than signals and images can be perfectly reconstructed from very limited information. Expand

Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization

- Computer Science, Medicine
- Proceedings of the National Academy of Sciences of the United States of America
- 2003

This article obtains parallel results in a more general setting, where the dictionary D can arise from two or several bases, frames, or even less structured systems, and sketches three applications: separating linear features from planar ones in 3D data, noncooperative multiuser encoding, and identification of over-complete independent component models. Expand

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

- Mathematics, Computer Science
- SIAM Rev.
- 2010

It is shown that if a certain restricted isometry property holds for the linear transformation defining the constraints, the minimum-rank solution can be recovered by solving a convex optimization problem, namely, the minimization of the nuclear norm over the given affine space. Expand

Robust principal component analysis?

- Computer Science, Mathematics
- JACM
- 2011

It is proved that under some suitable assumptions, it is possible to recover both the low-rank and the sparse components exactly by solving a very convenient convex program called Principal Component Pursuit; among all feasible decompositions, this suggests the possibility of a principled approach to robust principal component analysis. Expand

Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization

- Computer Science, Mathematics
- NIPS
- 2009

It is proved that most matrices A can be efficiently and exactly recovered from most error sign-and-support patterns by solving a simple convex program, for which it is given a fast and provably convergent algorithm. Expand

Characterization of the subdifferential of some matrix norms

- Mathematics
- 1992

Abstract A characterization is given of the subdifferential of matrix norms from two classes, orthogonally invariant norms and operator (or subordinate) norms. Specific results are derived for some… Expand

For most large underdetermined systems of linear equations the minimal 1-norm solution is also the sparsest solution

- Mathematics
- 2006

We consider linear equations y = Φx where y is a given vector in ℝn and Φ is a given n × m matrix with n 0 so that for large n and for all Φ's except a negligible fraction, the following property… Expand