A convex programming approach to solve posynomial systems
From MaRDI portal
Abstract: We exhibit a class of classical or tropical posynomial systems which can be solved by reduction to linear or convex programming problems. This relies on a notion of colorful vectors with respect to a collection of Newton polytopes. This extends the convex programming approach of one player stochastic games.
Recommendations
Cites work
- A Positivstellensatz for sums of nonnegative circuit polynomials
- A variational formula for risk-sensitive reward
- Common supports as fixed points
- Common tangents and common transversals
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1944711 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Performance evaluation of an emergency call center: tropical polynomial systems applied to timed Petri nets
- Relative entropy relaxations for signomial optimization
- Spectral inequalities for nonnegative tensors and their tropical analogues
- The intersection of convex transversals is a convex polytope
- The operator approach to entropy games
This page was built for publication: A convex programming approach to solve posynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041057)