Search
Now showing items 1-1 of 1
Nonconvex programming for polynomials
(1971)
This dissertation develops a numerical solution to the problem of maximizing a polynomial, not necessarily concave, over the closure of a bounded domain in the n-dimensional Euclidean space. As an essential part of this ...