A unified framework of SAGE and SONC polynomials and its duality theory

DOI10.1090/mcom/3607zbMath1466.14062arXiv1903.08966OpenAlexW3113077080MaRDI QIDQ5856744

Helen Naumann, Lukas Katthän, Thorsten Theobald

Publication date: 29 March 2021

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

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

zbMATH Keywords

polynomialssums of non-negative circuit polynomialssums of arithmetic-geometric mean exponentials

Mathematics Subject Classification ID

Nonlinear programming (90C30) Real algebraic sets (14P05) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (11)

Signomial and polynomial optimization via relative entropy and partial dualization ⋮ Algebraic Perspectives on Signomial Optimization ⋮ Sublinear circuits for polyhedral sets ⋮ Duality of sum of nonnegative circuit polynomials and optimal SONC bounds ⋮ Nonnegative Polynomials and Circuit Polynomials ⋮ Symmetry Reduction in AM/GM-Based Optimization ⋮ SONC optimization and exact nonnegativity certificates via second-order cone programming ⋮ Rational dual certificates for weighted sums-of-squares polynomials with boundable bit size ⋮ Sublinear circuits and the constrained signomial nonnegativity problem ⋮ Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 ⋮ The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability

Uses Software

• SPOTless
• Sparse-BSOS
• TSSOS
• REPOP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Amoebas, nonnegative polynomials and sums of squares supported on circuits
• Some applications of polynomial optimization in operations research and real-time decision making
• The \(\mathcal A\)-truncated \(K\)-moment problem
• Relative entropy optimization and its applications
• SOS approximations of nonnegative polynomials via simple high degree perturbations
• Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
• Positive polynomials in control.
• Sparsity in sums of squares of polynomials
• An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
• The dual cone of sums of non-negative circuit polynomials
• Relative Entropy Relaxations for Signomial Optimization
• Certified Roundoff Error Bounds Using Semidefinite Programming
• Lectures on Polytopes
• Global optimization via the dual SONC cone and linear programming
• 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
• Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
• DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
• Convex Bodies The Brunn-MinkowskiTheory
• A Sum of Squares Approximation of Nonnegative Polynomials
• Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization
• Strong duality in lasserre's hierarchy for polynomial optimization

This page was built for publication: A unified framework of SAGE and SONC polynomials and its duality theory