Sageopt enables proof-based signomial and polynomial optimization¶
Sageopt provides functionality for constructing, solving, and analyzing convex relaxations for signomial and polynomial optimization problems. It also provides functionality for recovering feasible solutions from these convex relaxations.
You can use sageopt as a standalone tool to find provably optimal solutions to hard optimization problems. You can also use sageopt as part of a broader effort to find locally-optimal solutions to especially difficult problems (with bounds on possible optimality gaps).
These underlying convex relaxations are built upon the idea of “SAGE certificates” for signomial and polynomial nonnegativity. The paper Signomial and Polynomial Optimization via Relative Entropy and Partial Dualization describes the mathematics of the functionality implemented by this python package. That paper however is a bit long, and so we hope that the “Examples” and “Documentation” links in the sidebar are enough to get you rolling.
The full map for this site is given below.