Papers
Topics
Authors
Recent
Search
2000 character limit reached

The dual cone of sums of non-negative circuit polynomials

Published 20 Sep 2018 in math.OC | (1809.07648v2)

Abstract: For a non-empty, finite subset $\mathcal{A} \subseteq \mathbb{N}0n$, denote by $C{\text{sonc}}(\mathcal{A}) \in \mathbb{R}[x_1, \ldots, x_n]$ the cone of sums of non-negative circuit polynomials with support $\mathcal{A}$. We derive a representation of the dual cone $(C_{\text{sonc}}(\mathcal{A}))*$ and deduce a resulting optimality criterion for the use of sums of non-negative circuit polynomials in polynomial optimization.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.