Lower Bounds for Polynomials via Circuit Polynomials

Henning Seidler (TU Berlin)

Finding the minimum of a multivariate real polynomial is a well-known hard problem with various applications. We present an implementation to approximate lower bounds via sums of non-negative circuit polynomials (SONCs). We provide a test-suite, where we compare our approach with the established method sums of squares (SOS). It turns out that the circuit polynomials yield bounds competitive to SOS in several cases, but using much less time and memory.

Back to the research colloquium site.