Skip to Main content Skip to Navigation
Journal articles

EXACT OPTIMIZATION VIA SUMS OF NONNEGATIVE CIRCUITS AND SUMS OF AM/GM EXPONENTIALS

Abstract : We provide two hybrid numeric-symbolic optimization algorithms, computing exact sums of nonnegative circuits (SONC) and sums of arithmetic-geometric-exponentials (SAGE) decompositions. Moreover, we provide a hybrid numeric-symbolic decision algorithm for polynomials lying in the interior of the SAGE cone. Each framework , inspired by previous contributions of Parrilo and Peyrl, is a rounding-projection procedure. For a polynomial lying in the interior of the SAGE cone, we prove that the decision algorithm terminates within a number of arithmetic operations, which is polynomial in the degree and number of terms of the input, and singly exponential in the number of variables. We also provide experimental comparisons regarding the implementation of the two optimization algorithms.
Complete list of metadatas

Cited literature [46 references]  Display  Hide  Download

https://hal.laas.fr/hal-02006899
Contributor : Victor Magron <>
Submitted on : Monday, February 4, 2019 - 10:56:59 PM
Last modification on : Tuesday, March 10, 2020 - 5:25:45 PM
Document(s) archivé(s) le : Sunday, May 5, 2019 - 4:30:21 PM

File

exactsonc_ArXiv1.pdf
Files produced by the author(s)

Identifiers

Citation

Victor Magron, Henning Seidler, Timo de Wolff. EXACT OPTIMIZATION VIA SUMS OF NONNEGATIVE CIRCUITS AND SUMS OF AM/GM EXPONENTIALS. ACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2019, ⟨10.1145/3326229.3326271⟩. ⟨hal-02006899⟩

Share

Metrics

Record views

80

Files downloads

112