Article Outline
Keywords
See also
References
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Calvin J (1997) Average performance of a class of adaptive algorithms for global optimization. Ann Appl Probab 7:711–730
Calvin J (2001) AÂ one-dimensional optimization algorithm and its convergence rate under the Wiener measure. JÂ Complexity
Kushner H (1962) A versatile stochastic model of a function of unknown and time varying form. J Math Anal Appl 5:150–167
Novak E (1988) Deterministic and stochastic error bounds in numerical analysis. Lecture Notes in Mathematics, vol 1349. Springer, Berlin
Ritter K (1990) Approximation and optimization on the Wiener space. J Complexity 6:337–364
Törn A, Žilinskas A (1989) Global optimization. Springer, Berlin
Žilinskas A (1985) Axiomatic characterization of global optimization algorithm and investigation of its search strategy. OR Lett 4:35–39
Wasilkowski G (1992) On average complexity of global optimization problems. Math Program 57:313–324
Zhigljavsky A (1991) Theory of global random search. Kluwer, Dordrecht
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Calvin, J.M. (2008). Adaptive Global Search . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-74759-0_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74758-3
Online ISBN: 978-0-387-74759-0
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering