A Convex Programming Approach to Solve Posynomial Systems
From MaRDI portal
Publication:5041057
DOI10.1007/978-3-030-52200-1_24zbMath1503.90091arXiv2005.07124OpenAlexW3043651513MaRDI QIDQ5041057
Marin Boyet, Stéphane Gaubert, Xavier Allamigeon, Marianne Akian
Publication date: 13 October 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.07124
Convex programming (90C25) Stochastic games, stochastic differential games (91A15) Tropical optimization (e.g., max-plus optimization) (90C24)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The intersection of convex transversals is a convex polytope
- Common tangents and common transversals
- Common supports as fixed points
- Spectral inequalities for nonnegative tensors and their tropical analogues
- The operator approach to entropy games
- Relative Entropy Relaxations for Signomial Optimization
- Performance Evaluation of an Emergency Call Center: Tropical Polynomial Systems Applied to Timed Petri Nets
- A Positivstellensatz for Sums of Nonnegative Circuit Polynomials
- A Variational Formula for Risk-Sensitive Reward
This page was built for publication: A Convex Programming Approach to Solve Posynomial Systems
