Answers are grounded in this paper and cite their sources.
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 the critical points of this optimization problem using algebraic geometry. A particular focus lies on Hankel matrices, Sylvester matrices, and generic linear spaces.
No takes yet. Share an insight, caveat, or question.
Ottaviani et al. (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: