A generalized solution of the orthogonal procrustes problem

@article{Schnemann1966AGS,
  title={A generalized solution of the orthogonal procrustes problem},
  author={P. H. Sch{\"o}nemann},
  journal={Psychometrika},
  year={1966},
  volume={31},
  pages={1-10}
}
A solutionT of the least-squares problemAT=B +E, givenA andB so that trace (E′E)= minimum andT′T=I is presented. It is compared with a less general solution of the same problem which was given by Green [5]. The present solution, in contrast to Green's, is applicable to matricesA andB which are of less than full column rank. Some technical suggestions for the numerical computation ofT and an illustrative example are given. 
A general solution of the weighted orthonormal procrustes problem
A general solution for weighted orthonormal Procrustes problem is offered in terms of the least squares criterion. For the two-demensional case. this solution always gives the global minimum; for the
Dual algorithms for orthogonal Procrustes rotations
This paper considers a problem of rotating m matrices toward a best least-squares fit. The problem is known as the orthogonal Procrustes problem. For $m = 2$ the solution of this problem is known and
DUAL ALGORITHMS FOR ORTHOGONAL PROCRUSTES ROTATIONS *
This paper considers a problem of rotating m matrices toward a best least-squares fit. The problem is known as the orthogonal Procrustes problem. For rn 2 the solution of this problem is known and
Successive projection method for solving the unbalanced Procrustes problem
We present a successive projection method for solving the unbalanced Procrustes problem: given matrix A ∈ Rn × n and B ∈ Rn × k, n > k, minimize the residual ‖AQ − B‖F with the orthonormal constraint
A new algorithm for the positive semi-definite Procrustes problem
  • K. Woodgate
  • Mathematics
    Proceedings of 32nd IEEE Conference on Decision and Control
  • 1993
For arbitrary real matrices F and G, the positive semi-definite Procrustes problem is minimization of the Frobenius norm of F-PG with respect to positive semi-definite symmetric P. Existing solution
A note on the complex matrix procrustes problem
TLDR
This note outlines an algorithm for solving the complex “matrix Procrustes problem”, which exploits fully the special structure of the dilated matrix, a least-squares approximation over the cone of positive semi-definite Hermitian matrices.
The symmetric procrustes problem
The following “symmetric Procrustes” problem arises in the determination of the strain matrix of an elastic structure: find the symmetric matrixX which minimises the Frobenius (or Euclidean) norm
Perturbation analysis of the orthogonal procrustes problem
Given two arbitrary real matricesA andB of the same size, the orthogonal Procrustes problem is to find an orthogonal matrixM such that the Frobenius norm ‖MA − B‖ is minimized. This paper treats the
The (M, N)-symmetric Procrustes problem
Solving the PnP Problem with Anisotropic Orthogonal Procrustes Analysis
TLDR
This paper formulate the Perspective-n-Point problem in terms of an instance of the an isotropic orthogonal Procrustes problem, and derive its solution in order to reach the best trade-off between speed and accuracy.
...
...

References

SHOWING 1-10 OF 10 REFERENCES
On the least-squares orthogonalization of an oblique transformation
After proving a special case of a theorem stated by Eckart and Young, namely, that an oblique transformationG is the product of two different orthogonal transformations and an intervening diagonal,
The approximation of one matrix by another of lower rank
The mathematical problem of approximating one matrix by another of lower rank is closely related to the fundamental postulate of factor-theory. When formulated as a least-squares problem, the normal
THE ORTHOGONAL APPROXIMATION OF AN OBLIQUE STRUCTURE IN FACTOR ANALYSIS
A procedure is derived for obtaining an orthogonal transformation which most nearly transforms one given matrix into another given matrix, according to some least-squares criterion of fit. From this
Introduction to Matrix Analysis
TLDR
This book discusses Maximization, Minimization, and Motivation, which is concerned with the optimization of Symmetric Matrices, and its applications in Programming and Mathematical Economics.
Determining a simple structure when loadings for certain tests are known
A rigorous and an approximate solution are found for the problem: Given a primary trait matrix forn tests andr1 traits, and a matrix for the samen tests andr2 reference axes, to discover the
The development of hierarchical factor solutions
Although simple structure has proved to be a valuable principle for rotation of axes in factor analysis, an oblique factor solution often tends to confound the resulting interpretation. A model is
On a theorem stated by eckart and young
Proof is given for a theorem stated but not proved by Eckart and Young in 1936, which has assumed considerable importance in the theory of lower-rank approximations to matrices, particularly in