82 citations · 110 across the 27 of their papers we have counts for
38 papers
Combinatorics and preservation of conically stable polynomials
Giulia Codenotti, Stephan Gardoll, Thorsten Theobald
Given a closed, convex cone , a multivariate polynomial is called -stable if the imaginary parts of its roots are not conta…
Semidefinite games
Constantin Ickstadt, Thorsten Theobald, Elias Tsigaridas
We introduce and study the class of semidefinite games, which generalizes bimatrix games and finite -person games, by replacing the simplex of the mixed strategies for each play…
Imaginary Projections: Complex Versus Real Coefficients
Stephan Gardoll, Mahsa Sayyary Namin, Thorsten Theobald
Given a multivariate complex polynomial , the imaginary projection of is defined as the projection of the variety $\mathcal{V…
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…