Relative entropy methods in constrained polynomial and signomial optimization

DOI10.1007/978-3-031-38659-6_2MaRDI QIDQ6979708zbMATH OpenFDO

Authors Thorsten Theobald

Publication date 23 May 2025

Full work available at URL https://doi.org/10.1007/978-3-031-38659-6_2

Mathematics Subject Classification ID

Semidefinite programming (90C22) Polynomial optimization (90C23) Combinatorial optimization (90C27)

Cites work

• A Positivstellensatz for sums of nonnegative circuit polynomials
• A tutorial on geometric programming
• A unified framework of SAGE and SONC polynomials and its duality theory
• Algebraic Perspectives on Signomial Optimization
• Amoebas, nonnegative polynomials and sums of squares supported on circuits
• CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
• CVXPY: a Python-embedded modeling language for convex optimization
• DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
• Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
• Forms derived from the arithmetic-geometric inequality
• Global injectivity and multiple equilibria in uni- and bi-molecular reaction networks
• Lectures on convex optimization
• Moments, positive polynomials and their applications
• Newton polytopes and relative entropy optimization
• Nonnegative Polynomials and Circuit Polynomials
• Optimal Resource Allocation for Control of Networked Epidemic Models
• Optimal size of linear matrix inequalities in semidefinite approaches to polynomial optimization
• Relative entropy optimization and its applications
• Relative entropy relaxations for signomial optimization
• Representing polynomials by positive linear functions on compact convex polyhedra
• Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
• Signomial and polynomial optimization via relative entropy and partial dualization
• SONC optimization and exact nonnegativity certificates via second-order cone programming
• Sparse Polynomial Optimization
• Sublinear circuits and the constrained signomial nonnegativity problem
• Sublinear circuits for polyhedral sets
• Symmetry reduction in AM/GM-based optimization
• The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability
• The algebraic boundary of the sonc-cone
• The dual cone of sums of non-negative circuit polynomials

This page was built for publication: Relative entropy methods in constrained polynomial and signomial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979708)