Abstract: Motivated by a certain molecular reconstruction methodology in cryo-electron microscopy, we consider the problem of solving a linear system with two unknown orthogonal matrices, which is a generalization of the well-known orthogonal Procrustes problem. We propose an algorithm based on a semi-definite programming (SDP) relaxation, and give a theoretical guarantee for its performance. Both theoretically and empirically, the proposed algorithm performs better than the na"{i}ve approach of solving the linear system directly without the orthogonal constraints. We also consider the generalization to linear systems with more than two unknown orthogonal matrices.
Recommendations
- scientific article; zbMATH DE number 834481
- Three-dimensional structure determination from common lines in cryo-EM by eigenvectors and semidefinite programming
- scientific article; zbMATH DE number 147720
- Dual Algorithm for Orthogonal Procrustes Rotations
- A parallel algorithm for the unbalanced orthogonal Procrustes problem
Cites work
- Approximating the little Grothendieck problem over the orthogonal and unitary groups
- Closest Unitary, Orthogonal and Hermitian Operators to a Given Operator
- Dual Algorithm for Orthogonal Procrustes Rotations
- Efficient rounding for the noncommutative Grothendieck inequality
- Generalized Procrustes analysis
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Moment inequalities for sums of random matrices and their applications in optimization
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- Orthogonal Procrustes rotation for two or more matrices
- Procrustes Problems
- Solving semidefinite-quadratic-linear programs using SDPT3
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
Cited in
(5)- Unconstrained representation of orthogonal matrices with application to common principal components
- Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions
- The beltway problem over orthogonal groups
- Orthogonal trace-sum maximization: applications, local algorithms, and global optimality
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
This page was built for publication: Disentangling orthogonal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526289)
