Benign landscape for Burer-Monteiro factorizations of MaxCut-type semidefinite programs

Self-entrainment of a population of coupled non-linear oscillators

Y. Kuramoto · 1975

Earlier work this paper cites.

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

M. X. Goemans and D. P. Williamson · 1995

Earlier work this paper cites.

On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues

G. Pataki · 1998

Earlier work this paper cites.

Solving large-scale sparse semidefinite programs for combinatorial optimization

S. J. Benson, Y. Ye, and X. Zhang · 2000

Earlier work this paper cites.

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

S. Burer and R. D. C. Monteiro · 2003

Earlier work this paper cites.

Learning the kernel matrix with semidefinite programming

G. R. G. Lanckriet, N. Cristianini, P. Bartlett, L. El Ghaoui, and M. I. Jordan · 2004

Earlier work this paper cites.

Optimization algorithms on matrix manifolds

P.-A. Absil · 2008

Earlier work this paper cites.

Low-rank optimization on the cone of positive semidefinite matrices

M. Journée, F. Bach, P.-A. Absil, and R. Sepulchre · 2010

Earlier work this paper cites.

PhaseLift: exact and stable signal recovery from magnitude measurements via convex programming

E. J. Candès, T. Strohmer, and V. Voroninski · 2013

Earlier work this paper cites.

Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery

E. Abbe, A. S. Bandeira, A. Bracher, and A. Singer · 2014

Earlier work this paper cites.

Phase recovery, maxcut and complex semidefinite programming

I. Waldspurger, A. d’Aspremont, and S. Mallat · 2015

Cited alongside, same era.

Conic optimization via operator splitting and homogeneous self-dual embedding

B. O’donoghue, E. Chu, N. Parikh, and S. Boyd · 2016

Cited alongside, same era.

Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality

S. Mei, T. Misiakiewicz, A. Montanari, and R. I. Oliveira · 2017

Cited alongside, same era.

Random Laplacian matrices and convex relaxations

A. S. Bandeira · 2018

Cited alongside, same era.

High-dimensional probability: An introduction with applications in data science , volume 47

R. Vershynin · 2018

Cited alongside, same era.

First-order methods almost always avoid strict saddle points

J. D. Lee, I. Panageas, G. Piliouras, M. Simchowitz, M. I. Jordan, and B. Recht · 2019

Expander graphs are globally synchronizing

Original

P. Abdalla, A. S. Bandeira, M. Kassabov, V. Souza, S. H. Strogatz, and A. Townsend · 2022

Later among the works it cites.

The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound

L. O’Carroll, V. Srinivas, and A. Vijayaraghavan · 2022

Later among the works it cites.

An introduction to optimization on smooth manifolds

N. Boumal · 2023

Later among the works it cites.

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs

A. D. McRae and N. Boumal · 2024

Closest in time.

Nonconvex landscapes for ℤ 2 \mathbb{Z}_{2} synchronization and graph clustering are benign near exact recovery thresholds

Original

A. D. McRae, P. Abdalla, A. S. Bandeira, and N. Boumal · 2024

Closest in time.