Exact Matrix Completion via Convex Optimization

Keywords

MathematicsRank (graph theory)CombinatoricsMatrix completionMatrix (chemical analysis)Matrix normExponentRegular polygonConvex optimizationLow-rank approximationNorm (philosophy)Convex bodySimple (philosophy)Binary logarithmConstant (computer programming)Discrete mathematicsMathematical analysisGeometryComputer science

Affiliated Institutions

California Institute of Technology US

Related Publications

The Power of Convex Relaxation: Near-Optimal Matrix Completion

Emmanuel J. Candès , Terence Tao

This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a ...

2010 IEEE Transactions on Information Theory 2104 citations

Rank-Sparsity Incoherence for Matrix Decomposition

Venkat Chandrasekaran , Sujay Sanghavi , Pablo A. Parrilo +1 more

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

2011 SIAM Journal on Optimization 653 citations

Matrix Completion With Noise

Emmanuel J. Candès , Yaniv Plan

On the heels of compressed sensing, a new field\nhas very recently emerged. This field addresses a broad range\nof problems of significant practical interest, namely, ...

2010 Proceedings of the IEEE 1703 citations

A Singular Value Thresholding Algorithm for Matrix Completion

Jian‐Feng Cai , Emmanuel J. Candès , Zuowei Shen

This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understoo...

2010 SIAM Journal on Optimization 5710 citations

Interior-Point Method for Nuclear Norm Approximation with Application to System Identification

Zhang Liu , Lieven Vandenberghe

The nuclear norm (sum of singular values) of a matrix is often used in convex heuristics for rank minimization problems in control, signal processing, and statistics. Such heuri...

2009 SIAM Journal on Matrix Analysis and A... 504 citations

Publication Info

Year: 2009
Type: article
Volume: 9
Issue: 6
Pages: 717-772
Citations: 5052
Access: Closed

External Links

View on DOI.org

Social Impact

Altmetric

Exact Matrix Completion via Convex Optimization

PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

5052

OpenAlex

Cite This

APA Style

                            
                                    Emmanuel J. Candès, 
                                
                                    Benjamin Recht
                                
                            (2009). 
                            Exact Matrix Completion via Convex Optimization. 
                            Foundations of Computational Mathematics
                            , 9
                            (6)
                            , 717-772.
                            https://doi.org/10.1007/s10208-009-9045-5

Identifiers

DOI: 10.1007/s10208-009-9045-5