Generating functions and the performance of backtracking adaptive search

DOI10.1007/s10898-006-9042-zzbMath1143.90029MaRDI QIDQ995932

David W. Bulger, W. P. Baritompa, Graham R. Wood

Publication date: 10 September 2007

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-006-9042-z

zbMATH Keywords

global optimization; Markov process; hesitant adaptive search; backtracking; Adaptive search

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C29: Multi-objective and goal programming

90C15: Stochastic programming

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise, Markov modelling and parameterisation of genetic evolutionary test generations

Cites Work

• Approximation of the distribution of convergence times for stochastic global optimisation
• Backtracking adaptive search: distribution of number of iterations to convergence
• Pure adaptive search in global optimization
• Hesitant adaptive search for global optimisation
• Implementing pure adaptive search with Grover's quantum algorithm
• Hesitant adaptive search: The distribution of the number of iterations to convergence
• Implementing pure adaptive search for global optimization using Markov chain sampling