A convex programming approach to solve posynomial systems

From MaRDI portal



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.












This page was built for publication: A convex programming approach to solve posynomial systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041057)