Algebraic Perspectives on Signomial Optimization
From MaRDI portal
Publication:5886830
DOI10.1137/21M1462568MaRDI QIDQ5886830FDOQ5886830
Riley Murray, Mareike Dressler
Publication date: 11 April 2023
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.00345
polynomial optimizationexponential sumssums of squaresmoment problemssignomial programmingsums of arithmetic-geometric exponentialsrelative entropy programmingexponential cone programmingnonnegative circuit polynomialsnonnegative signomials
Convex programming (90C25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Real algebraic and real-analytic geometry (14P99) Set functions, measures and integrals with values in ordered spaces (28B15) Polynomial optimization (90C23)
Cites Work
- BARON: A general purpose global optimization software package
- SCIP: solving constraint integer programs
- Title not available (Why is that?)
- Some NP-complete problems in quadratic and nonlinear programming
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- Multiple Equilibria in Complex Chemical Reaction Networks: I. The Injectivity Property
- Representing polynomials by positive linear functions on compact convex polyhedra
- On an extension of Pólya's Positivstellensatz
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- GloptiPoly 3: moments, optimization and semidefinite programming
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Forms derived from the arithmetic-geometric inequality
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Geometric programming with signomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Comparison of generalized geometric programming algorithms
- Newton polytopes and relative entropy optimization
- Optimal design of a membrane separation process using signomial programming
- Maximum Entropy Density Estimation from Fractional Moments
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
- Relative entropy relaxations for signomial optimization
- A general representation theorem for partially ordered commutative rings
- Sparsity in sums of squares of polynomials
- A representation theorem for certain partially ordered commutative rings
- Stieltjes moment problem via fractional moments
- Global injectivity and multiple equilibria in uni- and bi-molecular reaction networks
- Computing the volume, counting integral points, and exponential sums
- Solving a class of multivariate integration problems via Laplace techniques
- Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization
- Relative entropy optimization and its applications
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
- Problème des moments sur un compact de \({\mathbb{R}}^ n\) et décomposition de polynômes a plusieurs variables
- Approximating Positive Polynomials Using Sums of Squares
- Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
- On the determinacy of the moment problem for symmetric algebras of a locally convex space
- Moment problem for symmetric algebras of locally convex spaces
- A unified framework of SAGE and SONC polynomials and its duality theory
- Signomial and polynomial optimization via relative entropy and partial dualization
- Sublinear circuits for polyhedral sets
- The kinetic space of multistationarity in dual phosphorylation
- Fractional Moments and Maximum Entropy: Geometric Meaning
- Multistationarity in Biochemical Networks: Results, Analysis, and Examples
- A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
- Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets
- Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
- On the Bijectivity of Families of Exponential/Generalized Polynomial Maps
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
- A New Sparse SOS Decomposition Algorithm Based on Term Sparsity
- Sublinear circuits and the constrained signomial nonnegativity problem
- Symmetry Reduction in AM/GM-Based Optimization
- Hyperloop system optimization
Cited In (2)
Uses Software
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)
