Exact Solutions in Structured Low-Rank Approximation

Abstract

Structured low-rank approximation is the problem of minimizing a weighted Frobenius distance to a given matrix among all matrices of fixed rank in a linear space of matrices. We study exact solutions to this problem by way of computational algebraic geometry. A particular focus lies on Hankel matrices, Sylvester matrices and generic linear spaces.

arXiv comment22 pages; theorem numbering fits with the journal version