The ℓ1 oblique procrustes problem

  • Authors:
  • Nickolay T. Trendafilov;G. A. Watson

  • Affiliations:
  • Faculty of Computing, Engineering and Mathematical Sciences, University of the West of England, Bristol BS16 1QY, UK. Nickolay.Trendafilov@uwe.ac.uk;Department of Mathematics, University of Dundee, Dundee DD1 4HN, Scotland. gawatson@maths.dundee.ac.uk

  • Venue:
  • Statistics and Computing
  • Year:
  • 2004
  • On the l1 procrustes problem

    Future Generation Computer Systems - Selected papers on theoretical and computational aspects of structural dynamical systems in linear algebra and control

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.