Stopping and restarting strategy for stochastic sequential search in global optimization
From MaRDI portal
Publication:2269595
DOI10.1007/s10898-009-9425-zzbMath1188.90204MaRDI QIDQ2269595
Zelda B. Zabinsky, David W. Bulger, Charoenchai Khompatraporn
Publication date: 17 March 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9425-z
90C26: Nonconvex programming, global optimization
Related Items
Hybridizing local search algorithms for global optimization, Using modifications to Grover's search algorithm for quantum global optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Global optimization and simulated annealing
- Pure adaptive search in global optimization
- Hesitant adaptive search for global optimisation
- A theoretical approach to restart in global optimization
- Stochastic adaptive search for global optimization.
- Improving hit-and-run for global optimization
- Solving fractional problems with dynamic multistart improving hit-and-run
- Bayesian stopping rules for multistart global optimization methods
- Convergence of an annealing algorithm
- Sequential stopping rules for the multistart algorithm in global optimisation
- Cooling Schedules for Optimal Annealing
- A statistical estimate of the structure of multi-extremal problems
- Convergence of a simulated annealing algorithm for continuous global optimization.
- Hesitant adaptive search: The distribution of the number of iterations to convergence
