Signomial and polynomial optimization via relative entropy and partial dualization
From MaRDI portal
Publication:823883
DOI10.1007/S12532-020-00193-4OpenAlexW2955472196MaRDI QIDQ823883FDOQ823883
Authors: Riley Murray, Venkat Chandrasekaran, Adam Wierman 
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)
Cites Work
- Algorithm 795
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Some NP-complete problems in quadratic and nonlinear programming
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Sums of squares, moment matrices and optimization over polynomials
- Class of global minimum bounds of polynomial functions
- Polynomials that are positive on an interval
- Forms derived from the arithmetic-geometric inequality
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Global optimization of signomial geometric programming using linear relaxation.
- 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
- Title not available (Why is that?)
- A penalty treatment of equality constraints in generalized geometric programming
- Comparison of generalized geometric programming algorithms
- Global optimization of signomial geometric programming problems
- A deterministic global optimization algorithm for generalized geometric programming
- A robust algorithm for generalized geometric programming
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Relative entropy relaxations for signomial optimization
- An efficient algorithm for range computation of polynomials using the Bernstein form
- Global injectivity and multiple equilibria in uni- and bi-molecular reaction networks
- A bounded degree SOS hierarchy for polynomial optimization
- Some retarded difference inequalities of product form and their application
- Disciplined geometric programming
- Optimization and NP_R-completeness of certain fewnomials
- Nonconvex Optimization for Communication Networks
- Inductor design using signomial programming
- A unified framework of SAGE and SONC polynomials and its duality theory
Cited In (18)
- Signomial and Polynomial Optimization via Relative Entropy and Partial Dualization
- Relative entropy relaxations for signomial optimization
- Sublinear circuits for polyhedral sets
- Nonnegative Polynomials and Circuit Polynomials
- A Sum of Squares Characterization of Perfect Graphs
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- Algebraic Perspectives on Signomial Optimization
- Performance enhancements for a generic conic interior point algorithm
- Symmetric SAGE and SONC forms, exactness and quantitative gaps
- Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks
- Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023
- Harmonic Hierarchies for Polynomial Optimization
- Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets
- An efficient method for solving multi-objective signomial programming problems in real life
- SONC optimization and exact nonnegativity certificates via second-order cone programming
- Newton polytopes and relative entropy optimization
- Sublinear circuits and the constrained signomial nonnegativity problem
- Symmetry Reduction in AM/GM-Based Optimization
Uses Software
This page was built for publication: Signomial and polynomial optimization via relative entropy and partial dualization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q823883)
