Abstract. We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x):R n → R, as well as the global minimum of p(x), in a compact set K defined bypolynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex li...
No comments yet
Be the first to share your thoughts!