Deterministic GO algorithms

Eligius M. T. Hendrix () and Boglárka G.-Tóth ()
Additional contact information
Eligius M. T. Hendrix: Málaga University
Boglárka G.-Tóth: Budapest University of Technology and Economics

Chapter 6 in Introduction to Nonlinear and Global Optimization, 2010, pp 137-170 from Springer

Abstract: 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.

Keywords: Response Surface; Radial Basis Function; Minimum Point; Mathematical Structure; Interval Arithmetic (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-88670-1_6

Ordering information: This item can be ordered from
http://www.springer.com/9780387886701

DOI: 10.1007/978-0-387-88670-1_6

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().