Disentangling orthogonal matrices

DOI10.1016/J.LAA.2017.03.002zbMATH Open1360.15018arXiv1506.02217OpenAlexW2427313515WikidataQ47384773 ScholiaQ47384773MaRDI QIDQ526289FDOQ526289

A. Singer, Teng Zhang

Publication date: 10 May 2017

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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.

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

zbMATH Keywords

SDP relaxationcryo-EMorthogonal procrustes problem

Mathematics Subject Classification ID

Semidefinite programming (90C22) Matrix equations and identities (15A24)

Cites Work

• Solving semidefinite-quadratic-linear programs using SDPT3
• Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
• Generalized Procrustes analysis
• Procrustes Problems
• Orthogonal Procrustes rotation for two or more matrices
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Approximating the little Grothendieck problem over the orthogonal and unitary groups
• Closest Unitary, Orthogonal and Hermitian Operators to a Given Operator
• Efficient rounding for the noncommutative grothendieck inequality
• Moment inequalities for sums of random matrices and their applications in optimization
• On approximating complex quadratic optimization problems via semidefinite programming relaxations
• Dual Algorithm for Orthogonal Procrustes Rotations

Cited In (4)

• 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
• Orthogonal Trace-Sum Maximization: Applications, Local Algorithms, and Global Optimality
• Tightness of the maximum likelihood semidefinite relaxation for angular synchronization

Uses Software

• SDPT3
• CVX

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)