We consider a family of generalized Procrustes problems. In this class of problems, one aims at aligning a set of vectors to a given second set of vectors. The distance between both sets is measured in the q norm, and for the alignment, isometries with respect to the p norm are allowed. In contrast to the classical Procrustes problem with p = q = 2, we allow p and q to differ. We will see that it makes a difference whether the problem is real or cast over the complex field. Therefore, we discuss the solutions for p = 2 separately for these cases. We show that all the real cases can be solved efficiently. Most of the complex cases can up to now only be solved approximately in polynomial time, but we show the existence of polynomial time algorithms for q ∈ {2, 4, ∞}. Computational experiments illustrate the suggested algorithms.:1. Introduction
2. The (lp, lq)-Procrustes problem
3. Optimization methods for the remaining cases with p not equal to 2
4. The one-dimensional complex optimization problems with p, q unequal to 2
5. Conclusions
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:20068 |
| Date | 30 June 2014 |
| Creators | Fankhänel, Jens, Benner, Peter |
| Publisher | Technische Universität Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:preprint, info:eu-repo/semantics/preprint, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | urn:nbn:de:bsz:ch1-qucosa-143848, qucosa:20060 |
Page generated in 0.0019 seconds