mlsanityData to 7 Oct 2026

The Euclidean distance degree of an algebraic variety

arXiv 1309.0049 ↗First posted 31 Aug 2013math.AG math.OCcited by 15

Not on the map. Why?

Abstract (arXiv)

The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value decomposition. This article develops a theory of such nearest point maps from the perspective of computational algebraic geometry. The Euclidean distance degree of a variety is the number of critical points of the squared distance to a generic point outside the variety. Focusing on varieties seen in applications, we present numerous tools for exact computations.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Aug 2013.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 2; 2023: 2; 2024: 3; 2025: 5; 2026: 1.

15 papers.

Sort: