\documentclass{article}
\usepackage{amsfonts}
\usepackage{amsmath}
\begin{document}
%"Stosic","Marko","mstosic@isr.ist.utl.pt","
\section*{On Generalized Procrustes Problem} By {\sl Marko Sto\v si\'c$^*$ and Jo\~ao Xavier}.

\bigskip  \noindent In this talk we present a new approach to the generalized Procrustes problem: For given real matrices $A\in {\mathbb R}^{n \times 3}$ and $B\in {\mathbb R}^{n \times 2}$, find the  Stiefel matrix $Q\in {\mathbb R}^{3 \times 2}$ (i.e. such that $Q^T Q=I_2$), that minimizes the Frobenius norm of $B-AQ$. We rewrite this problem as the more general Quadratic Programming program, and give fast algorithm for its (partial) solutions. The solution is based on the computation of convex hulls of various sets of matrices.
%","matrices, Procrustes problem, convex hull, optimization","15A21","15A57","","07:44:29","Thu Apr 10 2008","193.136.128.7"
\end{document}
