MPC

Mathematical Programming Computation, Volume 13, Issue 2, June 2021

Signomial and polynomial optimization via relative entropy and partial dualization

Riley Murray, Venkat Chandrasekaran, Adam Wierman

We describe a generalization of the Sums-of-AM/GM-Exponential (SAGE) methodology for relative entropy relaxations of constrained signomial and polynomial optimization problems. Our approach leverages the fact that SAGE certificates conveniently and transparently blend with convex duality, in a way which enables partial dualization of certain structured constraints. This more general approach retains key properties of ordinary SAGE relaxations (e.g. sparsity preservation), and inspires a projective method of solution recovery which respects partial dualization. We illustrate the utility of our methodology with a range of examples from the global optimization literature, along with a publicly available software package.

Full Text: PDF.
A Publisher Correction to this article was published on 09 February 2021

Authors


Imprint and privacy statement

For the imprint and privacy statement we refer to the Imprint of ZIB.
© 2008-2021 by Zuse Institute Berlin (ZIB).