A Convex Programming Approach to Solve Posynomial Systems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationMathematical Software – ICMS 2020 - 7th International Conference, Proceedings
EditorsAnna Maria Bigatti, Jacques Carette, James H. Davenport, Michael Joswig, Timo de Wolff
PublisherSpringer
Pages241-250
Number of pages10
ISBN (Print)9783030521998
DOIs
Publication statusPublished - 1 Jan 2020
Event7th International Congress on Mathematical Software, ICMS 2020 - Braunschweig, Germany
Duration: 13 Jul 202016 Jul 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12097 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Congress on Mathematical Software, ICMS 2020
Country/TerritoryGermany
CityBraunschweig
Period13/07/2016/07/20

Fingerprint

Dive into the research topics of 'A Convex Programming Approach to Solve Posynomial Systems'. Together they form a unique fingerprint.

Cite this