Newton polytopes and relative entropy optimization
From MaRDI portal
Publication:2067684
DOI10.1007/s10208-021-09497-wzbMath1483.90121arXiv1810.01614OpenAlexW2895618514MaRDI QIDQ2067684
Riley Murray, Venkat Chandrasekaran, Adam Wierman
Publication date: 18 January 2022
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.01614
SAGEfewnomialssparse polynomialsarithmetic-geometric-mean inequalitysignomialscertifying nonnegativity
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Real-analytic and semi-analytic sets (14P15)
Related Items
Algebraic Perspectives on Signomial Optimization, The Algebraic Boundary of the Sonc-Cone, 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, Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023, Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks, Sublinear circuits and the constrained signomial nonnegativity problem, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
Uses Software
Cites Work
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- Global injectivity and multiple equilibria in uni- and bi-molecular reaction networks
- Lower bounds on the global minimum of a polynomial
- A tutorial on geometric programming
- Forms derived from the arithmetic-geometric inequality
- A penalty treatment of equality constraints in generalized geometric programming
- Extremal psd forms with few terms
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Linearization method of global optimization for generalized geometric programming
- Sparsity in sums of squares of polynomials
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- Anneaux preordonnes
- Global Optimization with Polynomials and the Problem of Moments
- Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
- Relative Entropy Relaxations for Signomial Optimization
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- The Ronkin number of an exponential sum
- Lower Bounds for Polynomials Using Geometric Programming
- Optimization and NP_R-completeness of certain fewnomials
- Designing globally optimal delta-sigma modulator topologies via signomial programming
- Inductor design using signomial programming
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Some NP-complete problems in quadratic and nonlinear programming
- Class of global minimum bounds of polynomial functions
- Optimal design of a membrane separation process using signomial programming
- On the Bijectivity of Families of Exponential/Generalized Polynomial Maps
- A Positivstellensatz for Sums of Nonnegative Circuit Polynomials
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Coercive Polynomials and Their Newton Polytopes
- Generalization of primal-dual interior-point methods to convex optimization problems in conic form
- An algorithmic approach to Schmüdgen's Positivstellensatz
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
