Signomial and polynomial optimization via relative entropy and partial dualization
From MaRDI portal
(Redirected from Publication:823883)
Recommendations
Cites work
- scientific article; zbMATH DE number 653035 (Why is no real title available?)
- A bounded degree SOS hierarchy for polynomial optimization
- A deterministic global optimization algorithm for generalized geometric programming
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
- A new rectangle branch-and-pruning approach for generalized geometric programming
- A penalty treatment of equality constraints in generalized geometric programming
- A robust algorithm for generalized geometric programming
- A unified framework of SAGE and SONC polynomials and its duality theory
- Algorithm 795
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- An efficient algorithm for range computation of polynomials using the Bernstein form
- An introduction to polynomial and semi-algebraic optimization
- Class of global minimum bounds of polynomial functions
- Comparison of generalized geometric programming algorithms
- Convex analysis and nonlinear optimization. Theory and examples.
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Disciplined geometric programming
- Forms derived from the arithmetic-geometric inequality
- Global injectivity and multiple equilibria in uni- and bi-molecular reaction networks
- Global optimization of signomial geometric programming problems
- Global optimization of signomial geometric programming using linear relaxation.
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Inductor design using signomial programming
- Nonconvex Optimization for Communication Networks
- Optimization and \(\mathrm{NP}_{\mathbb{R}}\)-completeness of certain fewnomials
- Polynomials that are positive on an interval
- Relative entropy relaxations for signomial optimization
- Some NP-complete problems in quadratic and nonlinear programming
- Some retarded difference inequalities of product form and their application
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Sums of squares, moment matrices and optimization over polynomials
Cited in
(18)- 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
- Signomial and Polynomial Optimization via Relative Entropy and Partial Dualization
- Dual certificates and efficient rational sum-of-squares decompositions for polynomial optimization over compact sets
- Sublinear circuits and the constrained signomial nonnegativity problem
- Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks
- Harmonic Hierarchies for Polynomial Optimization
- Relative entropy relaxations for signomial optimization
- Symmetric SAGE and SONC forms, exactness and quantitative gaps
- Nonnegative Polynomials and Circuit Polynomials
- An efficient method for solving multi-objective signomial programming problems in real life
- Algebraic Perspectives on Signomial Optimization
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- SONC optimization and exact nonnegativity certificates via second-order cone programming
- Newton polytopes and relative entropy optimization
- Performance enhancements for a generic conic interior point algorithm
- Symmetry reduction in AM/GM-based optimization
- Sublinear circuits for polyhedral sets
Describes a project that uses
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)
