93 citations · 154 across the 14 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.NA2013★ 1 cited
A Quadratically Convergent Algorithm for Structured Low-Rank Approximation
Éric Schost, Pierre-Jean Spaenlehauer
Structured Low-Rank Approximation is a problem arising in a wide range of applications in Numerical Analysis and Engineering Sciences. Given an input matrix , the goal is to com…
math.OC2013
Exact Solutions in Structured Low-Rank Approximation
Giorgio Ottaviani, Pierre-Jean Spaenlehauer, Bernd Sturmfels
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 st…
cs.SC2013
On the Complexity of Computing Critical Points with Gröbner Bases
Pierre-Jean Spaenlehauer
Computing the critical points of a polynomial function restricted to the vanishing locus of polynomials $f_1,\ldots, f_p\in\ma…