Some Applications of a Polynomial Inequality to Global Optimization.

In this paper, we use the Ehlich-Zeller-G9ärtel inequality to derive an algorithm for finding the global minima of polynomials over hyperrectangles as well as to provide a bounding method for the branch-and-bound algorithm. The latter application of the inequality results in an improved algorithm which gives simultaneously a decreasing upper bound and an increasing lower bound for the global minimum at each iteration. The algorithm can be used also to find the Lipschitz constant of a polynomial. [ABSTRACT FROM AUTHOR]