Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CORR
2008
Springer

favoriteEmaildiscussreport

151views Education» more CORR 2008»

Exact Matrix Completion via Convex Optimization

13 years 5 months ago

Exact Matrix Completion via Convex Optimization

Download www-stat.stanford.edu

We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can perfectly recover most low-rank matrices from what appears to be an incomplete set of entries. We prove that if the number m of sampled entries obeys

Emmanuel J. Candès, Benjamin Recht

Real-time Traffic

CORR 2008 | Data Matrix | Education | Matrix | Matrix M |

claim paper

Related Content

» Robust PCA via Outlier Pursuit

» The power of convex relaxation nearoptimal matrix completion

» Robust Photometric Stereo via LowRank Matrix Completion and Recovery

» Noisy matrix decomposition via convex relaxation Optimal rates in high dimensions

» Exact 1Norm Support Vector Machines Via Unconstrained Convex Differentiable Minimization

» Estimating the Fundamental Matrix via Constrained LeastSquares A Convex Approach

» Integration of Multiview Stereo and Silhouettes Via Convex Functionals on Convex Domains

» Dense Error Correction for LowRank Matrices via Principal Component Pursuit

» Multiview Stereo and Silhouette Consistency via Convex Functionals over Convex Domains

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Emmanuel J. Candès, Benjamin Recht

Comments (0)