Outer approximation by polyhedral convex sets (Q1101351): Difference between revisions

This paper deals with outer approximation methods for solving possibly multiextremal global optimization problems. A general theorem on convergence is presented and new classes of outer approximation methods using polyhedral convex sets are derived. The underlying theory is then related to the cut map-separator theory of \textit{B. C. Eaves} and \textit{W. I. Zangwill} [SIAM J. Control 9, 529-542 (1971)]. Two constraint dropping strategies are deduced.