29 October 2011 in Computational Optimization and Applications
1 January 2020 in SIAM Journal on Matrix Analysis and Applications
In this paper, we propose a novel eigenvalue-based approach to solving the unbalanced orthogonal Procrustes problem. By making effective use of the necessary condition for the global minimizer and the orthogonal constraint, we shall first show that the unbalanced Procrustes problem can be equivalently transformed into an eigenvalue minimization whose solution can be computed by solving a related eigenvector-dependent nonlinear eigenvalue problem. Through the exploitation of certain techniques in the nonlinear eigenvalue computations, we adapt the standard self-consistent field (SCF) iteration to solve the resulting nonlinear eigenvalue problem. Theoretical convergence analysis of this customized SCF iteration is performed, and practical strategies for a more efficient numerical implementation are discussed. Our numerical experience on preliminary tests indicates that the proposed eigenvalue-based SCF iteration is a promising method for the unbalanced orthogonal Procrustes problem.
23 May 2022 in SIAM Journal on Matrix Analysis and Applications
As a variant of the classical trust-region method for unconstrained optimization, the cubic regularization of the Newton method introduces a cubic regularization term in the surrogate objective to ...
23 August 2011 in Optimization Letters
6 February 2020 in Computational and Applied Mathematics
7 January 2016 in Journal of Global Optimization