The orthogonal Procrustes problem is a matrix approximation problem in linear algebra. In its classical form, one is given two matrices A {\displaystyle A} and B {\displaystyle B} and asked to find an orthogonal matrix Ω {\displaystyle \Omega } which most closely maps A {\displaystyle A} to B {\displaystyle B} . Specifically, the orthogonal Procrustes problem is an optimization problem given by
minimize Ω ‖ Ω A − B ‖ F subject to Ω T Ω = I , {\displaystyle {\begin{aligned}{\underset {\Omega }{\text{minimize}}}\quad &\|\Omega A-B\|_{F}\\{\text{subject to}}\quad &\Omega ^{T}\Omega =I,\end{aligned}}}
where ‖ ⋅ ‖ F {\displaystyle \|\cdot \|_{F}} denotes the Frobenius norm. This is a special case of Wahba's problem (with identical weights; instead of considering two matrices, in Wahba's problem the columns of the matrices are considered as individual vectors). Another difference is that Wahba's problem tries to find a proper rotation matrix instead of just an orthogonal one. The name Procrustes refers to a bandit from Greek mythology who made his victims fit his bed by either stretching their limbs or cutting them off.
Solution This problem was originally solved by Peter Schönemann in a 1964 thesis, and shortly after appeared in the journal Psychometrika. This problem is equivalent to finding the nearest orthogonal matrix to a given matrix M = B A T {\displaystyle M=BA^{T}} , i.e. solving the closest orthogonal approximation problem
min R ‖ R − M ‖ F s u b j e c t t o R T R = I {\displaystyle \min _{R}\|R-M\|_{F}\quad \mathrm {subject\ to} \quad R^{T}R=I} . To find matrix R {\displaystyle R} , one uses the singular value decomposition (for which the entries of Σ {\displaystyle \Sigma } are non-negative)
M = U Σ V T {\displaystyle M=U\Sigma V^{T}\,\!}
to write
R = U V T . {\displaystyle R=UV^{T}.\,\!}
Proof of Solution One proof depends on the basic properties of the Frobenius inner product that induces the Frobenius norm:
… excerpt ends here. Continue reading the full article.
