A Positivstellensatz for Sums of Nonnegative Circuit Polynomials

DOI10.1137/16M1086303zbMath1372.14051arXiv1607.06010MaRDI QIDQ5369248

Mareike Dressler, Timo de Wolff, Sadik Iliman

Publication date: 16 October 2017

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

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

zbMATH Keywords

semidefinite programmingPositivstellensatzsum of squarescertificatenonnegative polynomialsum of nonnegative circuit polynomialsrelative entropy programmingconverging hierarchy

Mathematics Subject Classification ID

Convex programming (90C25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Polynomials in real and complex fields: factorization (12D05) Semialgebraic sets and related spaces (14P10)

Related Items

A Convex Programming Approach to Solve Posynomial Systems ⋮ Lifting for Simplicity: Concise Descriptions of Convex Sets ⋮ The kinetic space of multistationarity in dual phosphorylation ⋮ Functional norms, condition numbers and numerical algorithms in algebraic geometry ⋮ Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials ⋮ Duality of sum of nonnegative circuit polynomials and optimal SONC bounds ⋮ A hierarchy of spectral relaxations for polynomial optimization ⋮ On eigenvalues of symmetric matrices with PSD principal submatrices ⋮ Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks ⋮ Sublinear circuits and the constrained signomial nonnegativity problem ⋮ Positive Plücker tree certificates for non-realizability ⋮ Unnamed Item ⋮ Real zeros of SONC polynomials ⋮ A note on mediated simplices ⋮ Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization ⋮ The dual cone of sums of non-negative circuit polynomials ⋮ Newton polytopes and relative entropy optimization ⋮ Symbolic Proof of Bistability in Reaction Networks

Cites Work

• Amoebas, nonnegative polynomials and sums of squares supported on circuits
• On the computational complexity of membership problems for the completely positive cone and its dual
• Relative entropy optimization and its applications
• A tutorial on geometric programming
• Extremal psd forms with few terms
• An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
• Anneaux preordonnes
• Global Optimization with Polynomials and the Problem of Moments
• Relative Entropy Relaxations for Signomial Optimization
• Lower Bounds for Polynomials Using Geometric Programming
• Semidefinite Optimization and Convex Algebraic Geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item