Signomial and polynomial optimization via relative entropy and partial dualization
From MaRDI portal
Publication:823883
DOI10.1007/s12532-020-00193-4OpenAlexW2955472196MaRDI QIDQ823883
Adam Wierman, Venkat Chandrasekaran, Riley Murray
Publication date: 16 December 2021
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.00814
Numerical analysis (65-XX) Computer science (68-XX) Operations research, mathematical programming (90-XX)
Related Items (14)
Algebraic Perspectives on Signomial Optimization ⋮ Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets ⋮ Sublinear circuits for polyhedral sets ⋮ Nonnegative Polynomials and Circuit Polynomials ⋮ Symmetry Reduction in AM/GM-Based Optimization ⋮ An efficient method for solving multi-objective signomial programming problems in real life ⋮ 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 ⋮ A Sum of Squares Characterization of Perfect Graphs ⋮ Performance enhancements for a generic conic interior point algorithm ⋮ 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 ⋮ Harmonic Hierarchies for Polynomial Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- Global optimization of signomial geometric programming problems
- Global injectivity and multiple equilibria in uni- and bi-molecular reaction networks
- Convex analysis and nonlinear optimization. Theory and examples.
- A new rectangle branch-and-pruning approach for generalized geometric programming
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
- A robust algorithm for generalized geometric programming
- An efficient algorithm for range computation of polynomials using the Bernstein form
- Forms derived from the arithmetic-geometric inequality
- A penalty treatment of equality constraints in generalized geometric programming
- Comparison of generalized geometric programming algorithms
- Global optimization of signomial geometric programming using linear relaxation.
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Some retarded difference inequalities of product form and their application
- Disciplined geometric programming
- A bounded degree SOS hierarchy for polynomial optimization
- A deterministic global optimization algorithm for generalized geometric programming
- Global Optimization with Polynomials and the Problem of Moments
- Relative Entropy Relaxations for Signomial Optimization
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Optimization and NP_R-completeness of certain fewnomials
- GloptiPoly 3: moments, optimization and semidefinite programming
- Nonconvex Optimization for Communication Networks
- Inductor design using signomial programming
- Some NP-complete problems in quadratic and nonlinear programming
- Class of global minimum bounds of polynomial functions
- Polynomials that are positive on an interval
- Algorithm 795
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- A unified framework of SAGE and SONC polynomials and its duality theory
This page was built for publication: Signomial and polynomial optimization via relative entropy and partial dualization
