Cargando…
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...
Autores principales: | Akian, Marianne, Allamigeon, Xavier, Boyet, Marin, Gaubert, Stéphane |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
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 |
Ejemplares similares
-
Piecewise Affine Dynamical Models of Timed Petri Nets – Application to Emergency Call Centers
por: Allamigeon, Xavier, et al.
Publicado: (2020) -
Theory of convex programming
por: Gol′steĭn, E G, et al.
Publicado: (1972) -
Interior point approach to linear, quadratic and convex programming: algorithms and complexity
por: Hertog, D
Publicado: (1994) -
Interior-point polynominal algoritms in convex programming
por: Nesterov, IU. E.
Publicado: (1994) -
Generalized bounds for convex multistage stochastic programs
por: Beckmann, M, et al.
Publicado: (2005)