Abstract
Conditional SumsofAM/GMExponentials (conditional SAGE) is a decomposition method to prove nonnegativity of a signomial or polynomial over some subset X of real space. In this article, we undertake the first structural analysis of conditional SAGE signomials for convex sets X. We introduce the Xcircuits of a finite subset \({\mathcal {A}}\subset {\mathbb {R}}^n\), which generalize the simplicial circuits of the affinelinear matroid induced by \({\mathcal {A}}\) to a constrained setting. The Xcircuits serve as the main tool in our analysis and exhibit particularly rich combinatorial properties for polyhedral X, in which case the set of Xcircuits is comprised of onedimensional cones of suitable polyhedral fans. The framework of Xcircuits transparently reveals when an Xnonnegative conditional AM/GMexponential can in fact be further decomposed as a sum of simpler Xnonnegative signomials. We develop a duality theory for Xcircuits with connections to geometry of sets that are convex according to the geometric mean. This theory provides an optimal power cone reconstruction of conditional SAGE signomials when X is polyhedral. In conjunction with a notion of reduced Xcircuits, the duality theory facilitates a characterization of the extreme rays of conditional SAGE cones. Since signomials under logarithmic variable substitutions give polynomials, our results also have implications for nonnegative polynomials and polynomial optimization.
1 Introduction
Given a finite subset \({\mathcal {A}} \subset {\mathbb {R}}^n\), a signomial on \({\mathcal {A}}\) is a reallinear combination
with coefficients \(c = (c_{\alpha })_{\alpha \in {\mathcal {A}}}\) . Signomials are a fundamental class of functions with applications in, but not limited to, chemical reaction networks [19, 20], aircraft design optimization [31, 42], and epidemiological process control [29, 35]. We refer the reader to [10] and its references for the manifold occurrences of signomials in pure and applied mathematics and to [22, §1.1] for an abridged history of signomial modeling which begins with geometric programming. Signomials are often considered under a logarithmic change of variables \(y \mapsto f(\log y) = \sum _{\alpha \in {\mathcal {A}}}c_{\alpha }\prod _{i=1}^n y_i^{\alpha _i}\), so that for \({\mathcal {A}}\subset {\mathbb {N}}^n\) one obtains polynomials over the positive orthant \({\mathbb {R}}^{n}_{++}\).
A basic question one might ask of a signomial is when the coefficients \(c = (c_{\alpha })_{\alpha \in {\mathcal {A}}}\) are such that f is globally nonnegative. Framing this question in terms of a signomial’s coefficients affords direct connections to polynomials. If the exponent vectors \({\mathcal {A}}\) are contained in \({\mathbb {N}}^n\), then f is nonnegative on \({\mathbb {R}}^n\) if and only if the polynomial \(y \mapsto \sum _{\alpha \in {\mathcal {A}}}c_{\alpha }\prod _{i=1}^n y_i^{\alpha _i}\) is nonnegative on the nonnegative orthant \({\mathbb {R}}^n_+\). Deciding such nonnegativity problems is NPhard in general [25]. However, several researchers have developed sufficient conditions for nonnegativity based on the AM/GM inequality. In contrast to the wellknown SumsofSquares nonnegativity certificates in the polynomial setting (see, e.g., [18, 34]), the techniques based on the AM/GM inequality are not tied to the notion of a polynomial’s degree, and hence apply to general signomials. The earliest results here are due to Reznick [36], with a resurgence marked by the works of Pantea, Koeppl, and Craciun [32], Iliman and de Wolff [14], and Chandrasekaran and Shah [4]. Whether considered for signomials or polynomials, such techniques have appealing forms of sparsity preservation in the proofs of nonnegativity [23, 40].
In this article, we are concerned with the question of when a signomial on exponents \({\mathcal {A}}\) is Xnonnegative (i.e., nonnegative on X) for a convex set X. In important progress on this question, Murray, Chandrasekaran and Wierman have proposed an extension of the SumsofAM/GMExponentials or SAGE approach to global nonnegativity [4], which goes by the name conditional SAGE [24]. The method works as follows: if a signomial f of the form (1) has at most one negative coefficient \(c_{\beta }\), i.e.,
then we may divide out the corresponding basis function \(\mathrm{e}^{\beta }\) to obtain a new signomial \(g =\sum _{\alpha \in {\mathcal {A}}}c_{\alpha } \mathrm{e}^{[\alpha \beta ]}\) without affecting nonnegativity. Because g is the sum of a signomial with all nonnegative coefficients (a posynomial) and a constant, it is convex by construction, its Xnonnegativity can be decided by applying the principle of strong duality in convex optimization. The outcome of this duality argument is that f is Xnonnegative if and only if there exists a dual variable \(\nu = (\nu _{\alpha })_{\alpha \in {\mathcal {A}}}\) that satisfies a certain relative entropy inequality in \(\nu \), c, and the support function of X (see Proposition 2.3 for a precise statement). Thus, the Xnonnegativity of f can be decided by convex relative entropy programming. The Xnonnegative signomials with at most one negative coefficient are called XAGE, and the signomials which decompose into a sum of such functions are called XSAGE. The recognition problem for XSAGE signomials can likewise be decided by relative entropy programming.
The purpose of this article is to undertake the first structural analysis of the cones of XSAGE signomials on exponents \({\mathcal {A}}\), which we henceforth denote by \(C_X({\mathcal {A}})\). At the outset of this research, our goals were to find counterparts to the many convexcombinatorial properties known for the unconstrained case \(C_{{\mathbb {R}}^n}({\mathcal {A}})\) [12, 17, 23], and to understand conditional SAGE relative to techniques such as nonnegative circuit polynomials [14, 32, 36]. Towards this end we have introduced an analysis tool of sublinear circuits which we call the Xcircuits of \({\mathcal {A}}\). Our definition of these Xcircuits (see Sect. 3) centers on a local, orthantwise, strictsublinearity condition for the support function of X composed with \({\mathcal {A}}\). This construction ensures that the special case of \({\mathbb {R}}^n\)circuits reduces to the simplicial circuits of the affinelinear matroid induced by \({\mathcal {A}}\).
We demonstrate that analysis by Xcircuits is extremely effective in describing many structural aspects of XSAGE cones. Our techniques are sufficiently robust that one can prove nearly every result in this manuscript assuming nothing of X beyond convexity. Some special treatment is given to the case when X is polyhedral, as this reveals some striking interactions between discrete, convex, and socalled geometrically convex or multiplicatively convex geometry (see Sect. 5). In a broader sense, a selection of our results have consequences for numerical optimization, such as basis identification in optimization with SAGE certificates, and a procedure to simplify certain systems of power cone inequalities on the nonnegative orthant.
1.1 Main contributions
We begin by introducing some limited notation. The vector space of real \({\mathcal {A}}\)tuples indexed by \(\alpha \in {\mathcal {A}}\) is denoted by \({\mathbb {R}}^{{\mathcal {A}}}\). The support function of a convex set X, denoted by \(\sigma _X\), is the convex function defined by \(\sigma _X(y) = \sup \{ y^T x : x \in X \}\). We regard the exponent set \({\mathcal {A}}\subset {\mathbb {R}}^n\) as a linear operator from \({\mathbb {R}}^{{\mathcal {A}}}\) to \({\mathbb {R}}^n\) by \({\mathcal {A}}\nu =\sum _{\alpha \in {\mathcal {A}}}\alpha \nu _{\alpha }\); the corresponding adjoint is denoted \({\mathcal {A}}^T\). For concreteness, one might think of \({\mathcal {A}}\) as a matrix with columns given by the exponents \(\alpha \). We continue to use \(C_X({\mathcal {A}})\) to denote the cone of XSAGE signomials on \({\mathcal {A}}\). For each \(\beta \in {\mathcal {A}}\), we denote the corresponding cone of XAGE functions by
where \(c_{{\setminus }\beta }\) denotes the vector in \({\mathbb {R}}^{{\mathcal {A}}{\setminus }\beta }\) formed by deleting \(c_{\beta }\) from c.
The basic tools for our analysis are the Xcircuits of \({\mathcal {A}}\) (routinely abbreviated to Xcircuits). We formulate the Xcircuits of \({\mathcal {A}}\) as nonzero vectors \(\nu ^\star \in {\mathbb {R}}^{{\mathcal {A}}}\) at which the augmented support function \(\nu \mapsto \sigma _X({\mathcal {A}}\nu )\) exhibits a strict sublinearity condition (see Definition 3.1). We characterize Xcircuits as generators of suitable convex cones in \({\mathbb {R}}^{{\mathcal {A}}} \times {\mathbb {R}}\) and usually focus on normalized Xcircuits \(\lambda \in {\mathbb {R}}^{{\mathcal {A}}}\), for which the nonnegative entries sum to unity. Theorem 3.7 shows that in the polyhedral case, Xcircuits are exactly the generators of all onedimensional elements of a suitable polyhedral fan. A key consequence of Theorem 3.7 is that when X is a polyhedron, there are only finitely many normalized Xcircuits.
Section 4 uses the machinery of Xcircuits to understand XAGE cones. First, we show that if a signomial generates an extreme ray of \(C_X({\mathcal {A}},\beta )\), then the dual variable \(\nu \) which certifies its required relative entropy inequality must be an Xcircuit (Theorem 4.2). Normalized Xcircuits \(\lambda \) are then associated to cones of \(\lambda \)witnessed AGE functions \(C_X({\mathcal {A}},\lambda )\).^{Footnote 1} The functions in \(C_X({\mathcal {A}},\lambda )\) are Xnonnegative signomials admitting a nonnegativity certificate based on a damped power cone inequality in weights \(\lambda \). Theorem 4.4 shows that every XSAGE function can be written as a sum of \(\lambda \)witnessed AGE functions for Xcircuits \(\lambda \). In proving this, we formalize the connection between conditional SAGE and prior works for global nonnegativity [14, 32, 36]. Theorem 4.4 also motivates a basis identification technique where an approximate relative entropy certificate of \(f \in C_X({\mathcal {A}})\) may be refined by power cone programming. Combining Theorems 3.7 and 4.4 yields a corollary that when X is a polyhedron, cones of XSAGE signomials are (in principle) power cone representable; this generalizes results by several authors in the unconstrained case [2, 26, 33, 41].
Section 5 undertakes a thorough analysis of \(C_X({\mathcal {A}})\). We begin by associating Xcircuits \(\lambda \) with affine functions \(\phi _{\lambda } : {\mathbb {R}}^{{\mathcal {A}}} \rightarrow {\mathbb {R}}\) given by \(\phi _{\lambda }(y) = \sum _{\alpha \in {\mathcal {A}}}y_{\alpha }\lambda _{\alpha } + \sigma _X({\mathcal {A}}\lambda )\). We define the circuitgenerated cone \(G_X({\mathcal {A}})\) as the smallest convex cone containing these functions and the constant function \(y \mapsto 1\). Upon embedding the affine functions on \({\mathbb {R}}^{{\mathcal {A}}}\) into \({\mathbb {R}}^{{\mathcal {A}}} \times {\mathbb {R}}\), Theorem 5.4 provides the following identity between the dual SAGE cone \(C_X({\mathcal {A}})^*\) and the dual circuitgenerated cone \(G_X({\mathcal {A}})^*\)
Qualitatively, Theorem 5.4 says \(C_X({\mathcal {A}})^*\) is not only convex in the classical sense, but also convex under a logarithmic transformation \(S \mapsto \log S = \{ y : \exp y \in S \}\). The property of a set being convex under this logarithmic transformation is known by various names, including log convexity [1], geometric convexity [15, 30], or multiplicative convexity [28]. This property has previously been considered in the literature on ordinary SAGE certificates (i.e., SAGE certificates for the special case \(X={\mathbb {R}}^n\)) [17, 23], but never in such a systematic way as in our analysis. For example, in view of Theorem 5.4 it becomes natural to consider \(\Lambda _X^\star ({\mathcal {A}})\) – the reduced Xcircuits of \({\mathcal {A}}\) – as the normalized circuits \(\lambda \) for which \(\phi _{\lambda }\) generates an extreme ray of the circuitgenerated cone. The property of a circuit being “reduced” in this sense is highly restrictive, and yet (by Theorem 5.5) we can construct \(C_X({\mathcal {A}})\) using only \(\lambda \)witnessed AGE cones as \(\lambda \) runs over \(\Lambda _X^\star ({\mathcal {A}})\). Finally, through a technical lemma (5.14), we show how separating hyperplanes in the space of the dual circuitgenerated cone may be mapped to separating hyperplanes in the exponentiated space of the dual SAGE cone. This lemma has general applications in simplifying systems of certain power cone constraints on the nonnegative orthant; in our context, it serves as the basis for Theorem 5.6, paraphrased below.
If X is a polyhedron and \(C_X({\mathcal {A}})\) consists of more than just posynomials, then
$$\begin{aligned} C_X({\mathcal {A}}) = \sum _{\lambda \in \Lambda ^\star _X({\mathcal {A}})} C_X({\mathcal {A}},\lambda ). \end{aligned}$$Moreover, there is no subset \(\Lambda \subsetneq \Lambda _X^\star ({\mathcal {A}})\) for which \(C_X({\mathcal {A}}) = \sum _{\lambda \in \Lambda } C_X({\mathcal {A}},\lambda )\).
Theorem 5.6 provides the most efficient possible description of \(C_X({\mathcal {A}})\) in terms of power cone inequalities. Its computational implications are addressed briefly in Sect. 7.
Throughout the article we illustrate key concepts with the halfline \(X = [0,\infty )\). Specifically, Example 3.8 addresses the \([0,\infty )\)circuits of a generic point set \({\mathcal {A}}\subset {\mathbb {R}}\), and Example 5.7 covers the corresponding reduced \([0,\infty )\)circuits. This culminates with a complete characterization of the extreme rays of \(C_X({\mathcal {A}})\) for \(X = [0,\infty )\) and \({\mathcal {A}}\subset {\mathbb {R}}\) (Proposition 6.1).
1.2 Related work
Let us begin by introducing some basic concepts from discrete geometry. The circuits of the affinelinear matroid induced by \({\mathcal {A}}\) are the nonzero vectors \(\nu ^\star \in \ker {\mathcal {A}}\subset {\mathbb {R}}^{{\mathcal {A}}}\) whose entries sum to zero, and whose supports are inclusion minimal among all vectors in \(\ker {\mathcal {A}}\) that sum to zero. In the SAGE literature one is interested in simplicial circuits. These are the circuits \(\nu ^\star \) that, upon scaling by a suitable constant, have exactly one negative component. The name simplicial is used here because the convex hull of the support \({{\,\mathrm{supp}\,}}\nu ^\star := \{\alpha \,:\, \nu ^{\star }_{\alpha } \ne 0 \}\) forms a simplex (possibly of low dimension); exactly one element in \({{\,\mathrm{supp}\,}}\nu ^\star \) is contained in the relative interior of this simplex. These simplicial circuits are uniquely determined (up to scaling) by their supports. It is therefore common to call a subset \(A \subset {\mathcal {A}}\) a simplicial circuit if its convex hull forms a simplex and has a relative interior containing exactly one element of A.
To situate conditional SAGE in the literature one should look to the close relatives of ordinary SAGE: the agiforms of Reznick [36], the monomial dominating posynomials of Pantea, Koeppl and Craciun [32], and the SumsofNonnegativeCircuit (SONC) polynomials of Iliman and de Wolff [14]. The latter two works determined necessary and sufficient conditions for \({\mathbb {R}}^n_{+}\) and \({\mathbb {R}}^n\)nonnegativity of polynomials supported on a simplicial circuit, based on power cone inequalities in the polynomial’s coefficients and circuit vector. In our context, key developments in this area include Wang’s discovery of conditions under which a SONC decomposition exists for a given polynomial [40], and Murray, Chandrasekaran, and Wierman’s proof that the cone of SONC polynomials can be represented by a projection of a cone of SAGE signomials [23, §5]. From these results it is now understood that SONC and ordinary SAGE are equivalent to one another for purposes of certain structural analyses. Our results show that the “circuit number” approach of SONC does not generalize to the Xnonnegativity problem in the same manner as SAGE. However, it is possible to describe conditional SAGE in a way which is aesthetically similar to SONC via our \(\lambda \)witnessed AGE cones.
To appreciate the structural results proven for \(C_X({\mathcal {A}})\) in this work, it is useful to mention some analogous results proven in the case \(X = {\mathbb {R}}^n\). As a signomial generalization of an earlier result by Reznick [36], Murray, Chandrasekaran, and Wierman have shown that every signomial which generates an extreme ray of \(C_{{\mathbb {R}}^n}({\mathcal {A}})\) is supported on either a singleton or a simplicial circuit [23]. Curiously, a given signomial f can be extremal in \(C_{{\mathbb {R}}^n}({\mathcal {A}})\) for \({\mathcal {A}}\) as the support of f, and yet nonextremal in \(C_{{\mathbb {R}}^n}({\mathcal {A}}')\) for \({\mathcal {A}}' \supsetneq {\mathcal {A}}\). To account for this, Katthän, Naumann, and Theobald introduced the concept of a reduced circuit, which they used to obtain a complete characterization of the extreme rays of \(C_{{\mathbb {R}}^n}({\mathcal {A}})\) [17]. Subsequently, Forsgård and de Wolff employed regular subdivisions, Adiscriminants and tropical geometry to study how circuits affect the algebraic boundary of the signomial SAGE cone [12]. Our results include direct extensions of the above results by Murray et al. and Katthän et al. to the case of \(X \subsetneq {\mathbb {R}}^n\). For Forsgård and de Wolff’s work, our circuitgenerated cone generalizes their Reznick cone.
Now we turn to how SAGE can be used for optimization. Given a signomial objective f and a convex feasible set X, we have \(\sup \{ \gamma \in {\mathbb {R}}: f  \gamma \text { is } X\text {SAGE}\} {\le \inf _{x \in X}f(x)}\). This procedure has been extended to a convex relaxation hierarchy for which A. Wang et al. have proven a completeness result [39] (see also [6]). Very recently, additional SAGEbased hierarchies have been developed to approach a signomial’s minimum from both above and below, including in the presence of nonconvex constraints [9]. Such techniques can be implemented using the sageopt python package and a reliable exponential cone solver such as MOSEK [5, 21].
On the polynomial optimization side, Karaca et al. developed a combined SAGE and SumsofSquares approach to optimization over (subsets of) the nonnegative orthant [16]. By consideration to the close SAGESONC relationship, one finds connections to works of Dressler et al. on polynomial optimization with SONC [7, 8]. As an alternative to SONC, one may work directly with a notion of SAGE polynomials [23, § 5.1]. The concept of SAGE polynomials is important because the corresponding nonnegativity certificates can be computed efficiently, and because they are transparently generalized to XSAGE polynomials [24, §4]. Our signomial results may be applied to conditional SAGE polynomials, however care must be taken in mapping between the two types of functions; see for example [24, Theorems 1 and 2].
1.3 Some definitions and conventions
Our terminology and notation for convex analysis is generally chosen to match that of Rockafellar [37]. Here we define terms and notation which are less commonly used or which differ from those of [37]; additional standard definitions are reproduced in the Appendix. We abbreviate the line segment connecting x and y in \({\mathbb {R}}^n\) by \([x,y] = \{ \lambda x + (1\lambda )y: 0 \le \lambda \le 1\}\). A convex cone \(K \subset {\mathbb {R}}^n\) is pointed if it contains no lines. A vector v in a convex cone K is called an edge generator if \(\{\lambda v \,:\, \lambda \ge 0\}\) is an extreme ray of K. The polar of a convex cone K is \(K^\circ = K^*\), where \(K^*\) is the dual cone to K. The induced cone of a convex set \(S \subset {\mathbb {R}}^n\) is \({{\,\mathrm{indco}\,}}(S) :={{\,\mathrm{cl}\,}}\{(s,\mu ) \,:\, \mu > 0,\, s/\mu \in S\} \subset {\mathbb {R}}^{n+1}\), and the recession cone is \({{\,\mathrm{rec}\,}}(S) :=\{ t \,:\, \exists s \in S \text { such that } s + \lambda t \in S \; {\forall \, \lambda \ge 0} \}\).
All logarithms are basee, where e is Euler’s number. We extend the scalar exponential function “\(\exp \)” to real vectors in an elementwise fashion. The zero vector and vector of all ones (in appropriate spaces) are denoted and \({\mathbbm {1}}\) respectively. The standard basis for \({\mathbb {R}}^{{\mathcal {A}}}\) is denoted \(\{\delta _{\alpha }\}_{\alpha \in {\mathcal {A}}}\), and the support of a vector \(c \in {\mathbb {R}}^{{\mathcal {A}}}\) is \({{\,\mathrm{supp}\,}}c = \{\alpha :c_{\alpha } \ne 0 \}\).
2 Preliminaries
Throughout this article, \(X \subset {\mathbb {R}}^n\) is closed, convex, and nonempty, and the set \({\mathcal {A}}\subset {\mathbb {R}}^n\) is nonempty and finite. We only consider data \(({\mathcal {A}},X)\) where the functions \(\{ \mathrm{e}^{\alpha } \}_{\alpha \in {\mathcal {A}}}\) are linearly independent on X. The purpose of this linear independence assumption is to ensure the Xnonnegativity cone does not contain a lineality space; equivalently, the assumption ensures the moment cone \({{\,\mathrm{co}\,}}\{ \exp ({\mathcal {A}}^T x) \in {\mathbb {R}}^{{\mathcal {A}}} \,:\, x \in X\}\) is fulldimensional.
Definition 2.1
The XSAGE cone with respect to the support \({\mathcal {A}}\) is the Minkowski sum
where \(C_X({\mathcal {A}},\beta )\) are the XAGE cones defined in (2).
Remark 2.2
In this definition, all the signomials in the decomposition of the right hand side are also restricted to the support \({\mathcal {A}}\). This is no loss of generality, since any signomial f on \({\mathcal {A}}\), which is contained in \(\sum _{{\beta \in {\mathcal {A}}'}} C_X({\mathcal {A}}',\beta )\) for some superset \({\mathcal {A}}'\) of \({\mathcal {A}}\), is also contained in \(\sum _{\beta \in {\mathcal {A}}} C_X({\mathcal {A}},\beta )\), see [24, Corollary 1].
By adopting Definition 2.1, it is clear that the problem of representing \(C_X({\mathcal {A}})\) reduces to the problem of representing the cones \(C_X({\mathcal {A}},\beta )\). To state the representation of these cones we use the relative entropy function
We use standard conventions where relative entropy is continuously extended to \({\mathbb {R}}^{\mathcal {A}}_+ \times {\mathbb {R}}^{\mathcal {A}}_+\), and define \(D(\nu ,c) =\infty \) if either \(\nu \) or c has a negative component.
Proposition 2.3
(Theorem 1 of [24]) A signomial \({f =} \sum _{\alpha \in {\mathcal {A}}} c_\alpha \mathrm{e}^{\alpha }\) belongs to \(C_X({\mathcal {A}},\beta )\) if and only if there exists a vector \(\nu \in {\mathbb {R}}^{\mathcal {A}}\) that satisfies
where again, \(\sigma _X(y) = \sup \{\, y^T x\, :\, x \in X\}\) for \(y\in {\mathbb {R}}^n\). Such a vector \(\nu \) is called a relative entropy certificate for f.
Proposition 2.3 is important for computational optimization. For example, if X is the unit ball in the Euclidean norm, then \(\sigma _X({\mathcal {A}}\nu ) = \Vert {\mathcal {A}}\nu \Vert _2\), and so (3) becomes a mixed relativeentropy and secondordercone inequality. More generally, the formulation is tractable whenever we can efficiently represent the epigraph of the support function of X.
Since the relative entropy condition in Proposition 2.3 is essential for our treatment, we outline its proof. Adopt \(I_X\) as the indicator function of X, with \(I_X(x) = 0\) for \(x\in X\) and \(I_X(x) = \infty \) otherwise. Given \(f = \sum _{\alpha \in {\mathcal {A}}}c_{\alpha }\mathrm{e}^{\alpha }\) with , the primal formulation for Xnonnegativity of f is
The formulation (3) is simply the dual to (4) using the machinery of convex conjugate functions. In particular, the relative entropy certificate \(\nu \) in (3) is the dual variable to the equality constraints in (4).
The larger goal of this article is to reveal additional structure in the XSAGE cones \(C_X({\mathcal {A}})\) that is not immediately apparent from Proposition 2.3. From the case \(X = {\mathbb {R}}^n\), the additional structure concerned the supports of signomials that generate extreme rays of \(C_{{\mathbb {R}}^n}({\mathcal {A}},\beta )\) or \(C_{{\mathbb {R}}^n}({\mathcal {A}})\). In this context it is standard to use the term simplicial circuit in the sense of subsets \(A \subset {\mathcal {A}}\). Specifically, \(A \subset {\mathcal {A}}\) is a simplicial circuit if it is a minimal affinely dependent set and \({{\,\mathrm{conv}\,}}A\) has \(A1\) extreme points. This definition of circuits in terms of these subsets \(A \subset {\mathcal {A}}\) is equivalent to the definition involving numeric vectors \(\nu ^\star \in {\mathbb {R}}^{{\mathcal {A}}}\); see [12].
Proposition 2.4
(Theorem 5 of [23]) Let \(\beta \in {\mathcal {A}}\). A signomial \(f = \sum _{\alpha \in {\mathcal {A}}} c_\alpha \mathrm{e}^{\alpha }\) belongs to \(C_{{\mathbb {R}}^n}({\mathcal {A}},\beta )\) if and only if it can be written as a finite sum \(f = \sum _{i=1}^k f^{(i)}\) of signomials
such that the supports \(\{ \alpha \in {\mathcal {A}}: c^{(i)}_{\alpha } \ne 0 \}\) are either singletons or simplicial circuits.
Of course, in view of Definition 2.1, Proposition 2.4 tells us every \(f \in C_{{\mathbb {R}}^n}({\mathcal {A}})\) similarly decomposes into AGE functions supported on singletons and simplicial circuits.
Revealing the full structure of conditional SAGE cones requires consideration to more than just a signomial’s support. Therefore, thinking in terms of affinelinear circuits as subsets \(A \subset {\mathcal {A}}\) will not suit our purposes. The following definition codifies our convention of considering affinelinear circuits as numeric vectors.
Definition 2.5
A nonzero vector \(\nu ^\star \in \{\nu \in {\mathbb {R}}^{{\mathcal {A}}} \, : \, {\mathbbm {1}}^T \nu = 0 \}\) in the kernel of the linear operator \(\nu \mapsto {\mathcal {A}}\nu = \sum _{\alpha \in {\mathcal {A}}} \alpha \nu _{\alpha }\) is called an \({\mathbb {R}}^n\)circuit if it is minimally supported and has exactly one negative component.
It is possible that a given \({\mathcal {A}}\) has no \({\mathbb {R}}^n\)circuits, but then every \(\alpha \in {\mathcal {A}}\) would be an extreme point of \({{\,\mathrm{conv}\,}}{\mathcal {A}}\). This is a degenerate case that results in \(C_{{\mathbb {R}}^n}({\mathcal {A}})\) containing only posynomials, but we still give consideration to this possibility throughout the article. In the language of Definition 2.5, we combine Propositions 2.3 and 2.4 to obtain the following formulation.
Proposition 2.6
(Theorem 4.4 of [12]) Let \(\beta \in {\mathcal {A}}\). A signomial \(f = \sum _{\alpha \in {\mathcal {A}}} c_\alpha \mathrm{e}^{\alpha }\) belongs to \(C_{{\mathbb {R}}^n}({\mathcal {A}},\beta )\) if and only if there exist \(k \ge 0\) and signomials \( f^{(i)} \ = \ \sum _{\alpha \in {\mathcal {A}}} c^{(i)}_\alpha \mathrm{e}^{\alpha } \in C_{{\mathbb {R}}}({\mathcal {A}},\beta ), \quad 1 \le i \le k, \) with \(f = \sum _{i=1}^k f^{(i)}\) and such that for any signomial \(f^{(i)}\) which is not supported on a singleton, there exists an \({\mathbb {R}}^n\)circuit \(\nu ^{(i)} \in {\mathbb {R}}^{\mathcal {A}}\) with \(D(\nu ^{(i)}_{{{\setminus }}\beta },e c^{(i)}_{{\setminus } \beta }) \le c^{(i)}_\beta .\)
3 Sublinear circuits induced by a point set
We begin this section with a functional analytic definition for the Xcircuits of a point set \({\mathcal {A}}\), generalizing \({\mathbb {R}}^n\)circuits to a constrained setting. After revealing various elementary properties and discussing some examples, we characterize Xcircuits in more geometric terms in Theorems 3.6 and 3.7. In particular the latter theorem interprets Xcircuits in terms of normal fans when X is a polyhedron. In Example 3.8, we determine the \([0,\infty )\)circuits of a univariate support set \({\mathcal {A}}\subset {\mathbb {R}}\); the example is developed further in Sect. 5 and culminates in a theorem completely characterizing the extreme rays of the resulting XSAGE cone \(C_{[0,\infty )}({\mathcal {A}})\) in Sect. 6.
The derivations in this section are purely combinatorial and convexgeometric, and make no mention of signomials. However, the definition of Xcircuits is ultimately chosen to prepare for studying XSAGE cones, and in particular it relates to distinguished vectors \(\nu \in {\mathbb {R}}^{{\mathcal {A}}}\) that might satisfy (3) for certain \(c \in {\mathbb {R}}^{{\mathcal {A}}}\). Note that (3) has an implicit constraint arising from our extendedrealvalued definition of relative entropy. To avoid dependence on relative entropy in this section, we frame our discussion of Xcircuits in terms of cones
for vectors \(\beta \in {\mathcal {A}}\).
Definition 3.1
A vector \(\nu ^\star \in N_\beta \) is an Xcircuit of \({\mathcal {A}}\) (or simply, an Xcircuit) if (1) it is nonzero, (2) \(\sigma _X({\mathcal {A}}\nu ^\star ) < \infty \), and (3) it cannot be written as a convex combination of two nonproportional \(\nu ^{(1)},\nu ^{(2)} \in N_\beta \), for which \(\nu \mapsto \sigma _X({\mathcal {A}}\nu )\) is linear on \([\nu ^{(1)},\nu ^{(2)}]\).
The third condition is equivalent to strict sublinearity of \(\nu \mapsto \sigma _X({\mathcal {A}}\nu )\) on any line segment in \(N_{\beta }\) that contains \(\nu ^\star \), except for the trivial line segments which generate a single ray. The central importance of the sublinearity condition leads us to refer to Xcircuits also as sublinear circuits; the latter term is helpful in remembering the definition early in our development.
Remark 3.2
In the special case \(X={\mathbb {R}}^n\), condition (2) simplifies to . In conjunction with the definition of \(N_{\beta }\), this shows that the special case \(X={\mathbb {R}}^n\) of Definition 3.1 matches exactly with Definition 2.5 of \({\mathbb {R}}^n\)circuits.
Conceptually, Definition 3.1 indicates that Xcircuits are essential in capturing the behavior of the augmented support function \(\nu \mapsto \sigma _X({\mathcal {A}}\nu )\) on the given \(N_{\beta }\). While developing this concept formally it is convenient for us to enumerate \(\nu ^+ :=\{ \alpha \,:\, \nu _\alpha > 0 \}\), and to identify the unique index \(\nu ^ :=\beta \in {\mathcal {A}}\) where \(\nu _\beta < 0\). Note that positive homogeneity of the support function tells us that the property of being a sublinear circuit is invariant under scaling by positive constants. A sublinear circuit is normalized if its unique negative term \(\nu _{\beta }\) has \(\nu _{\beta } = 1\), in which case we usually denote it by the symbol \(\lambda \) rather than \(\nu \). We can normalize a given sublinear circuit by taking the ratio with its infinity norm \(\lambda = \nu / \Vert \nu \Vert _{\infty }\), because \(\Vert \nu \Vert _{\infty }=\nu _\beta \) for all vectors \(\nu \in N_{\beta }\).
Example 3.3
(The conic case) It is straightforward to determine which \(\nu \in N_\beta \) are Xcircuits of \({\mathcal {A}}\) when X is a cone. In such a setting, the support function of X can only take on the values zero and positive infinity. Hence, \(\nu \mapsto \sigma _X({\mathcal {A}}\nu )\) is trivially linear over all of \(V_\beta :=\{ \nu \in N_\beta \,:\, \sigma _X({\mathcal {A}}\nu ) < \infty \}\). Notice that \(V_{\beta }\) is a cone and that \(\sigma _X({\mathcal {A}}\nu ) = 0\) may be reformulated as \(\nu \in ({\mathcal {A}}^T X)^*\). Standard conic duality calculations (see Proposition 8.3) show that \(({\mathcal {A}}^T X)^* = \ker {\mathcal {A}}+ {\mathcal {A}}^\dagger X^*\), where \({\mathcal {A}}^\dagger \) denotes the MoorePenrose pseudoinverse of \({\mathcal {A}}\). Thus
and the Xcircuits \(\nu \in N_{\beta }\) are precisely the edge generators of \(V_{\beta }\).
Regarding again the special case \(X={\mathbb {R}}^n\) from this conic perspective, we have , so , and \(\ker {\mathcal {A}}+ {\mathcal {A}}^{\dagger } X^* = \ker {\mathcal {A}}\), which implies \(V_\beta = \ker {\mathcal {A}}\cap N_\beta \). It is easily shown that edge generators of \(\ker {\mathcal {A}}\cap N_\beta \) are precisely those for which \(\nu ^+ =\{\alpha \,:\, \nu _\alpha > 0\}\) are affinely independent, which recovers the matroidtheoretic notion of affinelinear simplicial circuits from the point of view of subsets \(A \subset {\mathcal {A}}\).
The following proposition shows that the affineindependence property is a necessary condition for all sublinear circuits. The proposition provides insight because it shows an Xcircuit \(\nu \) with \(X \subset {\mathbb {R}}^n\) is restricted to \({{\,\mathrm{supp}\,}}\nu  \le n+2\).
Proposition 3.4
If \(\nu ^\star \in N_\beta \) is an Xcircuit, then \((\nu ^\star )^+ = {{\,\mathrm{supp}\,}}\nu ^\star {\setminus } \beta \) is affinely independent.
Proof
From a fixed \(\nu ^\star \in N_\beta \) construct \(z = {\mathcal {A}}\nu ^\star \) and \(U = \{ \nu \in N_\beta \,:\, {\mathcal {A}}\nu = z,\, \nu _\beta = \nu ^\star _\beta \}\). The function \(\nu \mapsto \sigma _X({\mathcal {A}}\nu )\) is a constant and equal to \(\sigma _X(z)\) on U, and so in order for \(\nu ^\star \) to be an Xcircuit, it must be a vertex of the polytope U. The set U is in 1to1 correspondence with \(W=\{ w \in {\mathbb {R}}^{{\mathcal {A}}{\setminus } \beta }_{+} \,:\, \sum _{\alpha \in {\mathcal {A}}{\setminus } \beta }(\beta \alpha ) w_\alpha = z,\, \mathbbm {1}^T w =\nu ^\star _\beta \}\) by identifying \(w = \nu _{{\setminus } \beta }\). In matrix notation, we can write \(W = \{ w \in {\mathbb {R}}^{{\mathcal {A}}{\setminus }\beta }_+ \,:\, M w = (z,\nu _{\beta }^\star )\}\) by forming the matrix M with columns \(\{ (\beta \alpha , 1) \}_{\alpha \in {\mathcal {A}}{\setminus }\beta }\) indexed by \(\alpha \in {\mathcal {A}}{\setminus }\beta \).
Basic polyhedral geometry tells us that all vertices \(w^\star \) of W use an affinely independent set of columns from M. Furthermore, a given set of columns from M is affinely independent if and only if the corresponding indices of the columns (as vectors \(\alpha \in {\mathcal {A}}{\setminus }\beta \)) are affinely independent. Since the correspondence between \(\nu \in U\) and \(w \in W\) preserves extremality, the vertices of U have affinely independent positive support \(\nu ^+\). \(\square \)
The converse of Proposition 3.4 is not true. This is to say: not every vector \(\nu \in N_{\beta }\) with affinely independent \(\nu ^+\) is an Xcircuit.
Example 3.5
Let \({\mathcal {A}}\subset {\mathbb {R}}^2\) contain \(\alpha _1 = (0, 0)\), \(\alpha _2 =(1,0)\), and \(\alpha _3 = (0,1)\), and consider \(X = \{ x \in {\mathbb {R}}^2 \ : \ x \ge u\}\) for some fixed point \(u \in {\mathbb {R}}^2\). The vector \(\nu ^\star = (2,1,1)\) has \((\nu ^\star )^ = \alpha _1 = (0,0)\), and \((\nu ^\star )^+ = \{\alpha _2,\alpha _3\} = \{(1,0),(0,1)\}\) is affinely independent. Considering \(\nu ^{(1)} = (2,2,0)\) and \(\nu ^{(2)} = (2,0,2)\), we have \(\nu ^\star =\frac{1}{2}(\nu ^{(1)}+\nu ^{(2)}) \in {{\,\mathrm{ri}\,}}L\) for \(L :=[\nu ^{(1)},\nu ^{(2)}]\). Moreover, the mapping \(\nu \mapsto \sigma _X({\mathcal {A}}\nu )\) is linear on L, because for any \(\mu _1, \mu _2 \ge 0\) with \(\mu _1+\mu _2 = 1\) we have
The last equality is true since (1, 1) maximizes both the objective functions \(x \mapsto (2\mu _1,0)^T x\) and \(x \mapsto (0,2\mu _2)^T x\) on X.
With the basic exercise of Example 3.5 complete, we turn to characterizing sublinear circuits in full generality.
Theorem 3.6
Fix \(\beta \in {\mathcal {A}}\). The convex cone generated by
is pointed (i.e., it contains no lines) and closed. A vector \(\nu ^\star \in N_\beta \) is an Xcircuit of \({\mathcal {A}}\) if and only if \((\nu ^\star , \sigma _X({\mathcal {A}}\nu ^\star ))\) is an edge generator for \({{\,\mathrm{co}\,}}T\).
Proof
Let Q denote the closed convex set \(Q = \{ \nu \,:\, \nu \in N_\beta ,\, \sigma _X({\mathcal {A}}\nu ) < \infty \}\). The claim of the theorem is trivially true if , in which case there are no Xcircuits \(\nu \in N_\beta \) and has no extreme rays. We therefore assume for the duration of the proof that Q contains a nonzero vector.
We turn to showing \({{\,\mathrm{co}\,}}T\) is closed and pointed, particularly beginning with pointedness. For this, observe \({{\,\mathrm{co}\,}}T \subset N_\beta \times {\mathbb {R}}\). Since \(N_\beta \) contains no lines, there are no lines in \({{\,\mathrm{co}\,}}T\) of the form \((\nu ,\tau )\) with . Meanwhile, we know that the line spanned by cannot be contained in \({{\,\mathrm{co}\,}}T\), since . Now we turn to closedness of \({{\,\mathrm{co}\,}}T\). Since Q is contained within \(N_\beta \), we may normalize Q against \(\{ \nu \,:\, \nu _\beta =1\}\): \(Q = {{\,\mathrm{co}\,}}Q_1\) for the nonempty compact convex set \(Q_1 :=\{ \lambda \,:\, \lambda \in Q, \lambda _\beta = 1\}\). From \(Q_1\) we construct \(T_1 = \{ (\lambda ,\sigma _X({\mathcal {A}}\lambda )) \,:\, \lambda \in Q_1 \}\). The set \(T_1\) inherits compactness from \(Q_1\) (by continuity of \(\lambda \mapsto \sigma _X({\mathcal {A}}\lambda )\)), and the convex hull \(T_2 = {{\,\mathrm{conv}\,}}T_1\) inherits compactness from \(T_1\) (as the convex hull of a compact set is compact). It is evident that \(T_2\) does not contain the zero vector, and so by [37, Corollary 9.6.1] we have that \({{\,\mathrm{co}\,}}T_2\) is closed. We finish this phase of the proof by identifying \({{\,\mathrm{co}\,}}T ={{\,\mathrm{co}\,}}T_2\).
At this point we have that \({{\,\mathrm{co}\,}}T\) is the convex hull of its extreme rays; it remains to determine the nature of these extreme rays. Since T is a generating set for \({{\,\mathrm{co}\,}}T\) and contains only vectors of the form \((\nu ,\sigma _X({\mathcal {A}}\nu ))\), every edge generator of \({{\,\mathrm{co}\,}}T\) is given by a nonzero vector \((\nu ^\star ,\sigma _X({\mathcal {A}}\nu ^\star ))\) for appropriate \(\nu ^\star \). It is clear that \(\nu ^\star \) must be an Xcircuit in order for \((\nu ^\star ,\sigma _X({\mathcal {A}}\nu ^\star ))\) to be an edge generator of \({{\,\mathrm{co}\,}}T\). The harder direction is to show that \(\nu ^\star \) being an Xcircuit is sufficient for \((\nu ^\star ,\sigma _X({\mathcal {A}}\nu ^\star ))\) to be an edge generator for \({{\,\mathrm{co}\,}}T\).
To handle this direction, begin by defining an affinely independent set \({\mathcal {V}} = \{ \nu ^{(i)} \}_{i=1}^\ell \) and a vector \(\theta \) in the relative interior of \(\Delta _\ell :=\{ z \in {\mathbb {R}}^\ell _+ \,:\, \mathbbm {1}^T z = 1 \}\), where \(\nu ^\star =\sum _{i=1}^\ell \theta _i \nu ^{(i)}\) and
We claim that \(\nu \mapsto \sigma _X({\mathcal {A}}\nu )\) is linear on the entirety of \({{\,\mathrm{conv}\,}}{\mathcal {V}}\). To see why, note that the assumption on \(\nu ^\star \) relative to \({\mathcal {V}}\) means the elements of \(\Phi :=\{ (\nu ^{(i)},\sigma _X({\mathcal {A}}\nu ^{(i)})) \,:\, i \in [\ell ]\cup \{\star \} \}\) lie on a common hyperplane on the boundary of the epigraph \(H = \{ (\nu ,t) \,:\, \sigma _X({\mathcal {A}}\nu ) \le t \}\). Since \(\nu \mapsto \sigma _X({\mathcal {A}}\nu )\) is convex, H is a convex set, and there is some proper face F of H which contains \(\Phi \). It is evident that \(\nu \mapsto \sigma _X({\mathcal {A}}\nu )\) is linear on the projection of that face \(\hat{F} = \{ \nu \,:\, \exists t \in {\mathbb {R}}\, \; (\nu ,t) \in F \}\). Since \({{\,\mathrm{conv}\,}}{\mathcal {V}} \subset \hat{F}\), this proves our claim regarding linearity of \(\nu \mapsto \sigma _X({\mathcal {A}}\nu )\) on \({{\,\mathrm{conv}\,}}{\mathcal {V}}\).
By the above argument: if \(\nu ^\star \) is an Xcircuit, then for every \(\theta \in {{\,\mathrm{ri}\,}}\Delta _\ell \) and affinely independent \({\mathcal {V}} = \{ \nu ^{(i)} \}_{i=1}^\ell \subset N_\beta \) with \({{\,\mathrm{co}\,}}{\mathcal {V}} \ne {{\,\mathrm{co}\,}}\{ \nu ^\star \}\), we have
From Carathéodory’s Theorem, restricting to affinely independent \({\mathcal {V}} \subset T\) is sufficient to test extremality in \({{\,\mathrm{co}\,}}T\). Therefore, every circuit \(\nu ^\star \in N_\beta \) induces an edge generator for \({{\,\mathrm{co}\,}}T\). \(\square \)
When considering the set “T” in Theorem 3.6, it is natural to expect that for polyhedral X there are only finitely many extreme rays in the cone \({{\,\mathrm{co}\,}}T\), and hence only finitely many normalized Xcircuits. The remainder of this section serves to prove this fact; here we use the concept of normal fans from polyhedral geometry. See, e.g., [43, Chapter 7] (for the bounded case of polytopes), [13, Section 5.4] or [38, Chapter 2]. For each face F of a polyhedron P, there is an associated outer normal cone
Clearly, the support function of a polyhedron P is linear on every outer normal cone, and in particular the linear representation may be given by \(\sigma _P(w) = z^T w\) for any \(z \in F\). We obtain the outer normal fan of P by collecting all outer normal cones:
The support of \({\mathcal {O}}(P)\) is the polar \({{\,\mathrm{rec}\,}}(P)^{\circ }\). The fulldimensional linearity domains of the support function are the outer normal cones of the vertices of P (see also [11, Section 1]).
Theorem 3.7
If X is polyhedral, then is an Xcircuit if and only if \({{\,\mathrm{co}\,}}\{\nu \}\) is a ray in \({\mathcal {O}}({\mathcal {A}}^T X + N_{\beta }^\circ )\). Consequently, a polyhedral set X has finitely many normalized circuits.
Proof
Let \(P = {\mathcal {A}}^T X + N_\beta ^\circ \). Using the characterization in [37, Theorem 14.2], the polar of its recession cone can be expressed as
where we have also used the property \(\sigma _X({\mathcal {A}}\nu ) = \sup _{x \in X} ({\mathcal {A}}\nu )^T x = \sup _{x \in {\mathcal {A}}^T X} \nu ^T x = \sigma _{{\mathcal {A}}^T X}(\nu ). \) In particular, this also gives \(\sigma _X({\mathcal {A}}\nu ) = \sigma _P(\nu )\). From P construct the outer normal fan \({\mathcal {O}} :={\mathcal {O}}(P)\). We claim that \({{\,\mathrm{co}\,}}\{\nu \}\) is a ray in \({\mathcal {O}}\).
It is clear that if a cone \(K \in {\mathcal {O}}\) is associated to a face F of P, then we may express \(\sigma _P(\nu ) = z^T \nu \) for any \(z \in F\), and so \(\sigma _P(\nu ) \equiv \sigma _X({\mathcal {A}}\nu )\) is linear on K. Since the support of \({\mathcal {O}}\) is \({{\,\mathrm{rec}\,}}(P)^{\circ }\), the cones \(K \in {\mathcal {O}}\) partition \(({{\,\mathrm{rec}\,}}P)^\circ \), i.e.,
and if \(K,K'\) are distinct elements in \({\mathcal {O}}\), then \({{\,\mathrm{ri}\,}}K \cap {{\,\mathrm{ri}\,}}K' = \emptyset \). Therefore, every for which \(\sigma _X({\mathcal {A}}\nu ) <\infty \) is associated with a unique \(K \in {\mathcal {O}}\), by way of \(\nu \in {{\,\mathrm{ri}\,}}K\).
Fix \(\nu \in ({{\,\mathrm{rec}\,}}P)^\circ \), and let K be the associated element of \({\mathcal {O}}\) that contains \(\nu \) in its relative interior. If K is of dimension greater than 1, \(\nu \) can be expressed as a convex combination of nonproportional \(\nu ^{(1)},\nu ^{(2)} \in K\) – and clearly \({\bar{\nu }} \mapsto \sigma _X({\mathcal {A}}{\bar{\nu }}) \equiv \sigma _P({\bar{\nu }})\) would be linear on the interval \([\nu ^{(1)},\nu ^{(2)}]\). Thus for \(\nu \) to be an Xcircuit, it is necessary that K be of dimension 1. Since P is a polyhedron, \({\mathcal {O}}\) is induced by finitely many faces. Thus there are finitely many \(K \in {\mathcal {O}}\) with \(\dim K = 1\) and in turn finitely many normalized Xcircuits of \({\mathcal {A}}\).
Conversely, let and \({{\,\mathrm{co}\,}}\{\nu ^\star \}\) be a ray in \({\mathcal {O}}\). Since \({\mathcal {O}}\) is supported on \({{\,\mathrm{rec}\,}}(P)^{\circ }\), we have \(\sigma _X( {\mathcal {A}}{\nu ^\star }) = \sigma _P({\nu ^\star }) < \infty \).
Let \(\nu ^{(1)}, \nu ^{(2)} \in N_{\beta }\) be nonproportional and \(\tau \in (0,1)\) satisfy \(\nu ^\star = \tau \nu ^{(1)} + (1\tau ) \nu ^{(2)}\). If \(\nu ^{(1)}\) or \(\nu ^{(2)}\) is outside of \({{\,\mathrm{rec}\,}}(P)^{\circ }\), say, \(\nu ^{(1)}\), then \(\sigma _X({\mathcal {A}}\nu ^{(1)}) = \infty \) and thus the mapping \(\nu \mapsto \sigma _X({\mathcal {A}}\nu )\) cannot be linear on \([\nu ^{(1)}, \nu ^{(2)}]\). Hence, we can assume that \(\nu ^{(1)}, \nu ^{(2)} \in {{\,\mathrm{rec}\,}}(P)^{\circ }\).
We have to show that the mapping
is not linear.
Consider the restriction of the fan \({\mathcal {O}}\) to the cone \(C := {{\,\mathrm{co}\,}}\{\nu ^{(1)}, \nu ^{(2)} \}\), that is, the collection of all the cones in \(\{{\mathsf {N}}_P(F) \cap C \, : \, F {\text { is a face of }} P\}\). This is a fan \({\mathcal {O}}'\) supported on the twodimensional cone \(S := {{\,\mathrm{rec}\,}}(P)^{\circ } \cap C\). On the set S, we consider the restricted mapping \((\sigma _P)_{S} \, : \, S \rightarrow {\mathbb {R}}\), \(w \mapsto \sigma _P(w)\). The linearity domains of \((\sigma _P)_S\) are the twodimensional cones in \({\mathcal {O}}'\). Since \({{\,\mathrm{co}\,}}\{{v^\star }\}\) is a ray in the fan \({\mathcal {O}}\) and thus also in the fan \({\mathcal {O}}'\), the vectors \({\nu ^{(1)}}\) and \({\nu ^{(2)}}\) are contained in different twodimensional cones of the fan \({\mathcal {O}}'\). Hence, the mapping g is not linear. Altogether, this shows that \(\nu ^\star \) is an Xcircuit. \(\square \)
Example 3.8
We consider as a running example the onedimensional case of \(X = [0,\infty )\) and \({\mathcal {A}} = \{\alpha _1, \ldots , \alpha _m \} \subset {\mathbb {R}}\) where we can assume \(\alpha _1< \cdots < \alpha _m\). In this running example we index by integers \(i \in [m] := \{1,\ldots ,m\}\) rather than by elements \(\alpha \in {\mathcal {A}}\). Therefore we identify \({\mathbb {R}}^{{\mathcal {A}}}\) with \({\mathbb {R}}^m\) and use \(\delta _i\) for the \(i^{\text {th}}\) unit vector in \({\mathbb {R}}^m\) (for each \(i \in [m]\)). Under these conventions, \({\mathcal {A}}\) is regarded as a row vector in \({\mathbb {R}}^{1 \times m}\) and \({\mathcal {A}}^T = (\alpha _1,\ldots ,\alpha _m)\) is a column vector in \({\mathbb {R}}^{m}\). We claim that the normalized Xcircuits \(\lambda \in {\mathbb {R}}^m\) are the vectors either of the form (1) \(\lambda = \delta _k  \delta _j\) for \(j < k\) or of the form (2)
Note that vectors of type (2) satisfy \({\mathcal {A}}\lambda = 0\), and in fact are the unique such vectors that also satisfy \({{\,\mathrm{supp}\,}}\lambda = \{i,j,k\}\), \(\lambda _j = 1\), \(\lambda _i,\lambda _k > 0\), \(\mathbbm {1}^T \lambda = 0\).
To derive this claim we consider for fixed \(j \in [m]\) the polyhedron \(P = {\mathcal {A}}^T X + N_{j}^{\circ }\) from Theorem 3.7. It is evident that this polyhedron is a cone, that may be expressed as
The rays of its normal fan are the extreme rays of its polar
Note here that this gives us exactly the set “Q” from the proof of Theorem 3.6. This happens because X is conic and hence the support function \(\sigma _X({\mathcal {A}}\nu )\) evaluates to zero for every Xcircuit \(\nu \). By Proposition 3.4, each Xcircuit in \(N_{j}\) has at most three nonvanishing components \(\nu _i, \nu _j, \nu _k\), and, moreover, it has \(m2\) of the inequalities in (6) binding. If all those binding inequalities are of the form \(\nu _{\ell } \ge 0\), then with \(\sigma _X({\mathcal {A}}\nu )<\infty \), we obtain the normalized Xcircuits of \({\mathcal {A}}\) of type (1). Now assume that the inequality \((\alpha _1, \ldots , \alpha _m)^T \nu \le 0\) is binding for some normalized Xcircuit \(\nu \) of \({\mathcal {A}}\). Since the sign pattern \((,+,+)\) for \((\nu _i,\nu _j,\nu _k)\) in conjunction with \(\mathbbm {1}^T \nu = 0\) leads to \((\alpha _1, \ldots , \alpha _m)^T \nu < 0\), and the sign pattern \((+,+,)\) contradicts the Xcircuit condition \(\sigma _X({\mathcal {A}}\nu )<\infty \), we obtain the normalized Xcircuits of \({\mathcal {A}}\) of type (2).
For the example classes of the nonnegative orthant and the cube \([1,1]^n\), we refer the reader to [27].
4 Sublinear circuits in AGE cones
In this section, we show how the XAGE cones \(C_X({\mathcal {A}},\beta )\) can be further decomposed using sublinear circuits. These decompositions lay the foundation to understand the extreme rays of the conditional SAGE cone \(C_X({\mathcal {A}})\). Our first result here is a necessary criterion for an XAGE function f to be extremal in \(C_X({\mathcal {A}},\beta )\), which states that all of its relative entropy certificates must be Xcircuits (see Theorem 4.2). Definition 4.3 introduces \(\lambda \)witnessed AGE cones as the subset of signomials in \(C_{{X}}({\mathcal {A}},\beta )\) whose nonnegativity is certified by a given normalized vector \(\lambda \). Theorem 4.4 then decomposes \(C_X({\mathcal {A}},\beta )\) through the \(\lambda \)witnessed AGE cones, where \(\lambda \) is a normalized Xcircuit. As a consequence, for polyhedral X, the cone \(C_X({\mathcal {A}},\beta )\) is powercone representable (see Corollary 4.5).
In the last part of this section we prove two propositions on explicit representations for primal and dual \(\lambda \)witnessed AGE cones. Proposition 4.7 in particular is very important for a characterization of dual XSAGE cones, as it reveals a multiplicative convexity property used extensively in Sect. 5.
The following lemma provides a construction to decompose an XAGE function into simpler summands, under a local linearity condition on the support function \(\nu \mapsto \sigma _X({\mathcal {A}}\nu )\).
Lemma 4.1
Let \(f = \sum _{\alpha \in {\mathcal {A}}} c_\alpha \mathrm{e}^{\alpha }\) be XAGE with negative term \(c_\beta < 0\). If \(\nu \) is a relative entropy certificate for f which can be written as a convex combination \(\nu = \sum _{i=1}^k \theta _i \nu ^{(i)}\) of nonproportional \(\nu ^{(i)} \in N_{\beta }\) and \(\tilde{\nu } \mapsto \sigma _X({\mathcal {A}}\tilde{\nu })\) is linear on \({{\,\mathrm{conv}\,}}\{\nu ^{(i)}\}_{i=1}^k\), then f is not extremal in \(C_X({\mathcal {A}},\beta )\).
Proof
Construct vectors \(c^{(i)}\) by
and \(c^{(i)}_\beta = \sigma _X({\mathcal {A}}\nu ^{(i)}) +D(\nu ^{(i)}_{{\setminus } \beta }, e c^{(i)}_{{\setminus } \beta })\). These \(c^{(i)}\) define XAGE signomials by construction, and they inherit nonproportionality from the \(\nu ^{(i)}\). We need to show that \(\sum _{i=1}^k \theta _i c^{(i)} \le c\), which will establish that f can be decomposed as a sum of these nonproportional XAGE functions (possibly with an added posynomial).
For indices \(\alpha \in \nu ^+\), the construction (7) relative to \(\nu \) and \(\{\nu ^{(i)}\}_{i=1}^k\) actually ensures \(\sum _{i=1}^k \theta _i c^{(i)}_\alpha = c_\alpha \). For indices \(\alpha \in {{\,\mathrm{supp}\,}}c {\setminus } {{\,\mathrm{supp}\,}}\nu \) we have \(\sum _{i=1}^k \theta _i c^{(i)}_\alpha =0 \le c_\alpha \). The definitions of \(\nu ^{(i)}\) ensure
Meanwhile, (7) provides \(\nu ^{(i)}_\alpha /c^{(i)}_\alpha = \nu _\alpha / c_\alpha \), which may be combined with \(\sum _{i=1}^k \theta _i \nu ^{(i)}_\alpha =\nu _\alpha \; \forall \; \alpha \in {\mathcal {A}}\) to deduce
We combine (8) and (9) to obtain the desired result
\(\square \)
Theorem 4.2
Let \(f = \sum _{\alpha \in {\mathcal {A}}} c_\alpha \mathrm{e}^{\alpha }\) be XAGE with negative term \(c_\beta < 0\). If f has a relative entropy certificate which is not an Xcircuit, then f is not extremal in \(C_X({\mathcal {A}},\beta )\).
Proof
If f is an XAGE function with \(c_\beta < 0\) and \(\nu \) satisfies (3), then we must have and \(\sigma _X({\mathcal {A}}\nu ) < \infty \). By the definition of an Xcircuit, \(\nu \) may be written as a convex combination \(\nu =\theta \nu ^{(1)} + (1\theta )\nu ^{(2)}\) where \(\bar{\nu } \mapsto \sigma _X({\mathcal {A}}\bar{\nu })\) is linear on \([\nu ^{(1)},\nu ^{(2)}]\), and furthermore the \(\nu ^{(i)}\) are not proportional. We can therefore invoke Lemma 4.1 to prove the claim. \(\square \)
In the remainder of this section we eliminate the degree of freedom associated with \(\nu \) laying on a ray. For each \(\beta \in {\mathcal {A}}\), we introduce the following notation for the associated set of normalized Xcircuits of \({\mathcal {A}}\)
The set of all normalized Xcircuits of \({\mathcal {A}}\) is denoted \(\Lambda _X({\mathcal {A}})\). The main reason for introducing this notation is how it interacts with the following definition.
Definition 4.3
Given a vector \(\lambda \in N_{\beta }\) with \(\lambda _{\beta } = 1\), the \(\lambda \)witnessed AGE cone is
We show below that every signomial in \(C_X({\mathcal {A}},\lambda )\) is nonnegative on X. The term “witnessed” in “\(\lambda \)witnessed AGE cone” is chosen to reflect the defining role of \(\lambda \) in the nonnegativity certificate. We only use \(\lambda \)witnessed AGE cones for theoretical purposes, and only with \(\lambda \in \Lambda _X({\mathcal {A}})\). Possible computational uses (particularly with \(\lambda \not \in \Lambda _X({\mathcal {A}})\)) are offered in Sect. 7.
Theorem 4.4
Let \(\Lambda _X({\mathcal {A}})\ne \emptyset \). The cone \(C_X({\mathcal {A}},\beta )\) can be written as the convex hull of \(\lambda \)witnessed AGE cones, where \(\lambda \) runs over the normalized Xcircuits, that is,
Note here that for any \(\beta \in {\mathcal {A}}\) and (normalized) \(\lambda \in N_{\beta }\), we have \({\mathbb {R}}^{{\mathcal {A}}}_+ \subset C_X({\mathcal {A}},\lambda )\).
Proof
Theorem 4.2 already tells us that for \(\Lambda _X({\mathcal {A}})\ne \emptyset \), \(C_X({\mathcal {A}},\beta )\) may be expressed as the convex hull of XAGE functions \(f = \sum _{\alpha \in {\mathcal {A}}} c_\alpha \mathrm{e}^{\alpha }\) which have Xcircuits as relative entropy certificates. Therefore it suffices to show that (i) for any such function, the normalized Xcircuit \(\lambda = \nu / \nu _{\beta }\) is such that \((c,\lambda )\) satisfy the condition in (10), and (ii) if any \((c,\lambda )\) satisfy (10), then the resulting signomial is nonnegative on X. We will actually do both of these in one step.
Suppose \(\nu \in N_\beta \) is restricted to satisfy \(\nu = s \lambda \) for a variable \(s \ge 0\) and a fixed \(\lambda \in \Lambda _X({\mathcal {A}},\beta )\). It suffices to show that the set of \(c \in {\mathbb {R}}^{{\mathcal {A}}}\) for which
is the same as (10).
Let \(r(\nu ) = \sigma _X({\mathcal {A}}\nu ) + D(\nu _{{\setminus }\beta },e c_{{\setminus }\beta })\). Apply positive homogeneity of the support function to see \(\sigma _X({\mathcal {A}}\nu ) = \nu _{\beta } \sigma _X({\mathcal {A}}\nu /\nu _{\beta })\), and use \(\nu = s \lambda \) to infer \(s=\nu _{\beta }\) and \(\sigma _X({\mathcal {A}}\nu / \nu _{\beta }) =\sigma _X({\mathcal {A}}\lambda )\). Abbreviate \(d := \sigma _X({\mathcal {A}}\lambda )\) and substitute \(\sum _{\alpha \in \lambda ^+}\nu _{\alpha } =\nu _{\beta }\) to obtain
The term d may be moved into the logarithm by identifying \(\nu _\alpha d = \nu _\alpha \log (1 / \exp (d))\). For \(\alpha \in \lambda ^+\) we define scaled terms \(\tilde{c}_\alpha = c_\alpha \exp (d)\), so that \(r(\nu ) = \sum \nolimits _{\alpha \in \lambda ^+} \nu _\alpha \log (\nu _\alpha / \tilde{c}_\alpha )  \nu _\alpha \). By Proposition 8.1, there exists a \(\nu =s \lambda \) for which \(r(\nu ) \le c_\beta \) if and only if
Since \([\tilde{c}_\alpha / \lambda _\alpha ]^{\lambda _\alpha } =[c_\alpha / \lambda _\alpha ]^{\lambda _\alpha } \left( \exp (d) \right) ^{\lambda _\alpha }\) and \(\prod _{\alpha \in \lambda ^+} \left( \exp (d) \right) ^{\lambda _\alpha } = \exp (d)\), (11) can be recognized as the inequality occurring within (10), which completes the proof. \(\square \)
Theorem 4.4 shows how \(\lambda \)witnessed AGE cones provide a window to the structure of full AGE cones \(C_X({\mathcal {A}},\beta )\). To appreciate the benefit of this perspective, it is necessary to consider the more elementary “power cone.” In our context, the primal power cone associated with a normalized Xcircuit \(\lambda \in {\mathbb {R}}^{{\mathcal {A}}}\) is
the corresponding dual cone is given by
It should be evident that \(C_X({\mathcal {A}},\lambda )\) can be formulated in terms of a dual \(\lambda \)weighted power cone; a precise formula is provided momentarily. For now we give a corollary concerning power cone representability and secondorder representability of \(C_X({\mathcal {A}})\) when X is a polyhedron (see [2, 3] for formal definitions).
Corollary 4.5
If X is a polyhedron, then \(C_X({\mathcal {A}})\) is power cone representable. If in addition \({\mathcal {A}}^T X\) is rational, then \(C_X({\mathcal {A}})\) is secondorder representable and thus has semidefinite extension degree 2.
Proof
We can assume \(\Lambda _X({\mathcal {A}})\ne \emptyset \), since otherwise \(C_X({\mathcal {A}})={\mathbb {R}}_+^{\mathcal {A}}\) and the claim follows. By Theorem 3.7, polyhedral X have finitely many Xcircuits, up to scaling. Apply Theorem 4.2 and finiteness of the normalized circuits \(\Lambda _X({\mathcal {A}})\) to write
The first claim follows as each of the finitely many sets \(C_X({\mathcal {A}},\lambda )\) appearing in the above sum are (dual) power cone representable. For the second claim observe that under the rationality assumptions we have \(\Lambda _X({\mathcal {A}}) \subset {\mathbb {Q}}^{{\mathcal {A}}}\). Using \(\beta :=\lambda ^\) and \(m :={{\,\mathrm{supp}\,}}\lambda \), it is known that the mdimensional \(\lambda \)weighted power cone (and its dual) are secondorder representable when \(\lambda _{{\setminus } \beta }\) is a rational vector in the \((m1)\)dimensional probability simplex [3, Section 3.4]. The last claim follows as the semidefinite extension degree of the secondorder cone is two [3, Section 2.3]. \(\square \)
The first part of Corollary 4.5 generalizes the case \(X={\mathbb {R}}^n\) considered by Papp for polynomials [33]. That aspect of the corollary has uses in computational optimization when applied judiciously. The second part of Corollary 4.5 generalizes results by Averkov [2] and Wang and Magron [41] for ordinary SAGE polynomials, and recent results by Naumann and Theobald for several types of ordinary SAGElike certificates [26]. We have deliberately framed the second part of the corollary in abstract terms (semidefinite extension degree), because that aspect of the corollary seems not useful for computational optimization.
We now work towards finding a simple representation of dual \(\lambda \)witnessed AGE cones \(C_X({\mathcal {A}},\lambda )^*\). We begin this process by regarding the primal as a cone of coefficients contained in \({\mathbb {R}}^{{\mathcal {A}}}\), and finding an explicit representation of the primal in terms of the elementary dual power cone \({{\,\mathrm{Pow}\,}}(\lambda )^*\). Towards that end we introduce a diagonal linear operator \(S_\lambda : {\mathbb {R}}^{{\mathcal {A}}} \rightarrow {\mathbb {R}}^{{{\,\mathrm{supp}\,}}\lambda }\) where \((S_\lambda w)_\alpha = w_\alpha \) for \(\alpha \in \lambda ^+\), and \((S_\lambda w)_\beta = w_\beta \exp (\sigma _X({\mathcal {A}}\lambda ))\) for \(\beta :=\lambda ^\). Recall that \(\delta _\beta \in {\mathbb {R}}^{{\mathcal {A}}}\) denotes the standard basis vector corresponding to \(\beta \in {\mathcal {A}}\), i.e., \(\delta _\beta ^T w = w_\beta \) for \(w \in {\mathbb {R}}^{\mathcal {A}}\).
Proposition 4.6
For \(\lambda \in N_{\beta }\) with \(\lambda _{\beta } = 1\) and \(\sigma _X({\mathcal {A}}\lambda ) < \infty \), the \(\lambda \)witnessed AGE cone admits the representation
Proof
First, we note that some inequality constraints are implied by \((S_\lambda c  r \delta _\beta ) \in {{\,\mathrm{Pow}\,}}(\lambda )^*\). It is necessary to include the inequality constraints explicitly, to account for the case when \({{\,\mathrm{supp}\,}}\lambda \subsetneq {\mathcal {A}}\). The condition \((S_\lambda c  r \delta _\beta ) \in {{\,\mathrm{Pow}\,}}(\lambda )^*\) can be rewritten as
Meanwhile, the minimum of \( c_\beta \exp (\sigma _X({\mathcal {A}}\lambda ))  r\) over \(r \ge 0\) is attained at \(r = 0\) when \(c_\beta < 0\) and \(r = c_{\beta }\exp (\sigma _X({\mathcal {A}}\lambda ))\) when \(c_\beta \ge 0\). In the \(c_\beta < 0\) case the constraint (13) becomes
In the \(c_\beta \ge 0\) case the constraint (13) is vacuous, since \(\prod _{\alpha \in \lambda ^+} [c_\alpha / \lambda _\alpha ]^{\lambda _\alpha } \ge 0\) is implied by . As the constraint in the preceding display is similarly vacuous when \(c_\beta > 0\), we see that it can be used in lieu of (13) without loss of generality. \(\square \)
We can appeal to Proposition 4.6 to find a representation for \(C_X({\mathcal {A}},\lambda )^*\) which is analogous to Eq. (10). Again, the dual is computed by regarding the primal as a cone of coefficients.
Proposition 4.7
For \(\lambda \in N_{\beta }\) with \(\lambda _{\beta } = 1\) and \(\sigma _X({\mathcal {A}}\lambda ) < \infty \), the dual \(\lambda \)witnessed AGE cone is given by
Proof
Let \(\beta = \lambda ^\) as is usual. To \(v \in {\mathbb {R}}^{\mathcal {A}}\) associate \(\mathrm {Val}(v) = \inf \{ v^T c \,:\, c \in C_X({\mathcal {A}},\lambda )\}\). A vector v belongs to \(C_X({\mathcal {A}},\lambda )^*\) if and only if \(\mathrm {Val}(v) = 0\). We will find constraints on v so that the dual feasible set for computing \(\mathrm {Val}(v)\) is nonempty, which in turn will imply \(\mathrm {Val}(v) = 0\).
We begin by noting that for any element \(\alpha \in {\mathcal {A}}{\setminus } {{\,\mathrm{supp}\,}}\lambda \), the only constraints on \(c_\alpha , v_\alpha \) for \(c \in C_X({\mathcal {A}},\lambda ),v \in C_X({\mathcal {A}},\lambda )^*\) are \(c_\alpha \ge 0, v_\alpha \ge 0\); therefore we assume \({\mathcal {A}}= {{\,\mathrm{supp}\,}}\lambda \) for the remainder of the proof. When considering the given expression for \(\mathrm {Val}(v)\) as a primal problem, we compute a dual using (12) from Proposition 4.6. Under the assumption \({\mathcal {A}}= {{\,\mathrm{supp}\,}}\lambda \), the constraint is implied by \((S_\lambda c  r \delta _\beta ) \in {{\,\mathrm{Pow}\,}}(\lambda )^*\). Therefore when forming a Lagrangian for \(\mathrm {Val}(v)\) using (12), the dual variable to “” may be omitted.
For the remaining constraints \((S_\lambda c  r \delta _\beta ) \in {{\,\mathrm{Pow}\,}}(\lambda )^*\) and \(r \ge 0\) we use dual variables \(\mu \in {{\,\mathrm{Pow}\,}}(\lambda )\) and \(t \in {\mathbb {R}}_+\) respectively; the Lagrangian is
For the Lagrangian to be bounded below over \(c \in {\mathbb {R}}^{{\mathcal {A}}}\) and \(r \in {\mathbb {R}}\), it is necessary and sufficient that \(v = S_\lambda ^\intercal \mu \) and \(\mu _\beta = t\). Since we have assumed \({{\,\mathrm{supp}\,}}\lambda = {\mathcal {A}}\) and \(\sigma _X({\mathcal {A}}\lambda ) < \infty \), the diagonal linear operator \(S_\lambda \) is symmetric positive definite, so we can express the requirements on \(\mu , t\) as
Therefore the conditions \(S_\lambda ^{1} v \in {{\,\mathrm{Pow}\,}}(\lambda ),~ v_\beta \ge 0\) are equivalent to
The proposition follows by applying the definitions of \({{\,\mathrm{Pow}\,}}(\lambda )\) and \(S_\lambda \). \(\square \)
5 Reduced sublinear circuits in SAGE cones
The previous section showed that an XSAGE cone is generated by Xcircuits. Here we seek a much sharper characterization: are all Xcircuits really necessary? The answer to this question depends on whether one means to reconstruct an individual AGE cone, or the larger SAGE cone. For example, by reinterpreting results from [23], we may infer that every simplicial \({\mathbb {R}}^n\)circuit \(\lambda \in \Lambda _{{\mathbb {R}}^n}({\mathcal {A}},\beta )\) generates a \(\lambda \)witnessed AGE cone containing an extreme ray of \(C_{{\mathbb {R}}^n}({\mathcal {A}},\beta )\). In this way, every \({\mathbb {R}}^n\)circuit is needed if one requires complete reconstruction of individual AGE cones. However, Katthän, Naumann, and Theobald showed that many extreme rays of AGE cones are not extreme when considered in the sum \(C_{{\mathbb {R}}^n}({\mathcal {A}}) = \sum _{\beta \in {\mathcal {A}}} C_{{\mathbb {R}}^n}({\mathcal {A}},\beta )\). Specifically, an \({\mathbb {R}}^n\)circuit \(\lambda \in \Lambda _{{\mathbb {R}}^n}({\mathcal {A}})\) is only needed in \(C_{{\mathbb {R}}^n}({\mathcal {A}})\) if exactly one element of \({\mathcal {A}}\) hits the relative interior of \({{\,\mathrm{conv}\,}}({{\,\mathrm{supp}\,}}\lambda )\) [17, Proposition 4.4]. Circuits satisfying this property were called reduced. The goal of this section is to develop a reducedness criterion for Xcircuits that yields the most efficient construction of \(C_X({\mathcal {A}})\) by \(\lambda \)witnessed AGE cones, see Theorems 5.5 and 5.6. Achieving this goal is more difficult than obtaining the results from earlier sections. Therefore we begin by summarizing and discussing the results, and we provide proofs in later subsections.
5.1 Definitions, results, and discussion
The definition of a reduced \({\mathbb {R}}^n\)circuit is of a purely combinatorial nature, involving the circuit’s support. This is appropriate because when speaking of affinelinear simplicial circuits, the normalized vector representation \(\lambda \) is completely determined by its support. In the context of Xcircuits, we no longer have this property. Therefore when developing reduced Xcircuits it is useful to have a different characterization of reduced \({\mathbb {R}}^n\)circuits. Here we can consider how Forsgård and de Wolff defined the Reznick cone of \({\mathcal {A}}\) as the conic hull \(R_{{\mathbb {R}}^n}({\mathcal {A}}) :={{\,\mathrm{co}\,}}\Lambda _{{\mathbb {R}}^n}({\mathcal {A}})\) and – in the language of Katthän et al.—subsequently proved that an \({\mathbb {R}}^n\)circuit \(\lambda \) is an edge generator of \(R_{{\mathbb {R}}^n}({\mathcal {A}})\) if and only if it is reduced [12].
Our definition of reduced Xcircuits involves edge generators of a certain cone in one higher dimension than the Reznick cone. To describe the cone and facilitate later analysis, we need the following definition.
Definition 5.1
The functional form of an Xcircuit \(\nu \in {\mathbb {R}}^{{\mathcal {A}}}\) is \(\phi _\nu : {\mathbb {R}}^{\mathcal {A}}\rightarrow {\mathbb {R}}\) defined by
We routinely overload notation and use \(\phi _\nu =(\nu ,\sigma _X({\mathcal {A}}\nu )) \in {\mathbb {R}}^{{\mathcal {A}}} \times {\mathbb {R}}\) to denote the functional form of a given Xcircuit. When representing the functional form of an Xcircuit by a vector in \({\mathbb {R}}^{{\mathcal {A}}} \times {\mathbb {R}}\), the scalar \(\phi _\nu (y)\) can be expressed as an inner product \(\phi _\nu (y) =(y,1)^T \phi _\nu \).
Definition 5.2
The circuitgenerated cone (shortly, CG cone) of \(({\mathcal {A}},X)\) is
where .
The idea of generating a cone from augmented circuit vectors \((\nu ,\sigma _X({\mathcal {A}}\nu )) \in {\mathbb {R}}^{{\mathcal {A}}} \times {\mathbb {R}}\) clearly parallels Theorem 3.6. While the cones from Theorem 3.6 are considered for one \(\beta \in {\mathcal {A}}\) at a time, the CG cone accounts for all Xcircuits at once. The CG cone also includes an extra generator that ultimately serves to make the following definition more stringent.
Definition 5.3
The reduced Xcircuits of \({\mathcal {A}}\) are the vectors \(\nu \) where \(\nu /\Vert \nu \Vert _{\infty } \in \Lambda _X({\mathcal {A}})\) and the corresponding functional form \(\phi _\nu \) generates an extreme ray of \(G_X({\mathcal {A}})\). The set of normalized reduced Xcircuits is henceforth denoted \(\Lambda _X^\star ({\mathcal {A}})\).
There is a subtle issue here that in order for reduced Xcircuits to be of any use to us, the CG cone must be pointed (else \(G_X({\mathcal {A}})\) would have no extreme rays whatsoever). We show later in this section that our stated assumption of linear independence of \(\{\mathrm{e}^{\alpha }\}_{\alpha \in {\mathcal {A}}}\) on X ensures \(G_X({\mathcal {A}})\) is pointed. Regardless of whether or not the CG cone is pointed, we have the following theorem.
Theorem 5.4
\(C_X({\mathcal {A}})^* = {{\,\mathrm{cl}\,}}\{ \exp y \,:\, (y,1) \in G_X({\mathcal {A}})^* \}\).
Theorem 5.4 is noteworthy in several respects. It demonstrates that \(C_X({\mathcal {A}})^*\) is convex in the usual sense and convex under a logarithmic transformation \(S \mapsto \log S = \{ y : \exp y \in S \}\). This second form of convexity is a significant structural property. For example, if we know that the log of the moment cone \({{\,\mathrm{cl}\,}}({{\,\mathrm{co}\,}}\{\exp ({\mathcal {A}}^T x) : x \in X \})\) is not convex, then it should be that \(C_X({\mathcal {A}})\) does not contain all Xnonnegative signomials on \({\mathcal {A}}\). Additionally, Theorem 5.4 can be reverseengineered to arrive at the concept of a reduced Xcircuit: the definition is chosen so that (y, 1) belongs to \(G_X({\mathcal {A}})^*\) if and only if \(\phi _{\lambda }(y) \ge 0\) for all \(\lambda \) in \(\Lambda _X^\star ({\mathcal {A}})\). Here, Theorem 5.4 is a tool that we combine with convex duality to obtain the following results.
Theorem 5.5
If \(\Lambda _X({\mathcal {A}})\) is empty, then \(C_X({\mathcal {A}}) = {\mathbb {R}}^{{\mathcal {A}}}_+\). Otherwise,
We point out how Theorem 5.5 involves a closure around the union over \(\lambda \)witnessed AGE cones, while Theorem 4.4 has no such closure. The need for the closure here stems from an application of an infinite version of conic duality in the course of the theorem’s proof, while our proof of Theorem 4.4 required no duality at all. The requisite use of conic duality is simpler when X is a polyhedron, as the following theorem suggests.
Theorem 5.6
If X is a polyhedron and \(\Lambda _X({\mathcal {A}})\) is nonempty, then the associated conditional SAGE cone is given by the finite Minkowski sum
Moreover, there is no proper subset \(\Lambda \subsetneq \Lambda _X^\star ({\mathcal {A}})\) for which \(C_X({\mathcal {A}}) = \sum _{\lambda \in \Lambda } C_X({\mathcal {A}},\lambda )\).
The first part of Theorem 5.6 follows easily from the arguments we use to prove Theorem 5.5. The second part of the theorem is much more delicate, and in fact is the reason why \(G_X({\mathcal {A}})\) is defined in the manner of 5.2, rather than merely \({{\,\mathrm{co}\,}}\{ \phi _\lambda \,:\, \lambda \in \Lambda _X({\mathcal {A}}) \}\).
The task of actually finding the reduced Xcircuits of \({\mathcal {A}}\) is difficult. When X is a polyhedron there are finitely many such Xcircuits, but the naive method for finding them involves FourierMotzkin elimination on a set of potentially very high dimension. There is more hope for this problem when X is a cone. In that case, Xcircuits are the extreme rays of \((\ker {\mathcal {A}}+ {\mathcal {A}}^{\dagger } X^*) \cap N_{\beta }\) for \(\beta \in {\mathcal {A}}\), and no lifting is needed to find these extreme rays with a computer. The reduced Xcircuits could then be computed by finding the extreme rays of the convex cone generated by the Xcircuits. The following detailed example finds the reduced Xcircuits of \({\mathcal {A}}\) in the univariate case with \(X = [0,\infty )\). The claim made in the example is used in Sect. 6.
Example 5.7
We continue the running example of \(X=[0,\infty )\) from Example 3.8. In particular recall \({\mathcal {A}}=\{\alpha _1,\ldots ,\alpha _m\}\) for \(\alpha _1< \cdots < \alpha _m\), indexing by \(i \in [m]\), and working with standard basis \(\delta _i \in {\mathbb {R}}^m\). We claim that
where we have the following formula from [17, Prop. 4.4]
As a first step towards seeing this, observe that since \(X=[0,\infty )\) is a cone, the functional form of a \([0,\infty )\)circuit \(\nu \) is simply \(\phi _{\nu }(y) = \sum _{i=1}^m y_{i} \nu _{i}\). Hence, the reduced \([0,\infty )\)circuits are exactly the edge generators of the cone \({{\,\mathrm{co}\,}}\Lambda _{[0,\infty )}\) generated by all the \([0,\infty )\)circuits of types (1) and (2) listed in Example 3.8. Therefore, we have to show that \(\{\delta _2\delta _1\}\cup \Lambda _{{\mathbb {R}}}^\star ({\mathcal {A}})\) are exactly the normalized edge generators of \({{\,\mathrm{co}\,}}\Lambda _{[0,\infty )}\).
For the Xcircuits \(\delta _j \delta _i\) (\(j > i\)) of type (1) in Example 3.8, we show they decompose if \(j>i+1\) or \(i>1\). For \(j>i+1\), this is apparent from the decomposition
For \(j=i+1\) and \(i > 1\), we can use the decomposition
into Xcircuits with three nonvanishing components. As final consideration for type (1), the Xcircuit \(\delta _{2}\delta _{1}\) cannot be written as a conic combination of Xcircuits with three nonzero entries, because any conic combination of those Xcircuits has a positive entry in its nonvanishing component with maximal index. For Xcircuits of type (2) from Example 3.8, simply note that these are also \({\mathbb {R}}\)circuits. Therefore a necessary condition for a type (2) Xcircuit \(\lambda \) to be extremal in \({{\,\mathrm{co}\,}}\Lambda _{[0,\infty )}\) is that \(\lambda \) belongs to \(\Lambda _{{\mathbb {R}}}^\star ({\mathcal {A}})\).
It remains to show that none of the remaining Xcircuits can be written as a convex combination of the others. First note that an Xcircuit \(\nu \in \Lambda _{{\mathbb {R}}}^\star ({\mathcal {A}})\) cannot be decomposed into a sum which involves an Xcircuit \(\tilde{\nu }\) with two nonvanishing components. Namely, since \({\mathcal {A}} \nu = 0\) and \({\mathcal {A}} \tilde{\nu } > 0\), we would obtain for the other summand \(\nu  \tilde{\nu }\) the property \({\mathcal {A}} (\nu \tilde{\nu }) < 0\) and thus \(\sigma _{[0,\infty )}({\mathcal {A}} (\nu  \tilde{\nu })) = \infty \), a contradiction. And of course it is trivially true that no element \(\lambda \in \Lambda _{{\mathbb {R}}}^\star ({\mathcal {A}})\) can be written as a convex combination of other such elements. Since \({{\,\mathrm{co}\,}}\Lambda _{[0,\infty )}\) is finitely generated and there is no \(S \subsetneq \{\delta _2\delta _1\} \cup \Lambda _{{\mathbb {R}}}^\star ({\mathcal {A}})\) for which \({{\,\mathrm{co}\,}}\Lambda _{[0,\infty )} = {{\,\mathrm{co}\,}}S\), we conclude that \(\{\delta _2\delta _1\} \cup \Lambda _{{\mathbb {R}}}^\star ({\mathcal {A}})\) are the reduced Xcircuits of \({\mathcal {A}}\).
The remainder of this section is organized as follows. Sect. 5.2 proves Theorem 5.4, which is instrumental in later subsections. In Sect. 5.3 we introduce and prove a certain representation result for the CG cone. Given the groundwork laid in these two subsections, Sect. 5.4 proves Theorem 5.5 in very short order. Section 5.5 proves Theorem 5.6 by refining the arguments from Sect. 5.4.
5.2 Proof of Theorem 5.4
We begin with the following simple lemma.
Lemma 5.8
If \(S \subset T\) are convex sets where S is closed and \(S \cap {{\,\mathrm{ri}\,}}T \ne \emptyset \), then \(S = {{\,\mathrm{cl}\,}}(S \cap {{\,\mathrm{ri}\,}}T)\).
Proof
Rockafellar’s [37, Theorem 18.2] states that every relatively open set contained in T is contained in the relative interior of some face of T. By our assumption \(S \cap {{\,\mathrm{ri}\,}}T \ne \emptyset \), the only face of T which contains S is T itself. Since \({{\,\mathrm{ri}\,}}S\) is obviously relatively open, we have \({{\,\mathrm{ri}\,}}S \subset {{\,\mathrm{ri}\,}}T\), and the claim follows by the identity \(S = {{\,\mathrm{cl}\,}}{{\,\mathrm{ri}\,}}S\) for closed convex sets. \(\square \)
Proof of Theorem 5.4
Use Rockafellar’s [37, Corollary 16.5.2] to invoke Theorem 4.4 from a dual point of view, which gives \(C_X({\mathcal {A}},\beta )^* = \bigcap C_X({\mathcal {A}},\lambda )^*\), where the intersection runs over all \(\lambda \in \Lambda _X({\mathcal {A}},\beta )\). Then Proposition 4.7 implies
We claim that \(C_X({\mathcal {A}})^*\) can be represented as the closure of its intersection with the positive orthant, that is, \(C_X({\mathcal {A}})^* = {{\,\mathrm{cl}\,}}\left( C_X({\mathcal {A}})^* \cap {\mathbb {R}}^{{\mathcal {A}}}_{++} \right) \). Since \(C_X({\mathcal {A}})\) contains all posynomials and is contained in the nonnegativity cone, the dual \(C_X({\mathcal {A}})^*\) contains the moment cone but is still contained in the nonnegative orthant. As we have assumed X is nonempty, \(C_X({\mathcal {A}})^*\) must contain a point \(\exp ({\mathcal {A}}^T x) \in {\mathbb {R}}^{{\mathcal {A}}}_{++}\), so \(C_X({\mathcal {A}})^* \cap {{\,\mathrm{ri}\,}}{\mathbb {R}}^{\mathcal {A}}_{+} \ne \emptyset \). Applying Lemma 5.8 with \(S = C_X({\mathcal {A}})^*\) and \(T = {\mathbb {R}}^{\mathcal {A}}_+\) gives \(C_X({\mathcal {A}})^* = {{\,\mathrm{cl}\,}}\left( C_X({\mathcal {A}})^* \cap {{\,\mathrm{ri}\,}}{\mathbb {R}}^{{\mathcal {A}}}_+ \right) = {{\,\mathrm{cl}\,}}\left( C_X({\mathcal {A}})^* \cap {\mathbb {R}}^{{\mathcal {A}}}_{++} \right) \).
When considering \(C_X({\mathcal {A}})^*\) only over the positive orthant, the inequalities
appearing in (18) may be rewritten as
where we used \(\lambda _\beta = 1\) and \(y = \log v \in {\mathbb {R}}^{{\mathcal {A}}}\). Hence,
By the definition of the dual cone from convex analysis, the property \((y,1)^T(\nu ,\tau ) \ge 0 \; \, \forall \, (\nu ,\tau ) \in G_X({\mathcal {A}})\) is the same as \((y,1) \in G_X({\mathcal {A}})^*\). This completes the proof. \(\square \)
The ability to represent \(C_X({\mathcal {A}})^*\) in terms of \(G_X({\mathcal {A}})^*\) is key to our proofs of Theorems 5.5 and 5.6. Note that the theorem remains true when \(G_X({\mathcal {A}})\) is replaced by the smaller set \({{\,\mathrm{co}\,}}\{\phi _\lambda \,:\, \lambda \in \Lambda _X({\mathcal {A}}) \}\), because the term simply requires \((y,t) \in G_X({\mathcal {A}})^*\) to have \(t \ge 0\).
5.3 Topological properties of the CG cone
We need some topological properties of the CG cone from Definition 5.2.
Theorem 5.9
.
The proof of this theorem essentially reduces to showing that \(G_X({\mathcal {A}})\) is pointed and closed. The pointedness of the CG cone is easy to show, but closedness is a more delicate matter. In fact—our proof that \(G_X({\mathcal {A}})\) is closed relies on the fact that it is pointed. We therefore prove pointedness before discussing closedness any further.
Lemma 5.10
The closure of the CG cone contains no lines.
Proof
We focus on proving \(G_X({\mathcal {A}})^*\) is fulldimensional. Let \({\mathcal {A}} =m\). We assumed at the outset of the article that the moment cone \(M_X({\mathcal {A}}) :={{\,\mathrm{co}\,}}\{\exp ({\mathcal {A}}^T x) \,:\, x \in X\}\) was fulldimensional, i.e., \(\dim M_X({\mathcal {A}}) = m\); we use that assumption in this lemma. Specifically, since \(C_X({\mathcal {A}})\) is contained within the nonnegativity cone, we have that \(M_X({\mathcal {A}}) \subset C_X({\mathcal {A}})^*\) and so \(\dim C_X({\mathcal {A}})^* = m\). By Theorem 5.4 and continuity of the exponential function, we see that if \(\dim C_X({\mathcal {A}})^* = m\), then the preimage \(S :=\{ y \,:\, (y,1) \in G_X({\mathcal {A}})^* \}\) likewise has dimension m. Consider the induced cone associated with S:
The rightmost expression in the above display tells us \({{\,\mathrm{indco}\,}}S \subset G_X({\mathcal {A}})^*\). We claim without proof that since S is a fulldimensional convex set, \({{\,\mathrm{indco}\,}}S\) is similarly fulldimensional. Taking this claim as given, \({{\,\mathrm{indco}\,}}S \subset G_X({\mathcal {A}})^*\) implies \(G_X({\mathcal {A}})^*\) is fulldimensional. Because \(G_X({\mathcal {A}})^*\) is fulldimensional, \({{\,\mathrm{cl}\,}}G_X({\mathcal {A}}) = G_X({\mathcal {A}})^{**} \supset G_X({\mathcal {A}})\) contains no lines. \(\square \)
In the special case where X is a polyhedron, closedness of \(G_X({\mathcal {A}})\) follows from Theorem 3.7, which tells us that \(\Lambda _X({\mathcal {A}})\) is finite. To prove closedness for arbitrary convex sets X we need to more carefully appeal to properties of the generating set .
Lemma 5.11
The CG cone is closed.
Proof
Let \(S_\beta = \{ (\lambda ,\sigma _X({\mathcal {A}}\lambda )) \,:\, \lambda \in \Lambda _X({\mathcal {A}},\beta ) \}\). By Theorem 3.6, the elements \(\phi _\lambda \in S_\beta \) are edge generators for the closed convex cone \(T_\beta = {{\,\mathrm{co}\,}}\{ (\nu ,\sigma _X({\mathcal {A}}\nu )) \,:\, \nu \in N_\beta ,\, \sigma _X({\mathcal {A}}\nu ) < \infty \}\). From \(S_\beta \) we form \(S'_\beta :={{\,\mathrm{conv}\,}}S_\beta \), and find \(S'_\beta \) is isomorphic to \(S'_\beta = \{ \phi _\lambda \in T_\beta \,:\, \lambda _{\beta } = 1\}\). Because \(S_\beta \) is bounded, \(S'_\beta \) is likewise bounded. Because \(S'_\beta \) is a slice of a closed convex cone \(T_\beta \), we have that \(S'_\beta \) is closed. Therefore we conclude \(S'_\beta \) is compact.
Now define . The set \(S'\) is a compact generating set for \(G_X({\mathcal {A}})\) which does not contain the origin. Since \({{\,\mathrm{cl}\,}}G_X({\mathcal {A}})\) is known to contain no lines (Lemma 5.10), we apply Proposition 8.2 to \(S'\), \({{\,\mathrm{co}\,}}S'\) to infer that \({{\,\mathrm{co}\,}}S' = G_X({\mathcal {A}})\) is closed. \(\square \)
Proof of Theorem 5.9
Lemmas 5.10 and 5.11 show \(G_X({\mathcal {A}})\) is closed and pointed. By [37, Corollary 18.5.2], we have that \(G_X({\mathcal {A}})\) may be expressed as the conic hull of any set of vectors containing all of its extreme rays. Since is a generating set for \(G_X({\mathcal {A}})\), it must contain all extreme rays of \(G_X({\mathcal {A}})\). However, by definition of \(\Lambda _X^\star ({\mathcal {A}})\), if \(\lambda \) does not belong to \(\Lambda _X^\star ({\mathcal {A}})\), then \(\phi _\lambda \in S\) does not generate an extreme ray of \(G_X({\mathcal {A}})\). We may therefore form \(T = S {\setminus } \{ \phi _\lambda \,:\, \lambda \not \in \Lambda _X^\star ({\mathcal {A}}) \}\) and still find \(G_X({\mathcal {A}}) = {{\,\mathrm{co}\,}}T\). This proves the theorem. \(\square \)
5.4 Proof of Theorem 5.5
Proof of Theorem 5.5
Using the representation provided by Theorem 5.9, we can express
We obtain the following refinement of Eq. (18), by combining (19) with Theorem 5.4:
Of course, Equation (20) can be written as \(C_X({\mathcal {A}})^* = \bigcap _{\lambda \in \Lambda _X^\star ({\mathcal {A}})} C_X({\mathcal {A}},\lambda )^*\). We appeal to conic duality principles (again, [37, Corollary 16.5.2]) to obtain the claim of the theorem. \(\square \)
5.5 Proof of Theorem 5.6
A conceptual message from the last section is that it can be very useful to analyze \(C_X({\mathcal {A}})\) in terms of the vectors y where \(\exp y\) belongs to \(C_X({\mathcal {A}})^*\). This section will hammer that message home. We begin with the lemma that ultimately led us to define \(G_X({\mathcal {A}})\) as per Definition 5.2, rather than as the simpler set \({{\,\mathrm{co}\,}}\{\phi _\lambda \,:\, \lambda \in \Lambda _X({\mathcal {A}})\}\).
Lemma 5.12
If X is polyhedral and \(\Lambda \subsetneq \Lambda _X^\star ({\mathcal {A}})\), then there must exist a \(\tilde{y} \in {\mathbb {R}}^{{\mathcal {A}}}\) satisfying \(\phi _{\lambda '}(\tilde{y}) \ge 0\) for all \( \lambda ' \in \Lambda \), yet for some \(\lambda \in \Lambda _X^\star ({\mathcal {A}}) {\setminus } \Lambda \) we have \(\phi _\lambda (\tilde{y}) < 0\).
Proof
Let and . Of course, a vector \(\tilde{y}\) satisfies \(\phi _{\lambda '}(\tilde{y}) \ge 0\) for all \(\lambda ' \in \Lambda \) if and only if \((\tilde{y},1) \in ({{\,\mathrm{co}\,}}T_2)^*\). We will show that given the polyhedrality of X and the assumption on \(\Lambda \), there exists a vector \(\tilde{y}\) for which \((\tilde{y},1) \in ({{\,\mathrm{co}\,}}T_2)^* {\setminus } ({{\,\mathrm{co}\,}}T_1)^*\). The result will follow since membership of vectors \((y,1) \in ({{\,\mathrm{co}\,}}T_1)^*\) is equivalent to \(\phi _\lambda (y) \ge 0\) for all \(\lambda \in \Lambda _X^\star ({\mathcal {A}})\).
Since X is polyhedral, the cones \(T_1\) and \(T_2\) are also polyhedral (both are finitely generated by Theorem 3.7). Meanwhile, Theorem 5.9 tells us that \(G_X({\mathcal {A}}) = {{\,\mathrm{co}\,}}T_1\), and the definition of reduced circuits is such that every generates an extreme ray in \(G_X({\mathcal {A}})\). Since \(\Lambda \subsetneq \Lambda _X^\star ({\mathcal {A}})\), there exists a \(\phi _\lambda \in T_1 {\setminus } T_2\) which generates an extreme ray of \(G_X({\mathcal {A}})\). Therefore \({{\,\mathrm{co}\,}}T_2\) is a strict subset of \({{\,\mathrm{co}\,}}T_1 \equiv G_X({\mathcal {A}})\). We may take dual cones to find \(({{\,\mathrm{co}\,}}T_2)^* \supsetneq ({{\,\mathrm{co}\,}}T_1)^*\). Note that since \(T_1\) and \(T_2\) contain , the dual cones must be contained in \(K = {\mathbb {R}}^{{\mathcal {A}}} \times {\mathbb {R}}_+\). Furthermore, since X is presumed nonempty, Theorem 5.4 tells us there exists a point \((y,1) \in ({{\,\mathrm{co}\,}}T_1)^*\), so the relative interiors of \(({{\,\mathrm{co}\,}}T_1)^*\) and \(({{\,\mathrm{co}\,}}T_2)^*\) are contained within the relative interior of K. As our last step, use the fact that if one closed polyhedral cone strictly contains another closed polyhedral cone, then there exists a point in the relative interior of the larger cone which may be separated from the smaller cone; apply this to \(({{\,\mathrm{co}\,}}T_2)^* \supsetneq ({{\,\mathrm{co}\,}}T_1)^*\) to find a point \((y',t') \in {{\,\mathrm{ri}\,}}(({{\,\mathrm{co}\,}}T_2)^*) {\setminus } ({{\,\mathrm{co}\,}}T_1)^*\) with \(t' > 0\). From this \((y',t')\) we rescale \(\tilde{y} = y' / t'\) so that \((\tilde{y},1) \in ({{\,\mathrm{co}\,}}T_2)^* {\setminus } ({{\,\mathrm{co}\,}}T_1)^*\). \(\square \)
Remark 5.13
We take a moment to unpack the technical dependencies in Lemma 5.12. We explicitly cited Theorem 5.9. Our proof of that result relied on Lemma 5.11, which states that the CG cone is closed, and which we proved by appeal to Theorem 3.6. However, when X is a polyhedron, Lemma 5.11 can alternatively be proven by appeal to Theorem 3.7.
Our next lemma shows how to take a condition stated in terms of Lemma 5.12, and deduce a statement about \(C_X({\mathcal {A}})^*\). The lemma’s proof requires only that X be nonempty and convex.
Lemma 5.14
If \(\tilde{y} \in {\mathbb {R}}^{{\mathcal {A}}}\) satisfies \(\phi _\lambda (\tilde{y}) < 0\) for some \(\lambda \in \Lambda _X({\mathcal {A}})\), then \(\exp \tilde{y} \not \in C_X({\mathcal {A}})^*\).
Proof
We will find a vector \(z \in {\mathbb {R}}^{{\mathcal {A}}}\) where \(0 \le z^T \exp y\) for all \(\exp y \in C_X({\mathcal {A}})^*\), and yet \(z^T \exp \tilde{y} < 0\). By continuity, the condition that \(0 \le z^T \exp y\) for all \(\exp y \in C_X({\mathcal {A}})^*\) will imply the slightly stronger statement that \(0 \le z^T v\) for all \(v \in C_X({\mathcal {A}})^*\). Therefore z will evidently serve as a separating hyperplane to prove the desired claim. Let \(\beta :=\lambda ^\).
Since \(\lambda \in \Lambda _X({\mathcal {A}})\), Theorem 5.4 says that \(\phi _\lambda (y) \ge 0\) whenever \(\exp y \in C_X({\mathcal {A}})^*\). Combine \(\phi _\lambda (\tilde{y}) < 0\) with strict monotonicity of the exponential function to conclude
Notice that taking a difference \(\phi _\lambda (y) \phi _\lambda (\tilde{y}) = \lambda _{{\setminus } \beta }^T(y_{{\setminus } \beta } + \tilde{y}_{{\setminus } \beta })  y_\beta + \tilde{y}_\beta \) eliminates the support function term appearing in \(\phi _\lambda \). Defining \(u = \phi _\lambda (\tilde{y})\), we multiply both sides of the nonstrict inequality in (21) by \(\exp (u\tilde{y}_\beta +y_\beta )\) to obtain
Convexity of the exponential function tells us that \(\exp \left( \lambda _{{\setminus } \beta }^T(y_{{\setminus } \beta }\tilde{y}_{{\setminus } \beta })\right) \le \lambda _{{\setminus } \beta }^T\exp (y_{{\setminus } \beta }\tilde{y}_{{\setminus } \beta })\), where the righthandside may be rewritten using the Hadamard product
Applying these observations to (22) gives
Inequality (23) is essentially what we need to prove the lemma. Defining \(z \in {\mathbb {R}}^{\mathcal {A}}\) by \(z_\alpha =\lambda _\alpha \exp (\tilde{y}_\alpha )\) for \(\alpha \ne \beta \) and \(z_\beta = \exp (u\tilde{y}_\beta )\), we have that \(0 \le z^T \exp y\) for all \(\exp y \in C_X({\mathcal {A}})^*\). As explained at the beginning of this proof, we appeal to continuity to establish \(0 \le z^T v\) for all \(v \in C_X({\mathcal {A}})^*\). One may use \(\lambda _{{\setminus } \beta }^T 1 = 1\) to trivially evaluate \(z^T \exp (\tilde{y}) = 1  \exp (u)\), and since \(u < 0\) by assumption on \(\tilde{y}\), we conclude \(z^T\exp (\tilde{y}) < 0\). \(\square \)
Proof of Theorem 5.6
By Theorem 5.4, we have the dual description \(C_X({\mathcal {A}})^* = {{\,\mathrm{cl}\,}}\{ \exp y \, : \, (y,1) \in G_X({\mathcal {A}})^*\}\). Applying Theorem 5.9 then gives
We rewrite the condition on \(\phi _\lambda (y)\) as a condition on \(v = \exp y\) using the powercone formulation in Proposition 4.7. Since X is polyhedral, Theorem 3.7 tells us there are finitely many normalized Xcircuits \(\Lambda _X({\mathcal {A}})\). We may therefore express \(C_X({\mathcal {A}})^*\) as a finite intersection of dual \(\lambda \)witnessed AGE cones,
Moreover, each dual \(\lambda \)witnessed AGE cone \(C_X({\mathcal {A}},\lambda )^*\) is an outerapproximation of the fulldimensional moment cone \({{\,\mathrm{co}\,}}\{ \exp ({\mathcal {A}}^T x) \,:\, x \in X \}\), hence there exists a point \(v_0\) in the interior of the moment cone where \(v_0 \in {{\,\mathrm{int}\,}}C_X({\mathcal {A}},\lambda )^*\) for all \(\lambda \in \Lambda _X^\star ({\mathcal {A}})\). Therefore, by [37, Corollary 16.4.2] we have
which establishes the first part of the theorem.
For the second part of the theorem, suppose \(\Lambda \) is a proper subset of \(\Lambda _X^\star ({\mathcal {A}})\). Consider the set \(C=\sum _{\lambda \in \Lambda } C_X({\mathcal {A}},\lambda )\) and its dual \(C^* = \bigcap \{ C_X({\mathcal {A}},\lambda )^* \,:\, \lambda \in \Lambda \}\). Clearly, since \(C \subset C_X({\mathcal {A}})\) we have \(C^* \supset C_X({\mathcal {A}})^*\) – we will show that this containment is strict, i.e., \(C^* \supsetneq C_X({\mathcal {A}})^*\). Once this is done, duality will tell us that \(C \subsetneq C_X({\mathcal {A}})\).
Since C is contained within the signomial nonnegativity cone we again have that \(C^*\) contains the moment cone and so by Lemma 5.8 we have \(C^* = {{\,\mathrm{cl}\,}}(C^* \cap {\mathbb {R}}^{{\mathcal {A}}}_{++})\). Work with \(C^*\) over the positive orthant using Proposition 4.7 to express it as \(C^* = {{\,\mathrm{cl}\,}}\{ \exp y \,:\, y \in Y\}\) for \(Y :=\{ y \,:\, \phi _\lambda (y) \ge 0 \; \, \forall \, \lambda \in \Lambda \}\). By Lemma 5.12 there exists an element \(\tilde{y} \in Y\) for which some \(\lambda \in \Lambda _X^\star ({\mathcal {A}}) {\setminus } \Lambda \) satisfies \(\phi _\lambda (\tilde{y}) < 0\). Apply Lemma 5.14 to this pair \((\phi _\lambda , {\tilde{y}})\) to see that \(\exp \tilde{y}\) can be separated from the closed convex set \(C_X({\mathcal {A}})^*\). We have therefore found a point \(\tilde{y}\) where \(\exp \tilde{y} \in C^*\) and yet \(\exp \tilde{y}\) can be separated from \(C_X({\mathcal {A}})^*\), so we conclude \(C^* \supsetneq C_X({\mathcal {A}})^*\). \(\square \)
Before concluding this section we would like to point out a more general way to frame our analysis. Given a pair \((\lambda ,a) \in {\mathbb {R}}^m \times {\mathbb {R}}\) where \(\lambda \) sums to zero and has exactly one negative component \(\lambda _i = 1\), we have a power cone constraint \(v_i \le \exp (a) \prod _{j\ne i}v_j^{\lambda _j}\) which may be rewritten to \(1 \le \exp (a) v^{\lambda }\). Given a set of such pairs \(P \subset {\mathbb {R}}^m \times {\mathbb {R}}\), we obtain the convex set
We have effectively shown that if is pointed and F(P) intersects the positive orthant, then the unique minimum \(P^\star \subset P\) for which \(F(P^\star ) = F(P)\) can be read off from the extreme rays of the polyhedral cone K.
6 Extreme rays of halfline SAGE cones
In the previous section, we showed that by appropriate appeals to convex duality, one may derive representations of \(C_X({\mathcal {A}})\) with little to no redundancy. Here we build upon those results to completely characterize the extreme rays of the XSAGE cone for the univariate case \(X=[0,\infty )\).
Proposition 6.1
For \(\alpha _1< \cdots < \alpha _m\), the extreme rays of \(C_{[0,\infty )}(\{\alpha _1,\ldots ,\alpha _m\})\) are:

(1)
\({\mathbb {R}}_+\cdot \exp (\alpha _1 x) \),

(2)
\({\mathbb {R}}_+\cdot \{\exp (\alpha _2 x)\exp (\alpha _1 x)\}\),

(3)
\({\mathbb {R}}_+ \cdot \{c_{i+1} \exp (\alpha _{i+1}x)+ c_{i} \exp (\alpha _i x)+c_{i1}\exp (\alpha _{i1}x) \, : \, 2 \le i \le m1 \}\) with
$$\begin{aligned} c_{i+1}> 0, \qquad c_{i1} > 0, \quad \text {and} \quad c_{i} =  \left( \frac{c_{i1}}{\lambda _{i1}} \right) ^{\lambda _{i1}} \left( \frac{c_{i+1}}{\lambda _{i+1}} \right) ^{\lambda _{i+1}}, \end{aligned}$$where
$$\begin{aligned} \lambda _{i+1} = \frac{\alpha _i \alpha _{i1}}{\alpha _{i+1}\alpha _{i1}}, \quad \lambda _{i1} = \frac{\alpha _{i+1} \alpha _i}{\alpha _{i+1}\alpha _{i1}}, \quad \text {and}\quad \frac{c_{i1}}{c_{i+1}} \ge \frac{\lambda _{i1}}{\lambda _{i+1}}. \end{aligned}$$
Proof
Let \({\mathcal {A}}= \{\alpha _1,\ldots ,\alpha _m\}\). By Theorem 5.6, all edge generators of \(C_{[0,\infty )}({\mathcal {A}})\) are either monomials or \(\lambda \)witnessed AGE functions where \(\lambda \) is a reduced \([0,\infty )\)circuit. By Example 5.7, \(\Lambda _{[0,\infty )}^\star ({\mathcal {A}}) = \{\delta _2  \delta _1\} \cup \Lambda _{{\mathbb {R}}}^\star ({\mathcal {A}})\). Since \(n=1\), Proposition 3.4 says all circuits \(\lambda \) have \({{\,\mathrm{supp}\,}}\lambda  \le 3\). We therefore divide the proof into considering cases of monomials, and XAGE functions with two or three terms.
First we address the monomials. Given \(f(x) = \exp (\alpha _i x)\) with \(i > 1\), we can write \(f = f_1 + f_2\) with \(f_1(x) = \exp (\alpha _{i}x)  \exp (\alpha _{i1}x)\) and \(f_2(x) = \exp (\alpha _{i1}x)\) – the summand \(f_1\) is nonnegative on \([0,\infty )\) because \(\alpha _i > \alpha _{i1}\), and \(f_2\) is globally nonnegative. Therefore the only possible extremal monomial in \(C_{[0,\infty )}({\mathcal {A}})\) is \(f(x) = \exp (\alpha _1 x)\). Since \(X = [0,\infty )\), the leading term of any \(g \in C_X({\mathcal {A}})\) must have positive coefficient. Moreover, if g is not proportional to f, the leading term of g must have exponent greater than \(\alpha _1\). Therefore any convex combination of AGE functions \(g \in C_{[0,\infty )}({\mathcal {A}})\) which are not proportional to f must disagree with f(x) in the limit as x tends to infinity. We conclude f is extremal in \(C_{[0,\infty )}({\mathcal {A}})\).
Now we consider the 2term case, where, by Example 5.7, we have to consider signomials of the form \(f(x) = c_2 \exp (\alpha _2 x)  c_1 \exp (\alpha _1 x)\). We observe that f is nonnegative on \([0,\infty )\) if and only if \(c_2 \ge c_1 \ge 0\), and furthermore that such signomials are nonextremal unless \(c_1 = c_2\). To see that \(f(x) = \exp (\alpha _2 x)  \exp (\alpha _1 x)\) is indeed extremal, note that f cannot be written as a convex combination involving any 3term AGE functions, because any conic combination of 3term AGE functions has a leading term with positive coefficient on \(\exp (\alpha _i x)\) for some \(i \ge 3\).
We have already proven cases (1) and (2) of the proposition. Using Example 5.7, we know that any extremal 3term XAGE function belongs to a \(\lambda \)witnessed AGE cone where \(\lambda \) is a reduced \({\mathbb {R}}\)circuit. These reduced \({\mathbb {R}}\)circuits have the property \({{\,\mathrm{supp}\,}}\lambda = \{i1,i,i+1\}\) \(\alpha _{i1}\lambda _{i1}+\alpha _{i+1}\lambda _{i+1} = \alpha _i\), \(\lambda _i = 1\). Any XAGE function with such a witness is nonnegative on all of \({\mathbb {R}}\). Therefore any 3term XAGE function f that is extremal in \(C_{[0,\infty )}({\mathcal {A}})\) is also extremal in \(C_{{\mathbb {R}}}({\mathcal {A}}) \subset C_{[0,\infty )}({\mathcal {A}})\), which (by [17, Prop. 4.4]) implies
We have arrived at the final phase of proving part (3) of this proposition. By the equality case in the AM/GM inequality and using \(\exp (\alpha _i x) = \left( \exp (\alpha _{i+1} x)^{\lambda _{i+1}}\right) \left( \exp (\alpha _{i1} x)^{\lambda _{i1}}\right) \), one finds the unique minimizer \(x^\star \) for functions (24) satisfies
If \(V_i(\lambda ,c) :=(c_{i1}\lambda _{i+1})/(c_{i+1}\lambda _{i1})\) satisfies \(V_i(\lambda ,c) < 1\), then \(x^\star < 0\) and by continuity we have \(\inf \{ f(x) \,:\, x \ge 0 \} > 0\) – hence the condition \(V_i(\lambda ,c) \ge 1\) is necessary for extremality. Furthermore, if \(V_i(\lambda ,c) > 1\), then the unique minimizer of f given by (24) occurs at \(x^\star > 0\). Such f cannot be decomposed as a convex combination which involves 1term or 2term AGE functions (which have \(f(x) > 0\) for \(x > 0\)), and cannot be written as a convex combination consisting solely of 3term AGE functions [17, Proposition 4.4], therefore any f given by (24) with \(V_i(\lambda ,c) > 1\) is extremal in \(C_{[0,\infty )}({\mathcal {A}})\). All that remains is to show extremality of functions (24) with \(V_i(\lambda ,c) = 1\). This follows from the same argument as \(V_i(\lambda ,c) > 1\), but we must use the stationarity condition \(f'(0) = 0\) to preclude using 2term extremal AGE functions in a decomposition of f. \(\square \)
7 Discussion and conclusion
In this article we have introduced a convexgeometric notion of an Xcircuit, which mediates a relationship between point sets \({\mathcal {A}}\subset {\mathbb {R}}^n\) and convex sets \(X \subset {\mathbb {R}}^n\). By showing that this notion of an Xcircuit allows an alternative construction of XSAGE cones (Theorems 4.4 and 5.5) which cannot be relaxed (Theorem 5.6), we have demonstrated that conditional SAGE cones exhibit a substantially richer theory than ordinary SAGE cones. An essential property of this theory is that for general sets X it is not possible to recover an Xcircuit \(\lambda \in \Lambda _X({\mathcal {A}},\beta )\) given only information on the signs of its components. As a consequence of this last point – it is not possible to arrive at the concept of conditional SAGE certificates while relying on a “circuit number” approach using only the support of a given polynomial or signomial.
Two lines of theoretical investigations stand out for future work. First, there is the task of formally situating Xcircuits in the context of matroid theory (in the case when X is a polyhedron). Here one can use an interpretation from Theorem 3.7, that Xcircuits \(\lambda \in \Lambda _X({\mathcal {A}},\beta )\) are outer normal vectors to facets of \({\mathcal {A}}^T X + N_\beta ^\circ \). A broader area of followup work is indepth analysis of multiplicativelyconvex sets \(S \subset {\mathbb {R}}^m_+\) for which \(\log (S) = \{ t \,:\, \exp t \in S \}\) is convex. Some properties of this class of sets include closure under intersection, and closure under the inducedcone operation.
It is of interest to explore the use of the cones \(C_X({\mathcal {A}},\lambda )\) when \(\lambda \) is not an Xcircuit. Given a signomial \(\sum _{\alpha \in {\mathcal {A}}}c_{\alpha }\mathrm{e}^{\alpha }\) with numerical XSAGE certificate \(\{(c^{(\beta )},\nu ^{(\beta )})\}_{\beta \in {\mathcal {A}}}\), \(c^{(\beta )}\in C_X({\mathcal {A}},\beta )\), \(c \approx \sum _{\beta \in {\mathcal {A}}} c^{(\beta )}\), one could refine this certificate to higher precision by solving the powercone program to decompose c as a sum of vectors in \(C_X({\mathcal {A}},\lambda ^{(\beta )})\) for \(\lambda ^{(\beta )} = \nu ^{(\beta )}/\nu ^{(\beta )}_{\beta }\). This would be helpful for large scale problems where \(\{(c^{(\beta )}, \nu ^{(\beta )})\}_{\beta \in {\mathcal {A}}}\) is computed with a firstorder solver, or when X is an especially complicated spectrahedron. In the latter case, the standard description of \(C_X({\mathcal {A}})\) would be a mixed semidefinite and relative entropy program, while the formulations for \(C_X({\mathcal {A}},\lambda ^{(\beta )})\) would be pure power cone programs.
The two obstacles to using Theorem 5.6 in computation are that \(\Lambda _X^\star ({\mathcal {A}})\) can be exponential in \({\mathcal {A}}\) even when \(X={\mathbb {R}}^n\), and that finding Xcircuits requires a procedure to identify extreme rays of a polyhedral cone. It is not known how severe this first problem is in practice. For the second problem one could focus on XSAGE polynomials where \(X=[1,1]^n\) or \(X=[0,1]^n\). The cones of such polynomials on \({\mathcal {A}}\subset {\mathbb {N}}^n\) are represented by \(C_Y({\mathcal {A}})\) for , and finding \(\Lambda _Y^\star ({\mathcal {A}})\) is made easier by the fact that Y is a cone. The main benefit of this approach for polynomials is the prospect of computing conditional SAGE decompositions in exact arithmetic, especially for sparse polynomials of high degree.
We conclude by noting that although the “pure” conditional SAGE methodology is used only for convex constraint sets, additional nonconvex constraints can be accommodated with algebraic techniques. This can partly be seen in the original work of Chandrasekaran and Shah [4] and more so in the recent work [9].
Notes
When parsing \(C_X({\mathcal {A}},\beta )\) and \(C_X({\mathcal {A}},\lambda )\), the reader should note that \(\beta \) and \(\lambda \) live in different spaces.
References
Agrawal, A., Diamond, S., Boyd, S.: Disciplined geometric programming. Optim. Lett. 13(5), 961–976 (2019)
Averkov, G.: Optimal size of linear matrix inequalities in semidefinite approaches to polynomial optimization. SIAM J. Appl. Algebra Geom. 3(1), 128–151 (2019)
BenTal, A., Nemirovski, A.: Lectures on Modern Convex Optimization. SIAM, Philadelphia (2001)
Chandrasekaran, V., Shah, P.: Relative entropy relaxations for signomial optimization. SIAM J. Optim. 26(2), 1147–1173 (2016)
Dahl, J., Andersen, E.: A primaldual interiorpoint algorithm for nonsymmetric exponentialcone optimization. Math. Program. (2021)
Dickinson, P., Povh, J.: On an extension of Pólya’s Positivstellensatz. J. Glob. Optim. 61, 615–625 (2015)
Dressler, M., Iliman, S., de Wolff, T.: A Positivstellensatz for sums of nonnegative circuit polynomials. SIAM J. Appl. Algebra Geom. 1(1), 536–555 (2017)
Dressler, M., Kurpisz, A., de Wolff, T.: Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials. In: 43rd International Symposium on Mathematical Foundations of Computer Science, Volume 117 of LIPIcs. Leibniz Int. Proc. Inform., pp. 82:1–82:17. Schloss Dagstuhl (2018)
Dressler, M., Murray, R.: Algebraic perspectives on signomial optimization. Preprint arXiv:2107.00345 (2021)
Ergür, A.A., Paouris, G., Rojas, J.M.: Tropical varieties for exponential sums. Math. Ann. 377, 863–882 (2020)
Fillastre, F., Izmestiev, I.: Shapes of polyhedra, mixed volumes and hyperbolic geometry. Mathematika 63(1), 124–183 (2017)
Forsgård, J., de Wolff, T.: The algebraic boundary of the SONC cone. Preprint arXiv:1905.04776 (2019)
Gelfand, I.M., Kapranov, M.M., Zelevinsky, A.V.: Discriminants, Resultants, and Multidimensional Determinants. Springer, New York (1994)
Iliman, S., de Wolff, T.: Amoebas, nonnegative polynomials and sums of squares supported on circuits. Res. Math. Sci. 3, 9 (2016)
Jarczyk, W., Matkowski, J.: On Mulholland’s inequality. Proc. Am. Math. Soc. 130(11), 3243–3247 (2002)
Karaca, O., Darivianakis, G., Beuchat, P., Georghiou, A., Lygeros, J.: The REPOP toolbox: tackling polynomial optimization using relative entropy relaxations. In: 20th IFAC World Congress, IFAC PapersOnLine, vol. 50, no. 1, 11652–11657 (2017)
Katthän, L., Naumann, H., Theobald, T.: A unified framework of SAGE and SONC polynomials and its duality theory. Math. Comput. 90, 1297–1322 (2021)
Lasserre, J.B.: Moments, Positive Polynomials and Their Applications. Imperial College Press, London (2010)
Müller, S., Feliu, E., Regensburger, G., Conradi, C., Shiu, A., Dickenstein, A.: Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry. Found. Comp. Math. 16(1), 69–97 (2015)
Müller, S., Hofbauer, J., Regensburger, G.: On the bijectivity of families of exponential/generalized polynomial maps. SIAM J. Appl. Algebra Geom. 3(3), 412–438 (2019)
Murray, R.: Sageopt 0.5.3 (2020). https://doi.org/10.5281/ZENODO.4017991
Murray, R.: Applications of convex analysis to signomial and polynomial nonnegativity problems. Ph.D. thesis, California Institute of Technology, 6 (2021)
Murray, R., Chandrasekaran, V., Wierman, A.: Newton polytopes and relative entropy optimization. Found. Comput. Math. 21, 1703–1737 (2021)
Murray, R., Chandrasekaran, V., Wierman, A.: Signomial and polynomial optimization via relative entropy and partial dualization. Math. Program. Comput. 13, 257–295 (2021)
Murty, K.G., Kabadi, S.N.: Some NPcomplete problems in quadratic and nonlinear programming. Math. Program. 39(2), 117–129 (1987)
Naumann, H., Theobald, T.: The \({\cal{S}}\)cone and a primaldual view on secondorder representability. Beiträge Algebra Geom. 62, 229–249 (2021)
Naumann, H., Theobald, T.: Sublinear circuits for polyhedral sets. Vietnam J. Math. (2022)
Niculescu, C.P.: Convexity according to the geometric mean. Math. Inequal. Appl. 3, 155–167 (2000)
Nowzari, C., Preciado, V.M., Pappas, G.J.: Optimal resource allocation for control of networked epidemic models. IEEE Trans. Control Netw. Syst. 4(2), 159–169 (2017)
Özdemir, M., Yildiz, Ç., Gürbüz, M.: A note on geometrically convex functions. J. Inequal. Appl. 2014(1), 180 (2014)
Öztürk, B., Saab, A.: Optimal aircraft design decisions under uncertainty via robust signomial programming. In: AIAA Aviation 2019 Forum. American Institute of Aeronautics and Astronautics, article no. 20193351 (2019)
Pantea, C., Koeppl, H., Craciun, G.: Global injectivity and multiple equilibria in uni and bimolecular reaction networks. Discrete Contin. Dyn. Syst. Ser. B 17(6), 2153–2170 (2012)
Papp, D.: Duality of sum of nonnegative circuit polynomials and optimal SONC bounds. Preprint arXiv:1912.04718 (2019)
Powers, V., Wörmann, T.: An algorithm for sums of squares of real polynomials. J. Pure Appl. Algebra 127(1), 99–104 (1998)
Preciado, V.M., Zargham, M., Enyioha, C., Jadbabaie, A., Pappas, G.J.: Optimal resource allocation for network protection against spreading processes. IEEE Trans. Control Netw. Syst. 1(1), 99–108 (2014)
Reznick, B.: Forms derived from the arithmeticgeometric inequality. Math. Ann. 283(3), 431–464 (1989)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1997)
Sturmfels, B.: Gröbner Bases and Convex Polytopes. American Mathematical Society, Providence (1996)
Wang, A.H., Jaini, P., Yu, Y., Poupart, P.: A Positivstellensatz for conditional SAGE signomials. Preprint arXiv:2003.03731 (2020)
Wang, J.: Nonnegative polynomials and circuit polynomials. SIAM J. Appl. Algebra Geom. (2022)
Wang, J., Magron, V.: A second order cone characterization for sums of nonnegative circuits. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC), pp. 450–457. ACM (2020)
York, M., Hoburg, W., Drela, M.: Turbofan engine sizing and tradeoff analysis via signomial programming. J. Aircr. 55(3), 988–1003 (2018)
Ziegler, G.M.: Lectures on Polytopes. Springer, New York (1995)
Acknowledgements
This work would not have been possible without an invitation from Bernd Sturmfels for R.M. to visit The Max Planck Institute for Mathematics in the Sciences (Leipzig, Germany) in late 2019. R.M. was supported by an NSF Graduate Research Fellowship, and T.T. was supported by DFG Grant TH 1333/71. We thank the anonymous referees for their constructive feedback.
Funding
Open Access funding enabled and organized by Projekt DEAL.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
1.1 Propositions regarding convex analysis
The following pair of propositions are used in the proofs of Theorem 4.4 and Lemma 5.11.
Proposition 8.1
For fixed \(\lambda \) in the interior of the mdimensional probability simplex and \(c = (c_0,c_1,\ldots ,c_m) \in {\mathbb {R}}^{m+1}\) with , we have
where \(\nu \parallel \lambda \) means \(\nu \) is proportional to \(\lambda \).
Proof
The claim is trivial when \(c_0 \ge 0\), and so we consider \(c_0 < 0\). Note that in this case, \(\prod _{i=1}^m \left[ c_i / \lambda _i \right] ^{\lambda _i}\) must be positive, and \(D(\nu ,c_{{\setminus } 0})\) must be finite: both of these conditions occur precisely when \(c_i > 0\) for all \(1 \le i \le m\). We therefore can rewrite \(c_0 = c_0  \le \prod _{i=1}^m \left[ c_i / \lambda _i \right] ^{\lambda _i}\) as \(1 \le \prod _{i=1}^m \left[ c_i / (c_0\lambda _i) \right] ^{\lambda _i}\), and by taking the log of both sides, obtain \(D(\nu ,c_{{\setminus } 0})  \mathbbm {1}^T \nu \le c_0\) for \(\nu = c_0\lambda \). For the other direction, one may write the proportionality relationship \(\nu \parallel \lambda \) as \(\nu = s \lambda \), and minimize \(D(s \lambda ,c_{{\setminus } 0})  s\) over \(s \ge 0\) to obtain \(\prod _{i=1}^m \left[ c_i / \lambda _i \right] ^{\lambda _i}\). \(\square \)
Proposition 8.2
Suppose is compact (not necessarily convex) and set \(T = {{\,\mathrm{co}\,}}S\). If it is known apriori that \({{\,\mathrm{cl}\,}}T\) contains no lines, then \(T = {{\,\mathrm{cl}\,}}T\) is closed.
Proof
Since \({{\,\mathrm{cl}\,}}T\) is pointed, there exists a distinguished element \(t^\star \in T\) for which \((t^\star )^T t > 0\) for all . Consider the set \(H = \{ t \in T \,:\, (t^{\star })^T t = 1 \}\) – it is clear that H is bounded, \({{\,\mathrm{co}\,}}H = T\), and \(0 \not \in H\). If H is closed, then by [37, Corollary 9.6.1] we will have that \({{\,\mathrm{co}\,}}H = T\) is also closed. We show that H is closed by directly considering sequences in H. We express these sequences with the help of the mfold Cartesian product \(S^{m} = S \times \cdots \times S\).
Let \((h^{(k)})_{k \in {\mathbb {N}}} \subset H\) have a limit in \({\mathbb {R}}^m\). Since H is of dimension at most \(m1\) and is generated by S, Carathéodory’s Theorem tells us that there exists a vector \(\lambda ^{(k)} \in {\mathbb {R}}^m_+\) and a block vector \(q^{(k)} =(s^{(k)}_1,\ldots ,s^{(k)}_m) \in S^m\) where
Since S is compact, the continuous function \(s \mapsto (t^\star )^T s\) attains a minimum on \(s^\star \in S\) – since S does not contain zero, we have that \((t^\star )^T(s^\star ) = a > 0\). It follows that each \(\lambda ^{(k)}_i\) appearing in the expression for \(h^{(k)}\) is bounded above by \(1/a < \infty \). The sequences \((\lambda ^{(k)})_{k \in {\mathbb {N}}} \subset [0,1/a]^m\) and \((q^{(k)})_{k \in {\mathbb {N}}} \subset S^m\) are bounded, and therefore \(((\lambda ^{(k)},q^{(k)}))_{k \in {\mathbb {N}}}\) has a convergent subsequence. The limits \(\lambda ^{(\infty )}\) and \(q^{(\infty )}\) of these convergent subsequences must belong to \([0,1/a]^m\) and \(S^m\), respectively. By continuity, we have
hence \(h^{(\infty )} \in H\). Since we have shown that all convergent sequences in H converge to a point in H, we have that H is closed. \(\square \)
Our next proposition is provided for the reader’s convenience.
Proposition 8.3
Let \(X \subset {\mathbb {R}}^n\) be a convex cone and consider a matrix A in \({\mathbb {R}}^{n \times m}\). We have \((A^T X)^* = \ker A + A^\dagger X^*\), where \(A^\dagger \in {\mathbb {R}}^{m \times n}\) is the MoorePenrose pseudoinverse of A.
Proof
Because \(A^T X\) is contained in the subspace \({{\,\mathrm{range}\,}}A^T\), its dual cone is invariant under translation by vectors in the orthogonal complement \(({{\,\mathrm{range}\,}}A^T)^\perp = \ker A\). In particular, \((A^T X)^* = \ker A + K\) for a convex cone \(K \subset {{\,\mathrm{range}\,}}A^T\). We need to show that \(K = A^\dagger X^*\).
The definition of the MoorePenrose pseudoinverse ensures that \(y \in {{\,\mathrm{range}\,}}A^T\) holds if and only if \(A^\dagger A y = y\). We can therefore compute K as follows
The transitions from line to line are as follows. First, substitute \(A^\dagger A y\) for y, express \(z = A^T x\) for some \(x \in X\), and rewrite \(y^T (A^T x) = (A y)^T x\). Then, substitute \(w :=A y\) and simplify the expression for the range of \(A^T\). Finally, apply the definition of the dual cone \(X^*\) and use the pseudoinverse identity \(A^\dagger A A^\dagger x = A^\dagger x\) for all \(x \in {\mathbb {R}}^n\). \(\square \)
1.2 Definitions from convex analysis
A face of a convex set \(S \subset {\mathbb {R}}^n\) is any closed convex \(F \subset S\) with the following property: if the line segment \([s_1,s_2] :=\{ \lambda s_1 + (1\lambda ) s_2 \,:\, 0 \le \lambda \le 1\}\) is contained in S and the relative interior of \([s_1,s_2]\) hits F, then the entirety of \([s_1,s_2]\) is contained in F. The dimension \(\dim S\) of a convex set S is the dimension of the smallest affine space containing S. Every nonempty convex set S has a nonempty relative interior \({{\,\mathrm{ri}\,}}S\), which is the interior of S under the topology induced by its affine hull. A set \(K \subset {\mathbb {R}}^n\) is called a cone if it is closed under dilation: \(\{ \lambda x \,:\, x \in K\} \subset K\) for all \(\lambda > 0\). The extreme rays of a pointed convex cone K are its faces of dimension one. To any convex cone K we associate the dual cone \(K^* :=\{y\,:\, y^T x \ge 0 \,\forall \,x\in K\}\) and the polar \(K^\circ = K^*\). The conic hull of a set S, denoted \({{\,\mathrm{co}\,}}S\), is the set formed by adjoining the origin to the smallest convex cone containing S.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Murray, R., Naumann, H. & Theobald, T. Sublinear circuits and the constrained signomial nonnegativity problem. Math. Program. 198, 471–505 (2023). https://doi.org/10.1007/s1010702201776w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s1010702201776w
Keywords
 Sums of arithmeticgeometric exponentials
 Positive signomials
 Exponential sums
 Sums of nonnegative circuit polynomials (SONC)
 Positive polynomials
 Multiplicative convexity
 Log convex sets
Mathematics Subject Classification
 Primary 14P05
 90C23
 90C30
 Secondary 05B35
 52A20