# Exact Solutions in Structured Low-Rank Approximation

arXiv: https://arxiv.org/abs/1311.2376 · HTML: https://mlsanity.com/paper/1311.2376/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 Nov 2013.

## Built on by (most cited first, 1 of 1)

- [Hankel low-rank approximation and completion in time series analysis and forecasting: a brief review](https://mlsanity.com/paper/2206.05103/) (2022)

## Abstract (arXiv)

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.