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

Publication date: 23 April 2024

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

nonconvex optimization quadratically constrained quadratic program Kuramoto model Burer-Monteiro factorization optimization landscape orthogonal group synchronization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

Unnamed Item
Unnamed Item
Sharp nonasymptotic bounds on the norm of random matrices with independent entries
Rotation averaging
Collective synchronization of classical and quantum oscillators
Angular synchronization by eigenvectors and semidefinite programming
Relations for certain symmetric norms and anti-norms before and after partial trace
Synchronization and stability for quantum Kuramoto
Random Laplacian matrices and convex relaxations
High-dimensional Kuramoto models on Stiefel manifolds synchronize complex networks almost globally
Phase retrieval from local measurements: improved robustness via eigenvector-based angular synchronization
Local minima and convergence in low-rank semidefinite programming
On recovery guarantees for angular synchronization
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
Orientation Determination of Cryo-EM Images Using Least Unsquared Deviations
Vector diffusion maps and the connection Laplacian
Manopt, a Matlab toolbox for optimization on manifolds
Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
There is no non-zero stable fixed point for dense networks in the homogeneous Kuramoto model
Non-Abelian Kuramoto models and synchronization
Synchronization on Riemannian Manifolds: Multiply Connected Implies Multistable
Rank Optimality for the Burer--Monteiro Factorization
The lower bound of the network connectivity guaranteeing in-phase synchronization
Sufficiently dense Kuramoto networks are globally synchronizing
Exact Minimax Estimation for Phase Synchronization
An Introduction to Optimization on Smooth Manifolds
SDP Achieves Exact Minimax Optimality in Phase Synchronization
Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
Dense networks that do not synchronize and sparse ones that do
Synchronization of Kuramoto oscillators in dense networks
Exact and stable recovery of rotations for robust synchronization
On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization
Almost global consensus on the n-sphere
A Cheeger Inequality for the Graph Connection Laplacian
Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis

This page was built for publication: Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs