The cone of polynomials nonnegative on K
Lists
Only you see this
Abstract
Recall from Chapter 2 that the convex cone Cd ⊂ ℝ[x]2d of nonnegative polynomials of degree at most 2d (a nonnegative polynomial has necessarily even degree) is much harder to characterize than its subcone ∑[x]d of sums of squares (SOS). Indeed, while we have seen that the latter has a simple semidefinite representation in a higher dimensional space, so far there is no such simple representation for the former. In addition, when d is fixed Blekherman (2006) has shown that after proper normalization, the “gap” between Cd and Σ[x]d increases unboundedly with the number of variables.
BibTeX
@inproceedings{lasserre2015cone,
author = {Jean B. Lasserre},
title = {{The cone of polynomials nonnegative on <b>K</b>}},
booktitle = {Cambridge},
year = {2015},
doi = {10.1017/cbo9781107447226.005},
}Loading related content...