Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Hendrix, E.M.T., G.-Tóth, B. (2010). Deterministic GO algorithms. In: Introduction to Nonlinear and Global Optimization. Springer Optimization and Its Applications, vol 37. Springer, New York, NY. https://doi.org/10.1007/978-0-387-88670-1_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-88670-1_6
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-88669-5
Online ISBN: 978-0-387-88670-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)