Near-Optimal Bounds for Phase Synchronization
Publication:4637501
DOI10.1137/17M1122025zbMath1396.90068arXiv1703.06605OpenAlexW2598300585WikidataQ130044978 ScholiaQ130044978MaRDI QIDQ4637501
Publication date: 24 April 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.06605
nonconvex optimizationmaximum likelihood estimatorquadratically constrained quadratic programsemidefinite programming relaxationangular synchronizationprojected power methodeigenvector perturbation bound
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (33)
Cites Work
- Unnamed Item
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
- Angular synchronization by eigenvectors and semidefinite programming
- Spectral clustering and the high-dimensional stochastic blockmodel
- The largest eigenvalues of finite rank deformation of large Wigner matrices: Convergence and nonuniversality of the fluctuations
- Fundamental limits of symmetric low-rank matrix estimation
- Random Laplacian matrices and convex relaxations
- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- Nonconvex Phase Synchronization
- Eigenvector synchronization, graph rigidity and the molecule problem
- Generalized power method for sparse principal component analysis
- Phase transitions in semidefinite relaxations
- Non-asymptotic theory of random matrices: extreme singular values
- Robust regression using iteratively reweighted least-squares
- Synchronization over Cartan Motion Groups via Contraction
- On Intrinsic Cramér-Rao Bounds for Riemannian Submanifolds and Quotient Manifolds
- The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences
- Viewing Direction Estimation in Cryo-EM Using Synchronization
- Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
- Computational complexity versus statistical performance on sparse recovery problems
- Exact and stable recovery of rotations for robust synchronization
- On Consistency and Sparsity for Principal Components Analysis in High Dimensions
- A useful variant of the Davis–Kahan theorem for statisticians
- Complex Quadratic Optimization and Semidefinite Programming
- The Rotation of Eigenvectors by a Perturbation. III
This page was built for publication: Near-Optimal Bounds for Phase Synchronization