Deterministic GO algorithms

  • Eligius M. T. HendrixEmail author
  • Boglárka G.-Tóth
Part of the Springer Optimization and Its Applications book series (SOIA, volume 37)


The main concept of deterministic global optimization methods is that in the generic algorithm description (4.1), the next iterate does not depend on the outcome of a pseudo random variable. Such a method gives a fixed sequence of steps when the algorithm is repeated for the same problem. There is not necessarily a guarantee to reach the optimum solution. Many approaches such as grid search, random function approaches and the use of Sobol numbers are deterministic without giving a guarantee. In Section 6.2 we discuss the deterministic heuristic direct followed by the ideas of stochastic models and response surface methods in Section 6.3. After that we will focus on methods reported in the literature that expose the following characteristics.


Response Surface Radial Basis Function Minimum Point Mathematical Structure Interval Arithmetic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Department of Computer ArchitectureMálaga UniversityMálagaSpain
  2. 2.Department of Differential EquationsBudapest University of Technology and EconomicsBudapestHungary

Personalised recommendations