A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion

Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs

(2019) Nicolas Boumal et al.   COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS

On the steplength selection in gradient methods for unconstrained optimization

(2018) Daniela di Serafino et al.   APPLIED MATHEMATICS AND COMPUTATION

An inexact dual logarithmic barrier method for solving sparse semidefinite programs

(2018) Stefania Bellavia et al.   MATHEMATICAL PROGRAMMING

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

(2017) Shimeng Huang et al.   JOURNAL OF GLOBAL OPTIMIZATION

An alternating direction algorithm for matrix completion with nonnegative factors

(2012) Yangyang Xu et al.   Frontiers of Mathematics in China

Matrix completion via an alternating direction method

(2011) C. Chen et al.   IMA JOURNAL OF NUMERICAL ANALYSIS

Matrix Completion From a Few Entries

(2010) Raghunandan H. Keshavan et al.   IEEE TRANSACTIONS ON INFORMATION THEORY

ADMiRA: Atomic Decomposition for Minimum Rank Approximation

(2010) Kiryung Lee et al.   IEEE TRANSACTIONS ON INFORMATION THEORY

Matrix Completion With Noise

(2010) Emmanuel J Candes et al.   PROCEEDINGS OF THE IEEE

A Singular Value Thresholding Algorithm for Matrix Completion

(2010) Jian-Feng Cai 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

Fixed point and Bregman iterative methods for matrix rank minimization

(2009) Shiqian Ma et al.   MATHEMATICAL PROGRAMMING

Interior-Point Method for Nuclear Norm Approximation with Application to System Identification

(2009) Zhang Liu et al.   SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS