Stopping and restarting strategy for stochastic sequential search in global optimization
From MaRDI portal
Publication:2269595
DOI10.1007/S10898-009-9425-ZzbMATH Open1188.90204OpenAlexW2035203160MaRDI QIDQ2269595FDOQ2269595
Authors: Zelda B. Zabinsky, Charoenchai Khompatraporn, David Bulger 
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
Recommendations
- Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search
- Sequential stopping rules for the multistart algorithm in global optimisation
- scientific article; zbMATH DE number 4055383
- Stopping rules for box-constrained stochastic global optimization
- Stopping rules in \(k\)-adaptive global random search algorithms
Cites Work
- Title not available (Why is that?)
- Convergence of an annealing algorithm
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Pure adaptive search in global optimization
- Hesitant adaptive search for global optimisation
- Stochastic adaptive search for global optimization.
- Cooling Schedules for Optimal Annealing
- Global optimization and simulated annealing
- Improving hit-and-run for global optimization
- Bayesian stopping rules for multistart global optimization methods
- A statistical estimate of the structure of multi-extremal problems
- Convergence of a simulated annealing algorithm for continuous global optimization.
- Sequential stopping rules for the multistart algorithm in global optimisation
- Title not available (Why is that?)
- A theoretical approach to restart in global optimization
- Hesitant adaptive search: The distribution of the number of iterations to convergence
- Title not available (Why is that?)
- Solving fractional problems with dynamic multistart improving hit-and-run
Cited In (12)
- Title not available (Why is that?)
- Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise
- Stochastic optimization with adaptive restart: a framework for integrated local and global learning
- Using modifications to Grover's search algorithm for quantum global optimization
- Combined Global and Local Search for Optimization with Gaussian Process Models
- Restarting search algorithms with applications to simulated annealing
- Stagnation detection with randomized local search
- Title not available (Why is that?)
- Hybridizing local search algorithms for global optimization
- Stopping rules for box-constrained stochastic global optimization
- A cutoff time strategy based on the coupon collector's problem
- Analysis of random restart and iterated improvement for global optimization with application to the traveling salesman problem
This page was built for publication: Stopping and restarting strategy for stochastic sequential search in global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269595)
