A Continuous-time Approach to the Oblique Procrustes Problem
نویسنده
چکیده
In the paper proposed we will make use of the gradient flow approach to consider a generalization of the well-known oblique Procrustes rotation problem, involving oblique simple structure rotation of both the core and component matrices resulting from three-mode factor analysis. The standard oblique Procrustes rotations to specified factor-structure and factor-pattern follw as special cases. The approach adopted leads to globally convergent algorithm and includes solving of initial value problem for certain matrix ordinary differential equation. Necessary conditions are established for the solution of the problem. The same approach is extended easily to the weighted oblique Procrustes rotation. Finally, some simulated numerical results are given and commented.
منابع مشابه
A GSS method for oblique 1 Procrustes problems
We propose a Generating Search Set method for solving the oblique 1 Procrustes problem. Implementative details, algorithmic choices and theoretical properties of the method are discussed. The results of some numerical experiments are reported.
متن کاملA novel technique for a class of singular boundary value problems
In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...
متن کاملA New Numerical Method for Solving the Oblique
We propose a Generating Search Set method for solving the oblique 1 Procrustes problem. Implementative details, algorithmic choices and theoretical properties of the method are discussed. The results of some numerical experiments are reported.
متن کاملContinuous Relaxations for the Traveling Salesman Problem
In this work, we construct heuristic approaches for the traveling salesman problem (TSP) based on embedding the discrete optimization problem into continuous spaces. We explore multiple embedding techniques – namely, the construction of dynamical flows on the manifold of orthogonal matrices and associated Procrustes approximations of the TSP cost function. In particular, we find that the Procru...
متن کاملThe Continuous Procrustes Distance between Two Surfaces
The Procrustes distance is used to quantify the similarity or dissimilarity of (3-dimensional) shapes, and extensively used in biological morphometrics. Typically each (normalized) shape is represented by N landmark points, chosen to be homologous (i.e. corresponding to each other), as much as possible, and the Procrustes distance is then computed as infR ∑N j=1 ‖Rxj − xj‖, where the minimizati...
متن کامل