Fetching the paper…
Reading the bibliography…
The generalized orthogonal Procrustes problem (GOPP) plays a fundamental role in several scientific disciplines including statistics, imaging science and computer vision.
A generalized solution of the orthogonal Procrustes problem
P. H. Schönemann · 1966
Earlier work this paper cites.
The rotation of eigenvectors by a perturbation III
C. Davis and W. M. Kahan · 1970
Earlier work this paper cites.
Perturbation bounds in connection with singular value decomposition
P.-Å. Wedin · 1972
Earlier work this paper cites.
Generalized Procrustes analysis
J. C. Gower · 1975
Earlier work this paper cites.
Method for registration of 3D shapes
P. J. Besl and N. D. McKay · 1992
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.
New perturbation bounds for the unitary polar factor
R.-C. Li · 1995
Earlier work this paper cites.
The geometry of algorithms with orthogonality constraints
A. Edelman, T. A. Arias, and S. T. Smith · 1998
Earlier work this paper cites.
A brief introduction to statistical shape analysis
M. B. Stegmann and D. D. Gomez · 2002
Earlier work this paper cites.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
S. Burer and R. D. Monteiro · 2003
Earlier work this paper cites.
Fixed Point Theory
A. Granas and J. Dugundji · 2003
Earlier work this paper cites.
Procrustes Problems
J. C. Gower and G. B. Dijksterhuis · 2004
Earlier work this paper cites.
Registration of point cloud data from a geometric optimization perspective
N. J. Mitra, N. Gelfand, H. Pottmann, and L. Guibas · 2004
Earlier work this paper cites.
Local minima and convergence in low-rank semidefinite programming
S. Burer and R. D. Monteiro · 2005
Earlier work this paper cites.
Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
A. Nemirovski · 2007
Earlier work this paper cites.
Optimization Algorithms on Matrix Manifolds
P.-A. Absil, R. Mahony, and R. Sepulchre · 2009
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. J. Candès and B. Recht · 2009
Earlier work this paper cites.
Matrix completion from a few entries
R. H. Keshavan, A. Montanari, and S. Oh · 2010
Earlier work this paper cites.
Three-dimensional structure determination from common lines in cryo-em by eigenvectors and semidefinite programming
A. Singer and Y. Shkolnisky · 2011
Earlier work this paper cites.
Moment inequalities for sums of random matrices and their applications in optimization
A. M.-C. So · 2011
Earlier work this paper cites.
User-friendly tail bounds for sums of random matrices
J. A. Tropp · 2012
Earlier work this paper cites.
Blind deconvolution using convex programming
A. Ahmed, B. Recht, and J. Romberg · 2013
Earlier work this paper cites.
Efficient rounding for the noncommutative Grothendieck inequality
A. Naor, O. Regev, and T. Vidick · 2013
Cited alongside, same era.
Exact and stable recovery of rotations for robust synchronization
L. Wang and A. Singer · 2013
Cited alongside, same era.
A feasible method for optimization with orthogonality constraints
Z. Wen and W. Yin · 2013
Cited alongside, same era.
Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery
E. Abbe, A. S. Bandeira, A. Bracher, and A. Singer · 2014
Cited alongside, same era.
Multireference alignment using semidefinite programming
A. S. Bandeira, M. Charikar, A. Singer, and A. Zhu · 2014
Cited alongside, same era.
Open problem: Tightness of maximum likelihood semidefinite relaxations
A. S. Bandeira, Y. Khoo, and A. Singer · 2014
A geometric analysis of phase retrieval
J. Sun, Q. Qu, and J. Wright · 2018
Later among the works it cites.
High-Dimensional Probability: An Introduction with Applications in Data Science
R. Vershynin · 2018
Later among the works it cites.
Near-optimal bounds for phase synchronization
Y. Zhong and N. Boumal · 2018
Later among the works it cites.
SE-Sync: A certifiably correct algorithm for synchronization over the special Euclidean group
D. M. Rosen, L. Carlone, A. S. Bandeira, and J. J. Leonard · 2019
Later among the works it cites.
High-Dimensional Statistics: A Non-Asymptotic Viewpoint
M. J. Wainwright · 2019
Later among the works it cites.
Deterministic guarantees for burer-monteiro factorizations of smooth semidefinite programs
N. Boumal, V. Voroninski, and A. S. Bandeira · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
N. Boumal · 2015
Cited alongside, same era.
Phase retrieval via matrix completion
E. J. Candès, Y. C. Eldar, T. Strohmer, and V. Voroninski · 2015
Cited alongside, same era.
Phase retrieval via Wirtinger flow: Theory and algorithms
E. J. Candès, X. Li, and M. Soltanolkotabi · 2015
Cited alongside, same era.
Global registration of multiple point clouds using semidefinite programming
K. N. Chaudhury, Y. Khoo, and A. Singer · 2015
Cited alongside, same era.
Approximating the little Grothendieck problem over the orthogonal and unitary groups
A. S. Bandeira, C. Kennedy, and A. Singer · 2016
Cited alongside, same era.
Nonconvex phase synchronization
N. Boumal · 2016
Cited alongside, same era.
Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
C. Ma, K. Wang, Y. Chi, and Y. Chen · 2020
Later among the works it cites.
Rank optimality for the Burer–Monteiro factorization
I. Waldspurger and A. Waters · 2020
Later among the works it cites.
On recovery guarantees for angular synchronization
F. Filbir, F. Krahmer, and O. Melnyk · 2021
Closest in time.
The generalized orthogonal Procrustes problem in the high noise regime
T. Pumir, A. Singer, and N. Boumal · 2021
Closest in time.
Optimal non-convex exact recovery in stochastic block model via projected power method
P. Wang, H. Liu, Z. Zhou, and A. M.-C. So · 2021
Closest in time.
SDP achieves exact minimax optimality in phase synchronization
C. Gao and A. Y. Zhang · 2022
Closest in time.
Improved performance guarantees for orthogonal group synchronization via generalized power method
S. Ling · 2022
Closest in time.
Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods
S. Ling · 2022
Closest in time.
Orthogonal trace-sum maximization: Tightness of the semidefinite relaxation and guarantee of locally optimal solutions
J.-H. Won, T. Zhang, and H. Zhou · 2022
Closest in time.
A. Y. Zhang · 2022
Closest in time.
Optimal orthogonal group synchronization and rotation group synchronization
C. Gao and A. Y. Zhang · 2023
Closest in time.
Local geometry determines global landscape in low-rank factorization for synchronization
S. Ling · 2023
Closest in time.
Near-optimal bounds for generalized orthogonal procrustes problem via generalized power method
S. Ling · 2023
Closest in time.
Solving orthogonal group synchronization via convex and low-rank optimization: Tightness and landscape analysis
S. Ling · 2023
Closest in time.
A unified approach to synchronization problems over subgroups of the orthogonal group
H. Liu, M.-C. Yue, and A. M.-C. So · 2023
Closest in time.