arXiv · 1905.06758
Defect of Euclidean distance degree
Abstract
Two well studied invariants of a complex projective variety are the unit Euclidean distance degree and the generic Euclidean distance degree. These numbers give a measure of the algebraic complexity for "nearest" point problems of the algebraic variety. It is well known that the latter is an upper bound for the former. While this bound may be tight, many varieties appearing in optimization, engineering, statistics, and data science, have a significant gap between these two numbers. We call this difference the defect of the ED degree of an algebraic variety. In this paper we compute this defect by classical techniques in Singularity Theory, thereby deriving a new method for computing ED degrees of smooth complex projective varieties.
Explore related subjects
Keep this discovery
Laurentiu G. Maxim, Jose Israel Rodriguez, Botong Wang. 2019-05-16. Defect of Euclidean distance degree. https://arxiv.org/abs/1905.06758
Cite the original work for its findings. Save a collection to share your selection of sources.