Generalized orthogonal Procrustes problem under arbitrary adversaries

DOI10.1137/24M1631122MaRDI QIDQ7015962zbMATH OpenFDO

Authors Shuyang Ling

Publication date 7 March 2025

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1631122

zbMATH Keywords

Banach fixed-point theoremgeneralized orthogonal Procrustes problemgeneralized power methodsemidefinite relaxation

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical mathematical programming methods (65K05) Semidefinite programming (90C22)

Cites work

• A feasible method for optimization with orthogonality constraints
• A generalized solution of the orthogonal Procrustes problem
• A geometric analysis of phase retrieval
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• A survey of structure from motion
• A unified approach to synchronization problems over subgroups of the orthogonal group
• Approximating the little Grothendieck problem over the orthogonal and unitary groups
• Blind Deconvolution Using Convex Programming
• Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
• Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs
• Efficient rounding for the noncommutative Grothendieck inequality
• Exact and stable recovery of rotations for robust synchronization
• Exact matrix completion via convex optimization
• Exact recovery with symmetries for procrustes matching
• Generalized Procrustes analysis
• Global registration of multiple point clouds using semidefinite programming
• High-dimensional probability. An introduction with applications in data science
• High-dimensional statistics. A non-asymptotic viewpoint
• scientific article; zbMATH DE number 1973375 (Why is no real title available?)
• Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Improved performance guarantees for orthogonal group synchronization via generalized power method
• Local minima and convergence in low-rank semidefinite programming
• Mathematics for cryo-electron microscopy
• Matrix Completion From a Few Entries
• Moment inequalities for sums of random matrices and their applications in optimization
• Multireference alignment using semidefinite programming
• Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method
• Near-optimal bounds for phase synchronization
• Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods
• New Perturbation Bounds for the Unitary Polar Factor
• Non-Iterative Rigid 2D/3D Point-Set Registration Using Semidefinite Programming
• Nonconvex phase synchronization
• On recovery guarantees for angular synchronization
• On the estimation performance and convergence rate of the generalized power method for phase synchronization
• Optimal orthogonal group synchronization and rotation group synchronization
• Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions
• Perturbation bounds in connection with singular value decomposition
• Phase retrieval via matrix completion
• Phase retrieval via Wirtinger flow: theory and algorithms
• Procrustes Problems
• Rank optimality for the Burer-Monteiro factorization
• SDP Achieves Exact Minimax Optimality in Phase Synchronization
• Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis
• Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
• The generalized orthogonal Procrustes problem in the high noise regime
• The Geometry of Algorithms with Orthogonality Constraints
• The projected power method: an efficient algorithm for joint alignment from pairwise differences
• The Rotation of Eigenvectors by a Perturbation. III
• 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
• User-friendly tail bounds for sums of random matrices

This page was built for publication: Generalized orthogonal Procrustes problem under arbitrary adversaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7015962)