Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
From MaRDI portal
Publication:5114191
DOI10.1002/cpa.21830zbMath1445.90074arXiv1804.02008OpenAlexW3106518847WikidataQ114238011 ScholiaQ114238011MaRDI QIDQ5114191
Nicolas Boumal, Vladislav Voroninski, Afonso S. Bandeira
Publication date: 21 June 2020
Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.02008
Related Items (34)
Sums of squares and quadratic persistence on real projective varieties ⋮ Spurious Valleys in Two-layer Neural Network Optimization Landscapes ⋮ Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods ⋮ Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method ⋮ Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis ⋮ An entropy-regularized ADMM for binary quadratic programming ⋮ An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs ⋮ Solving trust region subproblems using Riemannian optimization ⋮ A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming ⋮ A unified approach to synchronization problems over subgroups of the orthogonal group ⋮ Solving graph equipartition SDPs on an algebraic variety ⋮ Using negative curvature in solving nonlinear programs ⋮ Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization ⋮ An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization ⋮ Max-Cut via Kuramoto-Type Oscillators ⋮ Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method ⋮ Low-Rank Univariate Sum of Squares Has No Spurious Local Minima ⋮ Linear Programming on the Stiefel Manifold ⋮ A hybrid Riemannian conjugate gradient method for nonconvex optimization problems ⋮ A brief introduction to manifold optimization ⋮ Notes on computational-to-statistical gaps: predictions using statistical physics ⋮ Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation ⋮ A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion ⋮ On the Simplicity and Conditioning of Low Rank Semidefinite Programs ⋮ Adaptive regularization with cubics on manifolds ⋮ On the Burer-Monteiro method for general semidefinite programs ⋮ Rank Optimality for the Burer--Monteiro Factorization ⋮ Provable accelerated gradient method for nonconvex low rank optimization ⋮ Nonconvex Phase Synchronization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids ⋮ Unnamed Item
This page was built for publication: Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
