A Constrained Procrustes Problem

  • Authors:
  • Lars-Erik Andersson;Tommy Elfving

  • Affiliations:
  • -;-

  • Venue:
  • SIAM Journal on Matrix Analysis and Applications
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

The following constrained matrix problem is studied. Find the matrix $X$ that minimizes the Frobenius norm of $AX-B$, with $A$ and $B$ as given matrices and where $X$ belongs to a closed convex cone. In particular we consider the cone of symmetric positive semidefinite (SPSD) matrices and the cone of (symmetric) elementwise nonnegative matrices. The optimal matrix is characterized, and the results are specialized to the two cases above. Further, we report from a numerical study of some projection-type algorithms.