Home → Magazine Archive → June 2012 (Vol. 55, No. 6) → Exact Matrix Completion via Convex Optimization → Abstract

Exact Matrix Completion via Convex Optimization

By Emmanuel Candès, Benjamin Recht

Communications of the ACM, Vol. 55 No. 6, Pages 111-119

[article image]

Suppose that one observes an incomplete subset of entries selected from a low-rank matrix. When is it possible to complete the matrix and recover the entries that have not been seen?

The full text of this article is premium content


No entries found