A Convex Programming Approach to Solve Posynomial Systems

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 stochasti...

Descripción completa

Detalles Bibliográficos
Autores principales: Akian, Marianne, Allamigeon, Xavier, Boyet, Marin, Gaubert, Stéphane
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7340981/
http://dx.doi.org/10.1007/978-3-030-52200-1_24
Descripción
Sumario: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.

Ejemplares similares