Relative Entropy Methods in Constrained Polynomial and Signomial Optimization

Thorsten Theobald ()
Additional contact information
Thorsten Theobald: Goethe-Universität

A chapter in Polynomial Optimization, Moments, and Applications, 2023, pp 23-51 from Springer

Abstract: Abstract Relative entropy programs belong to the class of convex optimization problems. Within techniques based on the arithmetic-geometric mean inequality, they facilitate to compute nonnegativity certificates of polynomials and of signomials. While the initial focus was mostly on unconstrained certificates and unconstrained optimization, recently, Murray, Chandrasekaran and Wierman developed conditional techniques, which provide a natural extension to the case of convex constrained sets. This expository article gives an introduction into these concepts and explains the geometry of the resulting conditional SAGE cone. To this end, we deal with the sublinear circuits of a finite point set in ℝ n $$\mathbb {R}^n$$ , which generalize the simplicial circuits of the affine-linear matroid induced by a finite point set to a constrained setting.

Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-38659-6_2

Ordering information: This item can be ordered from
http://www.springer.com/9783031386596

DOI: 10.1007/978-3-031-38659-6_2

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().