Successive projection method for solving the unbalanced Procrustes problem
The Procrustes problem (PP) considered here is to minimize the Frobenius norm \(f(Q)=\| AQ-B\| _F\) over all matrices \(Q\) satisfying \(Q^TQ=I\) when \(A\) and \(B\) are given matrices. When \(Q\) is square, the PP is called balanced, when \(Q\) is \(n\times k\) with \(k<n\), the PP is unbalanced. An unbalanced PP with optimal or approximate solution \(Q\), can be expanded to a balanced one by taking the orthogonal complement \(H\) of \(Q\) and minimizing the norm of \(A G - [B,AH]\) with \(G\) orthogonal. Besides a survey of alternatives methods, a successive projection method is proposed which updates the columns of \(Q\) by solving PPs with \(k=1\) for each column separately. Such a PP with \(k=1\) is equivalent to a linear least squares problem with a quadratic equality constraint. After each cycle of the \(k\) columns, a global correction is obtained e.g., by solving an expanded balanced PP. It is shown that the method converges to a matrix \(Q\) which satisfies the necessary (but not the sufficient) conditions for an optimal solution of the PP.
- A generalized solution of the orthogonal Procrustes problem
- A parallel algorithm for the unbalanced orthogonal Procrustes problem
- A Projection Method for Least Squares Problems with a Quadratic Equality Constraint
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- The Procrustes Problem for Orthogonal Stiefel Matrices
- A parallel algorithm for the unbalanced orthogonal Procrustes problem
- Reconstruction of helices from their orthogonal projection
- Algorithms for the orthographic-\(n\)-point problem
- Projected nonmonotone search methods for optimization with orthogonality constraints
- Maximizing sum of coupled traces with applications
- Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem
- A GSS method for oblique _1 Procrustes problems
- Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem
- On a sub-Stiefel Procrustes problem arising in computer vision.
- Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds
- THE ORTHOGONAL PROJECTION MATRIX FOR THE UNBALANCED FACTORIAL DESIGN
- An MM method for solving orthogonal unbalanced Procrustes problem
- An eigenvalue-based method for the unbalanced Procrustes problem
- A Block Lanczos Method for Large-Scale Quadratic Minimization Problems with Orthogonality Constraints
- Trace ratio optimization with an application to multi-view learning
- Locally unitarily invariantizable NEPv and convergence analysis of SCF
- A theory of the NEPv approach for optimization on the Stiefel manifold
- The multi-class Stackelberg prediction game with least squares loss
- NEPv Approach for Optimization on Stiefel Manifold with the (2,1)-norm Regularization
- Solving balanced Procrustes problem with some constraints by eigenvalue decomposition
This page was built for publication: Successive projection method for solving the unbalanced Procrustes problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q867767)
