Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
From MaRDI portal
Publication:2805707
Abstract: In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnegative as well as to have a sum of binomial squares representation. These criteria rely on the coefficients and the support of a polynomial and generalize all previous ones by Lasserre, Ghasemi, Marshall, Fidalgo and Kovacec to polynomials with arbitrary simplex Newton polytopes. This generalization yields a geometric programming approach for computing lower bounds for polynomials that significantly extends the geometric programming method proposed by Ghasemi and Marshall. Furthermore, it shows that geometric programming is strongly related to nonnegativity certificates based on sums of nonnegative circuit polynomials, which were recently introduced by the authors.
Recommendations
- Lower bounds for polynomials using geometric programming
- scientific article; zbMATH DE number 697092
- scientific article; zbMATH DE number 3984992
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- scientific article; zbMATH DE number 3952498
- scientific article; zbMATH DE number 4133835
- Geometric optimization and the polynomial hierarchy
- scientific article; zbMATH DE number 3965441
- Lower bound theorems for general polytopes
- Exponential lower bounds for polytopes in combinatorial optimization
Cites work
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A tutorial on geometric programming
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- Forms derived from the arithmetic-geometric inequality
- GloptiPoly 3: moments, optimization and semidefinite programming
- Lower bounds for polynomials using geometric programming
- Moments, positive polynomials and their applications
- On the computational complexity of membership problems for the completely positive cone and its dual
- Positive semidefinite diagonal minus tail forms are sums of squares
- Semidefinite Optimization and Convex Algebraic Geometry
- Sufficient conditions for a real polynomial to be a sum of squares
- Sums of squares, moment matrices and optimization over polynomials
Cited in
(19)- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- On minimal extended representations of generalized power cones
- The dual cone of sums of non-negative circuit polynomials
- scientific article; zbMATH DE number 4133835 (Why is no real title available?)
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Initial steps in the classification of maximal mediated sets
- Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
- Lower bounds on the global minimum of a polynomial
- Lower bounds for polynomials using geometric programming
- Symmetric SAGE and SONC forms, exactness and quantitative gaps
- Nonnegative Polynomials and Circuit Polynomials
- Approximating nonnegative polynomials via spectral sparsification
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- SONC optimization and exact nonnegativity certificates via second-order cone programming
- Newton polytopes and relative entropy optimization
- Symmetry reduction in AM/GM-based optimization
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- Real zeros of SONC polynomials
This page was built for publication: Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805707)
