Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs

Abstract

We consider semidefinite programs (SDPs) with equality constraints. The variable to be optimized is a positive semidefinite matrix $X$ of size $n$. Following the Burer--Monteiro approach, we optimize a factor $Y$ of size $n\times p$ instead, such that $X=Y{Y}^T$. This ensures positive semidefiniteness at no cost and can reduce the dimension of the problem if $p$ is small, but results in a non-convex optimization problem with a quadratic cost function and quadratic equality constraints in $Y$. In this paper, we show that if the set of constraints on $Y$ regularly defines a smooth manifold, then, despite non-convexity, first- and second-order necessary optimality conditions are also sufficient, provided $p$ is large enough. For smaller values of $p$, we show a similar result holds for almost all (linear) cost functions. Under those conditions, a global optimum $Y$ maps to a global optimum $X=Y{Y}^T$ of the SDP. We deduce old and new consequences for SDP relaxations of the generalized eigenvector problem, the trust-region subproblem and quadratic optimization over several spheres, as well as for the Max-Cut and Orthogonal-Cut SDPs which are common relaxations in stochastic block modeling and synchronization of rotations.

28 pages, Communications on Pure and Applied Mathematics: https://onlinelibrary.wiley.com/doi/abs/10.1002/cpa.21830

Cited by in corpus (18)

• Chordal and factor-width decompositions for scalable semidefinite and polynomial optimization
• Adaptive regularization with cubics on manifolds
• The background method: Theory and computations
• Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
• The effect of smooth parametrizations on nonconvex optimization landscapes
• Fair Principal Component Analysis and Filter Design
• On Semidefinite Relaxations for Matrix-Weighted State-Estimation Problems in Robotics
• Improved Global Guarantees for the Nonconvex Burer--Monteiro Factorization via Rank Overparameterization
• Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
• Low-Rank Univariate Sum of Squares Has No Spurious Local Minima
• Time-Varying Semidefinite Programming: Path Following a Burer-Monteiro Factorization
• Optimization via Quantum Preconditioning
• Complexity of Chordal Conversion for Sparse Semidefinite Programs with Small Treewidth
• Global minimization of polynomial integral functionals
• Over-Parametrized Matrix Factorization in the Presence of Spurious Stationary Points
• Nonconvex landscapes for ${\mathbf{Z}}_2$ synchronization and graph clustering are benign near exact recovery thresholds
• The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
• Exact and Heuristic Algorithms for Constrained Biclustering