Low-Rank Matrix Recovery and Completion …

Low-Rank Matrix Recovery and Completion via Convex Optimization:

We propose powerful tools that exactly and efficiently correct large errors in such structured data. The basic idea is to formulate the problem as a matrix rank minimization problem and solve it efficiently by nuclear-norm minimization. Our algorithms achieve state-of-the-art performance in low-rank matrix recovery with theoretical guarantees.