English

A Positivstellensatz for Conditional SAGE Signomials

Optimization and Control 2020-10-27 v4 Machine Learning Algebraic Geometry

Abstract

Recently, the conditional SAGE certificate has been proposed as a sufficient condition for signomial positivity over a convex set. In this article, we show that the conditional SAGE certificate is complete\textit{complete}. That is, for any signomial f(x)=j=1cjexp(Ajx)f(\mathbf{x}) = \sum_{j=1}^{\ell}c_j \exp(\mathbf{A}_j\mathbf{x}) defined by rational exponents that is positive over a compact convex set X\mathcal{X}, there is pZ+p \in \mathbb{Z}_+ and a specific positive definite function w(x)w(\mathbf{x}) such that w(x)pf(x)w(\mathbf{x})^p f(\mathbf{x}) may be verified by the conditional SAGE certificate. The completeness result is analogous to Positivstellensatz results from algebraic geometry, which guarantees representation of positive polynomials with sum of squares polynomials. The result gives rise to a convergent hierarchy of lower bounds for constrained signomial optimization over an arbitrary\textit{arbitrary} compact convex set that is computable via the conditional SAGE certificate.

Keywords

Cite

@article{arxiv.2003.03731,
  title  = {A Positivstellensatz for Conditional SAGE Signomials},
  author = {Allen Houze Wang and Priyank Jaini and Yaoliang Yu and Pascal Poupart},
  journal= {arXiv preprint arXiv:2003.03731},
  year   = {2020}
}

Comments

19 pages, preprint

R2 v1 2026-06-23T14:07:48.969Z