Title :
What Does a Deterministic Algorithm Need to Do to Locate a Global Optimizer?
Author :
Sun, M. ; Yang, X.
Author_Institution :
Dept. of Math., Alabama Univ., Tuscaloosa, AL
Abstract :
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
Keywords :
deterministic algorithms; optimisation; deterministic algorithm; division-deletion algorithm; global optimization problems; Artificial neural networks; Constraint optimization; Convergence; Heuristic algorithms; Least squares methods; Mathematics; Prototypes; Stochastic processes; Sufficient conditions; Sun;
Conference_Titel :
System Theory, 2006. SSST '06. Proceeding of the Thirty-Eighth Southeastern Symposium on
Conference_Location :
Cookeville, TN
Print_ISBN :
0-7803-9457-7
DOI :
10.1109/SSST.2006.1619128
