Abstract
We consider stochastic methods as those algorithms that use (pseudo) random numbers in the generation of new trial points. The algorithms are used a lot in applications. Compared to deterministic methods they are often easy to implement. On the other hand, for many applied algorithms no theoretical background is given that the algorithm is effective and converges to a global optimum. Furthermore, we still do not know very well how fast the algorithms converge. For the effectiveness question, Törn and Žilinskas (1989) already stress that one should sample “everywhere dense”. This concept is as difficult with increasing dimension as doing a simple grid search. In Section 7.2 we describe some observations that have been found by several researchers on the question of increasing dimensions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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). Stochastic 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_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-88670-1_7
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)