Exact Matrix Completion via Convex Optimization
- First Online:
- Cite this article as:
- Candès, E.J. & Recht, B. Found Comput Math (2009) 9: 717. doi:10.1007/s10208-009-9045-5
- 14k Views
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?