Pure adaptive search for finite global optimization
From MaRDI portal
Publication:1906281
DOI10.1007/BF01585570zbMath0839.90099OpenAlexW1968091701MaRDI QIDQ1906281
W. P. Baritompa, Zelda B. Zabinsky, Mike A. Steel, Graham R. Wood
Publication date: 12 February 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585570
global optimizationMarkov chainsrandom searchstochastic algorithmpure adaptive searchalgorithm complexity
Related Items (6)
The robust constant and its applications in random global search for unconstrained global optimization ⋮ Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise ⋮ Implementing pure adaptive search with Grover's quantum algorithm ⋮ Combining a local search and Grover's algorithm in black-box global optimization ⋮ Using modifications to Grover's search algorithm for quantum global optimization ⋮ Hesitant adaptive search for global optimisation
Cites Work
This page was built for publication: Pure adaptive search for finite global optimization