Browsing by Subject "algebraic geometry, computation, complexity, optimization, SOS, sums of squares, convexity, applied mathematics, orbits of polynomials"
Now showing items 1-1 of 1
-
(2010-01-16)To prove that a polynomial is nonnegative on Rn, one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semi-definite programming (SDP) computation that ...