Sublinear circuits and constrained signomial optimization

  • Thorsten Theobald (Goethe-Universität Frankfurt, Germany)
E1 05 (Leibniz-Saal)


Relative entropy programs belong to the class of convex optimization problems. Within techniques based on the arithmetic-geometric mean inequality, they facilitate to compute nonnegativity certificates of polynomials and of signomials (i.e., exponential sums).

While the initial focus was mostly on unconstrained certificates and unconstrained optimization, recently, Murray, Chandrasekaran and Wierman developed conditional techniques, which provide a natural extension to the case of convex constrained sets. The goal of this talk is to explain the geometry of the resulting cone ("conditional SAGE cone"). To this end, we introduce and study the sublinear circuits of a finite point set in R^n, which generalize the simplicial circuits of the affine-linear matroid induced by a set A to a constrained setting.

Based on joint work with R. Murray and H. Naumann.

Mirke Olschewski

MPI for Mathematics in the Sciences Contact via Mail

Upcoming Events of this Seminar