Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions

DOI10.1137/21M1422707OpenAlexW3205864334MaRDI QIDQ5867627

Teng Zhang, Joong-Ho Won, Hua Zhou

Publication date: 14 September 2022

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.05701

zbMATH Keywords

semidefinite programmingestimation errortightness of convex relaxationlocally optimal solutions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method

Cites Work

• Unnamed Item
• Approximating the little Grothendieck problem over the orthogonal and unitary groups
• A mathematical introduction to compressive sensing
• Disentangling orthogonal matrices
• Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
• Angular synchronization by eigenvectors and semidefinite programming
• Analysis of \(k\) sets of data, with differential emphasis on agreement between and within sets
• Generalized Procrustes analysis
• Orthogonal Procrustes rotation for two or more matrices
• The geometry of synchronization problems and learning group actions
• Group synchronization on grids
• Distributed methods for synchronization of orthogonal matrices over graphs
• MM Optimization Algorithms
• Nonconvex Phase Synchronization
• Eigenvector synchronization, graph rigidity and the molecule problem
• Orientation Determination of Cryo-EM Images Using Least Unsquared Deviations
• Three-Dimensional Structure Determination from Common Lines in Cryo-EM by Eigenvectors and Semidefinite Programming
• Synchronization over Cartan Motion Groups via Contraction
• On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization
• Non-Iterative Rigid 2D/3D Point-Set Registration Using Semidefinite Programming
• Near-Optimal Bounds for Phase Synchronization
• Synchronization overZ₂and community detection in signed multiplex networks with constraints
• Message‐Passing Algorithms for Synchronization Problems over Compact Groups
• Orthogonal Trace-Sum Maximization: Applications, Local Algorithms, and Global Optimality
• Exact and stable recovery of rotations for robust synchronization
• Cramer-Rao bounds for synchronization of rotations
• On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization
• Global Registration of Multiple Point Clouds Using Semidefinite Programming

This page was built for publication: Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions