# Certifying polynomial nonnegativity via hyperbolic optimization

## TL;DR

This paper introduces a novel method for certifying polynomial nonnegativity using hyperbolic optimization, expanding the toolkit beyond sum of squares and revealing new properties of hyperbolic polynomials.

## Contribution

It develops hyperbolic certificates of nonnegativity from hyperbolic polynomials and analyzes their differences from sums of squares, including explicit examples and complexity results.

## Key findings

- Hyperbolic certificates can certify nonnegativity beyond sums of squares.
- Existence of hyperbolic polynomials with certificates not representable as sums of squares for certain degrees and variables.
- Deciding hyperbolicity of a cubic polynomial is co-NP hard.

## Abstract

We describe a new approach to certifying the global nonnegativity of multivariate polynomials by solving hyperbolic optimization problems---a class of convex optimization problems that generalize semidefinite programs. We show how to produce families of nonnegative polynomials (which we call hyperbolic certificates of nonnegativity) from any hyperbolic polynomial. We investigate the pairs $(n,d)$ for which there is a hyperbolic polynomial of degree $d$ in $n$ variables such that an associated hyperbolic certificate of nonnegativity is not a sum of squares. If $d\geq 4$ we show that this occurs whenever $n\geq 4$. In the degree three case, we find an explicit hyperbolic cubic in $43$ variables that gives hyperbolic certificates that are not sums of squares. As a corollary, we obtain the first known hyperbolic cubic no power of which has a definite determinantal representation. Our approach also allows us to show that, given a cubic $p$, and a direction $e$, the decision problem "Is $p$ hyperbolic with respect to $e$?" is co-NP hard.