A convex programming approach to solve posynomial systems
arXiv:2005.07124
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.
To appear in the proceedings of ICMS 2020