Robust Matrix Completion With Deterministic Sampling Via Convex Optimization
{{output}}
The problem of robust matrix completion-the recovery of a low-rank matrix and a sparse matrix from a sampling of their superposition-has been addressed extensively in prior literature. Yet, much of this work has focused exclusively on the case in which the mat... ...