An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming

DOI10.1016/J.JSC.2018.06.018zbMath1411.12003arXiv1602.06180OpenAlexW2997540580MaRDI QIDQ1994127

Sadik Iliman, Timo de Wolff, Mareike Dressler

Publication date: 1 November 2018

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

triangulationsemidefinite programminggeometric programmingsum of squarescertificatenonnegative polynomialsum of nonnegative circuit polynomials

Mathematics Subject Classification ID

Semidefinite programming (90C22) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Real algebraic sets (14P05) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15)

Related Items (11)

The kinetic space of multistationarity in dual phosphorylation ⋮ Nonnegative Polynomials and Circuit Polynomials ⋮ Symmetry Reduction in AM/GM-Based Optimization ⋮ SONC optimization and exact nonnegativity certificates via second-order cone programming ⋮ Real tropicalization and negative faces of the Newton polytope ⋮ Harmonic Hierarchies for Polynomial Optimization ⋮ A Positivstellensatz for Sums of Nonnegative Circuit Polynomials ⋮ Real zeros of SONC polynomials ⋮ Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization ⋮ Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs ⋮ A unified framework of SAGE and SONC polynomials and its duality theory

Uses Software

• Sostools
• SYNRAC
• SparsePOP
• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Amoebas, nonnegative polynomials and sums of squares supported on circuits
• Optimality conditions and finite convergence of Lasserre's hierarchy
• Lower bounds on the global minimum of a polynomial
• Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
• Positive semidefinite diagonal minus tail forms are sums of squares
• A tutorial on geometric programming
• Extremal psd forms with few terms
• An exact Jacobian SDP relaxation for polynomial optimization
• Computing sum of squares decompositions with rational coefficients
• Certifying convergence of Lasserre's hierarchy via flat truncation
• There are significantly more nonnegative polynomials than sums of squares
• Minimizing polynomials via sum of squares over the gradient ideal
• Global Optimization with Polynomials and the Problem of Moments
• Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
• Nonnegative polynomials and sums of squares
• Lower Bounds for Polynomials Using Geometric Programming
• Graph Implementations for Nonsmooth Convex Programs
• Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
• GloptiPoly 3: moments, optimization and semidefinite programming
• Semidefinite Optimization and Convex Algebraic Geometry
• Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares

This page was built for publication: An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming