Lower Bounds for Polynomials Using Geometric Programming
From MaRDI portal
Publication:2910880
DOI10.1137/110836869zbMath1272.12004arXiv1106.1666OpenAlexW3101866124MaRDI QIDQ2910880
Mehdi Ghasemi, Murray A. Marshall
Publication date: 12 September 2012
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.1666
Nonconvex programming, global optimization (90C26) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Real algebraic and real-analytic geometry (14P99)
Related Items (14)
Amoebas, nonnegative polynomials and sums of squares supported on circuits ⋮ A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure ⋮ Duality of sum of nonnegative circuit polynomials and optimal SONC bounds ⋮ A Positivstellensatz for Sums of Nonnegative Circuit Polynomials ⋮ Minkowski's inequality and sums of squares ⋮ Lower bounds on the global minimum of a polynomial ⋮ TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity ⋮ An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs ⋮ Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization ⋮ Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming ⋮ Relative Entropy Relaxations for Signomial Optimization ⋮ Perturbed sums-of-squares theorem for polynomial optimization and its applications ⋮ Newton polytopes and relative entropy optimization
Uses Software
This page was built for publication: Lower Bounds for Polynomials Using Geometric Programming
