Optimization over Nonnegative and Convex Polynomials With and Without Semidefinite Programming

Georgina Hall

The problem of optimizing over the cone of nonnegative polynomials is a fundamental problem in computational mathematics, with applications to polynomial optimization, control, mac…