Relative Entropy Relaxations for Signomial Optimization
From MaRDI portal
Publication:2805708
DOI10.1137/140988978zbMath1345.90066arXiv1409.7640OpenAlexW2239251014MaRDI QIDQ2805708
Venkat Chandrasekaran, Parikshit Shah
Publication date: 13 May 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.7640
global optimizationconvex optimizationgeometric programmingreal algebraic geometryarithmetic-geometric-mean inequality
Related Items
On the Heavy-Tail Behavior of the Distributionally Robust Newsvendor, Initial steps in the classification of maximal mediated sets, Signomial and polynomial optimization via relative entropy and partial dualization, Algebraic Perspectives on Signomial Optimization, The Algebraic Boundary of the Sonc-Cone, A Convex Programming Approach to Solve Posynomial Systems, Lifting for Simplicity: Concise Descriptions of Convex Sets, Sublinear circuits for polyhedral sets, Functional norms, condition numbers and numerical algorithms in algebraic geometry, Duality of sum of nonnegative circuit polynomials and optimal SONC bounds, Lieb's concavity theorem, matrix geometric means, and semidefinite optimization, Symmetry Reduction in AM/GM-Based Optimization, SONC optimization and exact nonnegativity certificates via second-order cone programming, A hierarchy of spectral relaxations for polynomial optimization, Performance enhancements for a generic conic interior point algorithm, Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks, 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, Real tropicalization and negative faces of the Newton polytope, A Positivstellensatz for Sums of Nonnegative Circuit Polynomials, TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity, Relative entropy optimization and its applications, Real zeros of SONC polynomials, Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization, Robust budget allocation via continuous submodular functions, The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability, Spectral inequalities for nonnegative tensors and their tropical analogues, Primal-Dual Interior-Point Methods for Domain-Driven Formulations, The dual cone of sums of non-negative circuit polynomials, Limitations on the Expressive Power of Convex Cones without Long Chains of Faces, Newton polytopes and relative entropy optimization, A unified framework of SAGE and SONC polynomials and its duality theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A tutorial on geometric programming
- Forms derived from the arithmetic-geometric inequality
- The \(K\)-moment problem for compact semi-algebraic sets
- Extremal positive semidefinite forms
- Second-order method of generalized geometric programming for spatial frame optimization
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Semidefinite programming relaxations for semialgebraic problems
- Linearization method of global optimization for generalized geometric programming
- Uniform denominators in Hilbert's seventeenth problem
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- On an extension of Pólya's Positivstellensatz
- Anneaux preordonnes
- There are significantly more nonnegative polynomials than sums of squares
- Geometric programming with signomials
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- Global Optimization with Polynomials and the Problem of Moments
- Lower Bounds for Polynomials Using Geometric Programming
- Geometric Programming Duals of Channel Capacity and Rate Distortion
- Class of global minimum bounds of polynomial functions
- Geometric Programming
- Digital Circuit Optimization via Geometric Programming
- Elements of Information Theory
- Convex Analysis
- Geometric Programming for Communication Systems
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
