Amoebas, nonnegative polynomials and sums of squares supported on circuits

DOI10.1186/s40687-016-0052-2zbMath1415.11071arXiv1402.0462OpenAlexW2963917343WikidataQ59470098 ScholiaQ59470098MaRDI QIDQ268411

Sadik Iliman, Timo de Wolff

Publication date: 15 April 2016

Published in: Research in the Mathematical Sciences (Search for Journal in Brave)

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

zbMATH Keywords

normsums of squaresconvexityinvariantcircuitsparsityAmoebacertificatenonnegative polynomials

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Sums of squares and representations by other particular quadratic forms (11E25) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Semialgebraic sets and related spaces (14P10) Real polynomials: location of zeros (26C10)

Related Items

Initial steps in the classification of maximal mediated sets ⋮ Signomial and polynomial optimization via relative entropy and partial dualization ⋮ Algebraic Perspectives on Signomial Optimization ⋮ The Algebraic Boundary of the Sonc-Cone ⋮ The kinetic space of multistationarity in dual phosphorylation ⋮ Sublinear circuits for polyhedral sets ⋮ Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials ⋮ Duality of sum of nonnegative circuit polynomials and optimal SONC bounds ⋮ Nonnegative Polynomials and Circuit Polynomials ⋮ Amoebas and their Tropicalizations – a Survey ⋮ Symmetry Reduction in AM/GM-Based Optimization ⋮ Alfonso: Matlab Package for Nonsymmetric Conic Optimization ⋮ SONC optimization and exact nonnegativity certificates via second-order cone programming ⋮ Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023 ⋮ Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks ⋮ Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks ⋮ Nonlinear algebra and applications ⋮ A survey on computational aspects of polynomial amoebas ⋮ Sublinear circuits and the constrained signomial nonnegativity problem ⋮ Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 ⋮ Unnamed Item ⋮ Real tropicalization and negative faces of the Newton polytope ⋮ A Positivstellensatz for Sums of Nonnegative Circuit Polynomials ⋮ Coercive polynomials: stability, order of growth, and Newton polytopes ⋮ Systems of polynomials with at least one positive real zero ⋮ TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity ⋮ On globally diffeomorphic polynomial maps via Newton polytopes and circuit numbers ⋮ An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming ⋮ Real zeros of SONC polynomials ⋮ A note on mediated simplices ⋮ Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization ⋮ The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability ⋮ Lopsided approximation of amoebas ⋮ The dual cone of sums of non-negative circuit polynomials ⋮ Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming ⋮ Limitations on the Expressive Power of Convex Cones without Long Chains of Faces ⋮ Newton polytopes and relative entropy optimization ⋮ Coercive Polynomials and Their Newton Polytopes ⋮ A unified framework of SAGE and SONC polynomials and its duality theory ⋮ Symbolic Proof of Bistability in Reaction Networks

Uses Software

• Sostools

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Norms of roots of trinomials
• Amoebas of genus at most one
• Convex normality of rational polytopes with long edges
• Real zeros for positive semidefinite forms. I
• Discriminants and nonnegative polynomials
• Positive semidefinite diagonal minus tail forms are sums of squares
• Forms derived from the arithmetic-geometric inequality
• A criterion for the ideal of a projectively embedded toric surface to be generated by quadrics
• Amoebas, Monge-Ampère measures, and triangulations of the Newton polytope
• NP-hardness of deciding convexity of quartic polynomials and related problems
• Real algebraic curves, the moment map and amoebas
• Laurent determinants and arrangements of hyperplane amoebas
• A nullstellensatz for amoebas
• Discriminants, resultants, and multidimensional determinants
• Dimers and amoebae
• Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
• Lower Bounds for Polynomials Using Geometric Programming
• Blenders
• Equations Defining Toric Varieties
• Convex Polytopes
• SOSTOOLS and Its Control Applications
• Oriented Matroids
• Semidefinite Optimization and Convex Algebraic Geometry
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity