On the minimum of a positive polynomial over the standard simplex

DOI10.1016/j.jsc.2010.01.001zbMath1239.90086arXiv0906.4377MaRDI QIDQ2269694

Daniel Perrucci, Gabriela Jeronimo

Publication date: 17 March 2010

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

positivity of polynomials; optimization on polyhedra

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

14P10: Semialgebraic sets and related spaces

26C99: Polynomials, rational functions in real analysis

13J30: Real algebra

Related Items

Convergence of the Simplicial Rational Bernstein Form, A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set, Fixed points, Nash equilibria, and the existential theory of the reals, Bounds on the number of steps of WDS required for checking the positivity of integral forms, Bounding the radii of balls meeting every connected component of semi-algebraic sets, On exact Reznick, Hilbert-Artin and Putinar's representations, Separation bounds for polynomial systems, Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)

Uses Software

• ISOLATE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of Schmüdgen's Positivstellensatz
• On sign conditions over real multivariate polynomials
• Effective Łojasiewicz inequalities in semialgebraic geometry
• Solving zero-dimensional systems through the rational univariate representation
• An effective version of Pólya's theorem on positive definite forms
• The DMM bound
• Algorithms in real algebraic geometry
• A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.