Low-rank matrix completion using nuclear norm minimization and facial reduction

Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier

(2017) D. Drusvyatskiy et al.   SIAM JOURNAL ON OPTIMIZATION

Low rank matrix completion by alternating steepest descent methods

(2016) Jared Tanner et al.   APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS

Randomized Sketches of Convex Programs With Sharp Guarantees

(2015) Mert Pilanci et al.   IEEE TRANSACTIONS ON INFORMATION THEORY

Coordinate Shadows of Semidefinite and Euclidean Distance Matrices

(2015) Dmitriy Drusvyatskiy et al.   SIAM JOURNAL ON OPTIMIZATION

The Power of Convex Relaxation: Near-Optimal Matrix Completion

(2010) Emmanuel J. Candes et al.   IEEE TRANSACTIONS ON INFORMATION THEORY

Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions

(2010) Nathan Krislock et al.   SIAM JOURNAL ON OPTIMIZATION

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

(2010) Benjamin Recht et al.   SIAM REVIEW

Exact Matrix Completion via Convex Optimization

(2009) Emmanuel J. Candès et al.   FOUNDATIONS OF COMPUTATIONAL MATHEMATICS