A convex programming approach to solve posynomial systems
Optimization and Control
2020-05-15 v1 Combinatorics
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.
Cite
@article{arxiv.2005.07124,
title = {A convex programming approach to solve posynomial systems},
author = {Marianne Akian and Xavier Allamigeon and Marin Boyet and Stéphane Gaubert},
journal= {arXiv preprint arXiv:2005.07124},
year = {2020}
}
Comments
To appear in the proceedings of ICMS 2020