We introduce and study a cone which consists of a class of generalized polynomial functions
and which provides a common framework for recent non-negativity certificates of …

Circuit polynomials are polynomials with properties that make it easy to compute sharp and
certifiable global lower bounds for them. Consequently, one may use them to find certifiable …

Circuit polynomials are a certificate of nonnegativity for real polynomials, which can be
derived via a generalization of the classical inequality of arithmetic and geometric means. In …

The S S-cone provides a common framework for cones of polynomials or exponential sums
which establish non-negativity upon the arithmetic-geometric inequality, in particular for …

The cone of sums of nonnegative circuits (SONCs) is a subset of the cone of nonnegative
polynomials/exponential sums, which has been studied extensively in recent years. In this …

We compare four key hierarchies for solving Constrained Polynomial Optimization Problems
(CPOP) arising from semialgebraic proof systems: Sum of Squares (SOS), Sum of …

Résumé Cette these étudie le probleme de l'optimisation d'un polynôme trigonométrique
avec symétrie cristallographique. L'optimisation des polynômes trigonométriques était l'objet …

Understanding quantum phenomena which go beyond classical concepts is a focus of
modern quantum physics. Here, we show how the theory of nonnegative polynomials …

Relative entropy programs belong to the class of convex optimization problems. Within
techniques based on the arithmetic-geometric mean inequality, they facilitate to compute …

Optimized Pulse Patterns (OPPs) are gaining increasing popularity in the power electronics
community over the well-studied pulse width modulation due to their inherent ability to …