Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 79 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 99 tok/s Pro
Kimi K2 199 tok/s Pro
GPT OSS 120B 444 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

The dual cone of sums of non-negative circuit polynomials (1809.07648v2)

Published 20 Sep 2018 in math.OC

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

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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