11 citations · 11 across the 3 of their papers we have counts for
7 papers
Sublinear circuits for polyhedral sets
Helen Naumann, Thorsten Theobald
Sublinear circuits are generalizations of the affine circuits in matroid theory, and they arise as the convex-combinatorial core underlying constrained non-negativity certificates…
Symmetry reduction in AM/GM-based optimization
Philippe Moustrou, Helen Naumann, Cordian Riener +2
The arithmetic mean/geometric mean-inequality (AM/GM-inequality) facilitates classes of non-negativity certificates and of relaxation techniques for polynomials and, more generally…
Sublinear Circuits and the Constrained Signomial Nonnegativity Problem
Riley Murray, Helen Naumann, Thorsten Theobald
Conditional Sums-of-AM/GM-Exponentials (conditional SAGE) is a decomposition method to prove nonnegativity of a signomial or polynomial over some subset of real space. In this…
The -cone and a primal-dual view on second-order representability
Helen Naumann, Thorsten Theobald
The -cone provides a common framework for cones of polynomials or exponential sums which establish non-negativity upon the arithmetic-geometric inequality, in particul…
Global Optimization via the Dual SONC Cone and Linear Programming
Mareike Dressler, Janin Heuer, Helen Naumann +1
Using the dual cone of sums of nonnegative circuits (SONC), we provide a relaxation of the global optimization problem to minimize an exponential sum and, as a special case, a mult…
A unified framework of SAGE and SONC polynomials and its duality theory
Lukas Katthän, Helen Naumann, Thorsten Theobald
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 polynomi…
The dual cone of sums of non-negative circuit polynomials
Mareike Dressler, Helen Naumann, Thorsten Theobald
For a non-empty, finite subset , denote by the cone of sums of non-negative ci…