
arXiv: 1603.06544
We determine the Euclidean distance degree of a projective toric variety. This extends the formula of Matsui and Takeuchi for the degree of the $A$-discriminant in terms of Euler obstructions. Our primary goal is the development of reliable algorithmic tools for computing the points on a real toric variety that are closest to a given data point.
Computer Science - Symbolic Computation, FOS: Computer and information sciences, Mathematics - Algebraic Geometry, Optimization and Control (math.OC), FOS: Mathematics, Symbolic Computation (cs.SC), Mathematics - Optimization and Control, Algebraic Geometry (math.AG)
Computer Science - Symbolic Computation, FOS: Computer and information sciences, Mathematics - Algebraic Geometry, Optimization and Control (math.OC), FOS: Mathematics, Symbolic Computation (cs.SC), Mathematics - Optimization and Control, Algebraic Geometry (math.AG)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 10 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
