@inbook{d63eb923b6a44a7682c2cd54cba7734b,
title = "On the convergence of localisation search",
abstract = "Localisation Search, a generalisation of Pure Adaptive Search, is a stochastic global optimisation algorithm in which iterates are chosen randomly from a superset, or localisation, of the improving region. Recent theoretical results are applied to determine how closely the localisation must track the improving region in order that the number of function evaluations to convergence increases at most polynomially with dimension, for Lipschitz objective functions and uniformly bounded domains.",
keywords = "global optimization, algorithm complexity , random search, adaptive search , localisation, Lipschitz function",
author = "David Bulger and Graham Wood",
year = "1996",
doi = "10.1007/978-1-4613-3437-8_15",
language = "English",
isbn = "9781461334392",
volume = "7",
series = "Nonconvex Optimization and Its Applications",
publisher = "Springer, Springer Nature",
pages = "227--233",
editor = "Chris Floudas and Panos Pardalos",
booktitle = "State of the Art in Global Optimisation",
address = "United States",
}