Euclidean distance degree and mixed volume

DOI10.1007/s10208-021-09534-8zbMath1505.14124arXiv2012.06350OpenAlexW3197239878WikidataQ114228262 ScholiaQ114228262MaRDI QIDQ2098233

Yanyan Li

Publication date: 17 November 2022

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.06350

zbMATH Keywords

Lagrange multipliersmixed volumepolyhedral homotopyBernstein's theoremEuclidean distance degree

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Computational aspects in algebraic geometry (14Qxx) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Related Items (2)

The Maximum Likelihood Degree of Sparse Polynomial Systems ⋮ On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials

Uses Software

• HOM4PS
• Macaulay2
• PHCpack
• INTLAB
• alphaCertified
• HomotopyContinuation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
• Mixed volume techniques for embeddings of Laman graphs
• The number of roots of a system of equations
• Polyedres de Newton et nombres de Milnor
• HomotopyContinuation.jl: a package for homotopy continuation in Julia
• Computing mixed volume and all mixed cells in quermassintegral time
• Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
• The Euclidean distance degree of smooth complex projective varieties
• Real solving for positive dimensional systems.
• Numerically computing real points on algebraic sets
• A new decision method for elementary algebra
• Algorithm 921
• On the combinatorial and algebraic complexity of quantifier elimination
• Algorithm 795
• A Polyhedral Method for Solving Sparse Polynomial Systems
• Generic properties of dispersion relations for discrete periodic operators
• Convex Polytopes, Algebraic Geometry, and Combinatorics
• Galois theory for general systems of polynomial equations
• Euclidean Distance Degree of the Multiview Variety
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Certifying approximate solutions to polynomial systems on Macaulay2
• Finding at least one point in each connected component of a real algebraic set defined by a single equation
• The Euclidean distance degree of an algebraic variety

This page was built for publication: Euclidean distance degree and mixed volume