The Open UniversitySkip to content

The ℓ 1 oblique procrustes problem

Trendafilov, Nickolay T. and Watson, G. A. (2004). The ℓ 1 oblique procrustes problem. Statistics and Computing, 14(1) pp. 39–51.

Full text available as:
Full text not publicly available (Version of Record)
Due to publisher licensing restrictions, this file is not available for public download
DOI (Digital Object Identifier) Link:
Google Scholar: Look up in Google Scholar


In this paper, we reconsider the well-known oblique Procrustes problem where the usual least-squares objective function is replaced by a more robust discrepancy measure, based on the ℓ1 norm or smooth approximations of it. We propose two approaches to the solution of this problem. One approach is based on convex analysis and uses the structure of the problem to permit a solution to the ℓ1 norm problem. An alternative approach is to smooth the problem by working with smooth approximations to the ℓ 1 norm, and this leads to a solution process based on the solution of ordinary differential equations on manifolds. The general weighted Procrustes problem (both orthogonal and oblique) can also be solved by the latter approach. Numerical examples to illustrate the algorithms which have been developed are reported and analyzed.

Item Type: Journal Item
Copyright Holders: 2004 Kluwer Academic Publishers
ISSN: 1573-1375
Keywords: fitting configurations; constrained optimization; dynamical system on manifolds; descent flows; optimality conditions; reference-structure and factor-pattern
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID: 25481
Depositing User: Nickolay Trendafilov
Date Deposited: 31 Mar 2011 14:51
Last Modified: 08 Dec 2018 05:35
Share this page:


Altmetrics from Altmetric

Citations from Dimensions

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU