Local geometry determines global landscape in low-rank factorization for synchronization
From MaRDI portal
Nonlinear oscillations and coupled oscillators for ordinary differential equations (34C15) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Programming involving graphs or networks (90C35) Optimality conditions and duality in mathematical programming (90C46)
Cites work
- A feasible method for optimization with orthogonality constraints
- A geometric analysis of phase retrieval
- A Global synchronization theorem for oscillators on a random graph
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian
- A unified approach to synchronization problems over subgroups of the orthogonal group
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions
- Almost global consensus on the n-sphere
- An Introduction to Optimization on Smooth Manifolds
- Angular synchronization by eigenvectors and semidefinite programming
- Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
- Community detection and stochastic block models: recent developments
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Dense networks that do not synchronize and sparse ones that do
- Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs
- Entrywise eigenvector analysis of random matrices with low expected rank
- Exact Recovery in the Stochastic Block Model
- Generalized Procrustes analysis
- Global registration of multiple point clouds using semidefinite programming
- Heuristics for semirandom graph problems
- High-dimensional Kuramoto models on Stiefel manifolds synchronize complex networks almost globally
- High-dimensional probability. An introduction with applications in data science
- High-dimensional statistics. A non-asymptotic viewpoint
- How robust are reconstruction thresholds for community detection?
- scientific article; zbMATH DE number 3524004 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improved performance guarantees for orthogonal group synchronization via generalized power method
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Lifting sum-of-squares lower bounds: degree-2 to degree-4
- Local minima and convergence in low-rank semidefinite programming
- Matrix concentration inequalities and free probability
- Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method
- Near-optimal bounds for phase synchronization
- Non-convex exact community recovery in stochastic block model
- Nonconvex phase synchronization
- On the estimation performance and convergence rate of the generalized power method for phase synchronization
- On the landscape of synchronization networks: a perspective from nonconvex optimization
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Random Laplacian matrices and convex relaxations
- Rank optimality for the Burer-Monteiro factorization
- Reducibility among combinatorial problems
- Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis
- Sufficiently dense Kuramoto networks are globally synchronizing
- Three-dimensional structure determination from common lines in cryo-EM by eigenvectors and semidefinite programming
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- Universality and sharp matrix concentration inequalities
- User-friendly tail bounds for sums of random matrices
This page was built for publication: Local geometry determines global landscape in low-rank factorization for synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285626)