Algorithms for the Weighted Orthogonal Procrustes Problem and other Least Squares Problems
Sammanfattning: In this thesis, we present algorithms for local and global minimization of some Procrustes type problems. Typically, these problems are about rotating and scaling a known set of data to fit another set with applications related to determination of rigid body movements, factor analysis and multidimensional scaling. The known sets of data are usually represented as matrices, and the rotation to be determined is commonly a matrix Q with orthonormal columns.The algorithms presented use Newton and Gauss-Newton search directions with optimal step lengths, which in most cases result in a fast computation of a solution.Some of these problems are known to have several minima, e.g., the weighted orthogonal Procrustes problem (WOPP). A study on the maximal amount of minima has been done for this problem. Theoretical results and empirical observations gives strong indications that there are not more than 2n minimizers, where n is the number of columns in Q. A global optimization method to compute all 2n minima is presented.Also considered in this thesis is a cubically convergent iteration method for solving nonlinear equations. The iteration method presented uses second order information (derivatives) when computing a search direction. Normally this is a computational heavy task, but if the second order derivatives are constant, which is the case for quadratic equations, a performance gain can be obtained. This is confirmed by a small numerical study.Finally, regularization of ill-posed nonlinear least squares problems is considered. The quite well known L-curve for linear least squares problems is put in context for nonlinear problems.
KLICKA HÄR FÖR ATT SE AVHANDLINGEN I FULLTEXT. (PDF-format)