Nonnegativity of signomials with Newton simplex over A-convex sets
Abstract
We study a class of signomials whose positive support is the set of vertices of a simplex and which may have several negative support points in the simplex. Various groups of authors have provided an exact characterization for the global nonnegativity of a signomial in this class in terms of circuit signomials and that characterization provides a tractable nonnegativity test. We generalize this characterization to the constrained nonnegativity over a set X under an additional convexity precondition in the exponential moment space. This provides a tractable nonnegativity test over X for the class in terms of a power cone program. Our proof methods rely on a variant of the convex cone of constrained SAGE signomials (sums of arithmetic-geometric exponentials) and the duality theory.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.