Nonnegative Polynomials and Circuit Polynomials

DOI10.1137/20M1313969zbMath1498.14145arXiv1804.09455MaRDI QIDQ5073707

Jie Wang

Publication date: 3 May 2022

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

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

zbMATH Keywords

sum of squaresnonnegative polynomialsum of nonnegative circuit polynomialscertificate of nonnegativitySONC

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Semialgebraic sets and related spaces (14P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Polynomial optimization (90C23)

Related Items

The Algebraic Boundary of the Sonc-Cone ⋮ Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks ⋮ Sublinear circuits and the constrained signomial nonnegativity problem

Uses Software

• SPOTless
• TSSOS

Cites Work

• Unnamed Item
• Amoebas, nonnegative polynomials and sums of squares supported on circuits
• Global injectivity and multiple equilibria in uni- and bi-molecular reaction networks
• Signomial and polynomial optimization via relative entropy and partial dualization
• Forms derived from the arithmetic-geometric inequality
• Extremal psd forms with few terms
• Symmetry groups, semidefinite programs, and sums of squares
• An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
• A note on mediated simplices
• Newton polytopes and relative entropy optimization
• Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
• A New Sparse SOS Decomposition Algorithm Based on Term Sparsity
• Systems of polynomials with at least one positive real zero
• A second order cone characterization for sums of nonnegative circuits
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
• Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
• DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• Convex Analysis
• A unified framework of SAGE and SONC polynomials and its duality theory