Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis
Author:
- 1 October 2022
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 200 (1) , 589-628
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Excellent Young Scientists Fund (12001372)
- Shanghai Municipal Education Commission
- New York University Shanghai (Boost Funds)
- National Key Research and Development Program of China (2021YFA1002800)
This publication has 46 references indexed in Scilit:
- Consistent Shape Maps via Semidefinite ProgrammingComputer Graphics Forum, 2013
- The eigenvalues and eigenvectors of finite, low rank perturbations of large random matricesAdvances in Mathematics, 2011
- Three-Dimensional Structure Determination from Common Lines in Cryo-EM by Eigenvectors and Semidefinite ProgrammingSIAM Journal on Imaging Sciences, 2011
- Angular synchronization by eigenvectors and semidefinite programmingApplied and Computational Harmonic Analysis, 2011
- The largest eigenvalues of finite rank deformation of large Wigner matrices: Convergence and nonuniversality of the fluctuationsThe Annals of Probability, 2009
- Phase transition of the largest eigenvalue for nonnull complex sample covariance matricesThe Annals of Probability, 2005
- Local Minima and Convergence in Low-Rank Semidefinite ProgrammingMathematical Programming, 2004
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorizationMathematical Programming, 2003
- Solving semidefinite-quadratic-linear programs using SDPT3Mathematical Programming, 2003
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995