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.
Liste complète des métadonnées

Contributor : Pierre-Jean Spaenlehauer <>
Submitted on : Friday, February 28, 2014 - 2:54:44 PM
Last modification on : Tuesday, December 18, 2018 - 4:18:25 PM

Links full text


  • HAL Id : hal-00953702, version 1
  • ARXIV : 1311.2376


Giorgio Ottaviani, Pierre-Jean Spaenlehauer, Bernd Sturmfels. Exact Solutions in Structured Low-Rank Approximation. SIAM Journal on Matrix Analysis and Applications, Society for Industrial and Applied Mathematics, 2014, 35, 4, pp.1521-1542. ⟨hal-00953702⟩



Record views