Stable Rank-One Matrix Completion is Solved by the Level 2 Lasserre Relaxation
- 25 September 2020
- journal article
- research article
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 21 (4) , 891-940
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex ProgrammingCommunications on Pure and Applied Mathematics, 2012
- Theta Bodies for Polynomial IdealsSIAM Journal on Optimization, 2010
- Uniqueness of Low-Rank Matrix Completion by Rigidity TheorySIAM Journal on Matrix Analysis and Applications, 2010
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Local Minima and Convergence in Low-Rank Semidefinite ProgrammingMathematical Programming, 2004
- Semidefinite programming relaxations for semialgebraic problemsMathematical Programming, 2003
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorizationMathematical Programming, 2003
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Class of global minimum bounds of polynomial functionsCybernetics and Systems Analysis, 1988
- An approach to obtaining global extremums in polynomial mathematical programming problemsCybernetics and Systems Analysis, 1988