The euclidean distance degree

DOI10.1145/2631948.2631951zbMath1346.68281OpenAlexW2150821392MaRDI QIDQ2819704

Rekha R. Thomas, Jan Draisma, Bernd Sturmfels, Emil Horobeţ, Giorgio Ottaviani

Publication date: 29 September 2016

Published in: Proceedings of the 2014 Symposium on Symbolic-Numeric Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2631948.2631951

zbMATH Keywords

Chern classdual varietypolynomial optimizationEuclidean distancesymbolic-numeric computationnearest point mapcomputing critical points

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Real algebraic sets (14P05) Computational aspects of higher-dimensional varieties (14Q15)

Related Items (3)

The Maximum Likelihood Degree of Sparse Polynomial Systems ⋮ Unification and extension of intersection algorithms in numerical algebraic geometry ⋮ The algebro-geometric study of range maps

Uses Software

• Macaulay2

This page was built for publication: The euclidean distance degree