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
_version_ 1783555137590001664
author Akian, Marianne
Allamigeon, Xavier
Boyet, Marin
Gaubert, Stéphane
author_facet Akian, Marianne
Allamigeon, Xavier
Boyet, Marin
Gaubert, Stéphane
author_sort Akian, Marianne
collection PubMed
description 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.
format Online
Article
Text
id pubmed-7340981
institution National Center for Biotechnology Information
language English
publishDate 2020
record_format MEDLINE/PubMed
spelling pubmed-73409812020-07-08 A Convex Programming Approach to Solve Posynomial Systems Akian, Marianne Allamigeon, Xavier Boyet, Marin Gaubert, Stéphane Mathematical Software – ICMS 2020 Article 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. 2020-06-06 /pmc/articles/PMC7340981/ http://dx.doi.org/10.1007/978-3-030-52200-1_24 Text en © Springer Nature Switzerland AG 2020 This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic.
spellingShingle Article
Akian, Marianne
Allamigeon, Xavier
Boyet, Marin
Gaubert, Stéphane
A Convex Programming Approach to Solve Posynomial Systems
title A Convex Programming Approach to Solve Posynomial Systems
title_full A Convex Programming Approach to Solve Posynomial Systems
title_fullStr A Convex Programming Approach to Solve Posynomial Systems
title_full_unstemmed A Convex Programming Approach to Solve Posynomial Systems
title_short A Convex Programming Approach to Solve Posynomial Systems
title_sort convex programming approach to solve posynomial systems
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7340981/
http://dx.doi.org/10.1007/978-3-030-52200-1_24
work_keys_str_mv AT akianmarianne aconvexprogrammingapproachtosolveposynomialsystems
AT allamigeonxavier aconvexprogrammingapproachtosolveposynomialsystems
AT boyetmarin aconvexprogrammingapproachtosolveposynomialsystems
AT gaubertstephane aconvexprogrammingapproachtosolveposynomialsystems
AT akianmarianne convexprogrammingapproachtosolveposynomialsystems
AT allamigeonxavier convexprogrammingapproachtosolveposynomialsystems
AT boyetmarin convexprogrammingapproachtosolveposynomialsystems
AT gaubertstephane convexprogrammingapproachtosolveposynomialsystems

Ejemplares similares