Expected hitting times for Backtracking Adaptive Search

DOI10.1080/02331930410001699351MaRDI QIDQ4822673zbMATHOpenAlexFDO

Authors W. P. Baritompa, David Bulger, David Alexander, Graham R. Wood, Zelda B. Zabinsky

Publication date 25 October 2004

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930410001699351

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms (68W40) Stochastic programming (90C15)

Recommendations

• Expected search duration for finite backtracking adaptive search
• Backtracking adaptive search: distribution of number of iterations to convergence
• Generating functions and the performance of backtracking adaptive search
• Tail bounds on hitting times of randomized search heuristics using variable drift analysis
• Efficiency of randomized parallel backtrack search
• Adaptive stochastic search
• Heuristics for search sequencing under time-dependent probabilities of existence
• Expected Performance of m-Solution Backtracking
• Concentrated hitting times of randomized search heuristics with variable drift
• scientific article; zbMATH DE number 67459

Cites work

• Pure adaptive search in Monte Carlo optimization
• Pure adaptive search in global optimization

Cited in

(5)

• Generating functions and the performance of backtracking adaptive search
• Approximation of the distribution of convergence times for stochastic global optimisation
• Backtracking adaptive search: distribution of number of iterations to convergence
• Expected search duration for finite backtracking adaptive search
• Hesitant adaptive search: The distribution of the number of iterations to convergence

This page was built for publication: Expected hitting times for Backtracking Adaptive Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4822673)