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?
advertisement
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
10.1145/2184319.2184343
![[article image]](https://cacm.acm.org/system/assets/0000/7954/051512_iStock_Exact-Matrix2.large.jpg?1476779418&1337111987 "jigsaw puzzle")
0 Comments
No entries found
Log in to Read the Full Article
Purchase the Article