Algebraic Perspectives on Signomial Optimization
From MaRDI portal
Publication:5886830
Recommendations
- Relative entropy relaxations for signomial optimization
- Newton polytopes and relative entropy optimization
- Sublinear circuits and the constrained signomial nonnegativity problem
- Signomial and polynomial optimization via relative entropy and partial dualization
- Exact optimization via sums of nonnegative circuits and arithmetic-geometric-mean-exponentials
Cites work
- scientific article; zbMATH DE number 3172146 (Why is no real title available?)
- scientific article; zbMATH DE number 653035 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- A general representation theorem for partially ordered commutative rings
- A new sparse SOS decomposition algorithm based on term sparsity
- A notion of total dual integrality for convex, semidefinite, and extended formulations
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
- A representation theorem for certain partially ordered commutative rings
- A unified framework of SAGE and SONC polynomials and its duality theory
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- Approximating Positive Polynomials Using Sums of Squares
- BARON: A general purpose global optimization software package
- Bound-constrained polynomial optimization using only elementary calculations
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Comparison of generalized geometric programming algorithms
- Computing the volume, counting integral points, and exponential sums
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
- Forms derived from the arithmetic-geometric inequality
- Fractional moments and maximum entropy: geometric meaning
- Geometric programming with signomials
- Global injectivity and multiple equilibria in uni- and bi-molecular reaction networks
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Hyperloop system optimization
- Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets
- Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained polynomial optimization
- Maximum Entropy Density Estimation from Fractional Moments
- Moment problem for symmetric algebras of locally convex spaces
- Multiple Equilibria in Complex Chemical Reaction Networks: I. The Injectivity Property
- Multistationarity in Biochemical Networks: Results, Analysis, and Examples
- Newton polytopes and relative entropy optimization
- On an extension of Pólya's Positivstellensatz
- On the bijectivity of families of exponential/generalized polynomial maps
- On the determinacy of the moment problem for symmetric algebras of a locally convex space
- Optimal design of a membrane separation process using signomial programming
- Problème des moments sur un compact de \({\mathbb{R}}^ n\) et décomposition de polynômes a plusieurs variables
- Real analysis
- Relative entropy optimization and its applications
- Relative entropy relaxations for signomial optimization
- Representing polynomials by positive linear functions on compact convex polyhedra
- SCIP: solving constraint integer programs
- 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
- Solving a class of multivariate integration problems via Laplace techniques
- Some NP-complete problems in quadratic and nonlinear programming
- Sparsity in sums of squares of polynomials
- Stieltjes moment problem via fractional moments
- Sublinear circuits and the constrained signomial nonnegativity problem
- Sublinear circuits for polyhedral sets
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Symmetry reduction in AM/GM-based optimization
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- The kinetic space of multistationarity in dual phosphorylation
- Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
Cited in
(3)
This page was built for publication: Algebraic Perspectives on Signomial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886830)
