22 citations · 58 across the 13 of their papers we have counts for
Showing 2018 · math.OCShow all
2 papers · 2 filters
math.OC2018★ 22 cited
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…
math.OC2018
On the Complexity of Detecting Convexity over a Box
Amir Ali Ahmadi, Georgina Hall
It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is…