What Does a Deterministic Algorithm Need to Do to Locate a Global Optimizer?
Min Sun, Xiaoli Yang · 2006
Presented in this article is a prototype of a general deterministic algorithm referred to as division-deletion algorithm (DDA) for solving a general class of global optimization problems. DDA shows what a deterministic algorithm needs to do to locate a global optimizer. Four categories of conditions for the convergence of the algorithm are outlined. As an example of its application, we have used an interval algorithm for constrained global optimization