Complexity of Geometric programming in the Turing model and application to nonnegative tensors

Shmuel Friedland, Stéphane Gaubert

We consider a version of geometric programming problem consisting in minimizing a function given by the maximum of finitely many log-Laplace transforms of discrete nonnegative meas…