Euclidean Distance Degree and Mixed Volume

  title={Euclidean Distance Degree and Mixed Volume},
  author={Paul Breiding and Frank Sottile and James D. Woodcock},
  journal={Foundations of Computational Mathematics},
We initiate a study of the Euclidean distance degree in the context of sparse polynomials. Specifically, we consider a hypersurface $$f=0$$ f = 0 defined by a polynomial f that is general given its support, such that the support contains the origin. We show that the Euclidean distance degree of $$f=0$$ f = 0 equals the mixed volume of the Newton polytopes of the associated Lagrange multiplier equations. We discuss the implication of our result for computational complexity and… 
Algebraic degree of optimization over a variety with an application to $p$-norm distance degree
An optimization problem with the feasible set being a real algebraic variety X and whose parametric objective function fu is gradient-solvable with respect to the parametric data u is studied, leading to the notion of algebraic degree of optimization on X.
The maximum likelihood degree of sparse polynomial systems
. We consider statistical models arising from the common set of solutions to a sparse polynomial system with general coefficients. The maximum likelihood degree counts the number of critical points of


The Euclidean Distance Degree of an Algebraic Variety
A theory of such nearest point maps of a real algebraic variety with respect to Euclidean distance from the perspective of computational algebraic geometry is developed.
Euclidean Distance Degree of the Multiview Variety
Non-proper Morse theory is used to give a topological interpretation of the Euclidean distance degree of an affine variety in terms of Euler characteristics.
The Euclidean distance degree of smooth complex projective varieties
We obtain several formulas for the Euclidean distance degree (ED degree) of an arbitrary nonsingular variety in projective space: in terms of Chern and Segre classes, Milnor classes,
Complexity of Sparse Polynomial Solving: Homotopy on Toric Varieties and the Condition Metric
This paper investigates the cost of solving systems of sparse polynomial equations by homotopy continuation using Smale’s alpha theory to provide criteria of quadratic convergence and proves the Newton operator and related condition numbers turn out to be invariant through a group action related to the momentum map.
A polyhedral method for solving sparse polynomial systems
Mixed subdivisions of Newton polytopes are introduced, and they are applied to give a new proof and algorithm for Bernstein's theorem on the expected number of roots, which results in a numerical homotopy with the optimal number of paths to be followed.
Computing Mixed Volume and All Mixed Cells in Quermassintegral Time
  • G. Malajovich
  • Computer Science, Mathematics
    Found. Comput. Math.
  • 2017
A geometric algorithm is introduced in this paper: its complexity is bounded in the average and probability-one settings in terms of some geometric invariants: quermassintegrals associated with the tuple of convex hulls of the support of each polynomial.
Convex Polytopes, Algebraic Geometry, and Combinatorics
In the last several decades, convex geometry methods have proven very useful in algebraic geometry specifically to understand discrete invariants of algebraic varieties. An approach to study
Numerically Computing Real Points on Algebraic Sets
This article transforms an approach of Rouillier, Roy, and Safey El Din, which is based on a classical optimization approach of Seidenberg, to develop a homotopy based approach for computing at least one point on each connected component of a real algebraic set.
On the combinatorial and algebraic complexity of quantifier elimination
An improved bound on the radius of a ball centered at the origin, which is guaranteed to intersect every connected component of the sign partition induced by a family of polynomials is given.