## Authors: Mareike Dressler, Adam Kurpisz and Timo de Wolff

## Paper Information

Title: | Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials |

Authors: | Mareike Dressler, Adam Kurpisz and Timo de Wolff |

Proceedings: | PC Abstracts |

Editors: | Jan Johannsen and Olaf Beyersdorff |

Keywords: | nonnegativity certificate, hypercube optimization, sums of nonnegative circuit polynomials, relative entropy programming, sums of squares |

Abstract: | ABSTRACT. Various key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove complexity bounds for these types of problems are based on sums of squares (SOS) as nonnegativity certificates. In this article, we initiate optimization problems over the boolean hypercube via a recent, alternative certificate called sums of nonnegative circuit polynomials (SONC). We show that key results for SOS based certificates remain valid: First, for polynomials, which are nonnegative over the $n$-variate boolean hypercube with constraints of degree $d$ there exists a SONC certificate of degree at most $n+d$. Second, if there exists a degree $d$ SONC certificate for nonnegativity of a polynomial over the boolean hypercube, then there also exists a short degree $d$ SONC certificate, that includes at most $n^{O(d)}$ nonnegative circuit polynomials. Finally, we show certain differences between SOS and SONC cones namely, we prove, that in opposite to SOS, SONC cone is not closed under taking affine transformation of variables and that for SONC there does not exist an equivalent to Putinar's Positivestellensatz for SOS. We discuss these results both from algebraic and optimization perspective. |

Pages: | 2 |

Talk: | Jul 08 17:00 (Session 42N) |

Paper: |