Skip to content

Exact Matrix Completion via Convex Optimization

Emmanuel J. Candès, Benjamin Recht

Foundations of Computational Mathematics · 2009 · 4,980 citationsOpen access

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Candès, E. J., & Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717–772. https://doi.org/10.1007/s10208-009-9045-5

In text: (Candès & Recht, 2009)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

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 $$m\ge C\,n^{1.2}r\log n$$ for some positive numerical constant C, then with very high probability, most n×n matrices of rank r can be perfectly recovered by solving a simple convex optimization program. This program finds the matrix with minimum nuclear norm that fits the data. The condition above assumes that the rank is not too large. However, if one replaces the 1.2 exponent with 1.25, then the result holds for all values of the rank. Similar results hold for arbitrary rectangular matrices as well. Our results are connected with the recent literature on compressed sensing, and show that objects other than signals and images can be perfectly reconstructed from very limited information.

  1. Regression Shrinkage and Selection Via the Lasso1996
  2. A Heteroskedasticity-Consistent Covariance Matrix Estimator and a Direct Test for Heteroskedasticity1980
  3. Classification and Regression Trees.1984
  4. Longitudinal data analysis using generalized linear models1986
  5. Bootstrap Methods: Another Look at the Jackknife1979

Metadata from OpenAlex (CC0). Citations are generated from the published record.