Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search

DOI10.1137/S1052623494277317zbMATH Open0959.65075OpenAlexW2013823866MaRDI QIDQ4229490FDOQ4229490

Authors: William E. Hart 

Publication date: 22 February 1999

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623494277317

Recommendations

• Stopping Rules for a Random Optimization Method
• Sequential stopping rules for the multistart algorithm in global optimisation
• Stopping rules for box-constrained stochastic global optimization
• Optimal and sub-optimal stopping rules for the multistart algorithm in global optimization

zbMATH Keywords

numerical resultsstochastic algorithmsstopping rulesmultistartpure random searchrandom optimization methodsstratified random search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15)

Cited In (20)

• Bayesian stopping rules for greedy randomized procedures
• Stopping and restarting strategy for stochastic sequential search in global optimization
• Optimal and sub-optimal stopping rules for the multistart algorithm in global optimization
• CARTopt: a random search method for nonsmooth unconstrained optimization
• Stopping rules for optimization algorithms based on stochastic approximation
• \textsc{Oscars}-II: an algorithm for bound constrained global optimization
• Stopping rules in \(k\)-adaptive global random search algorithms
• Stochastic optimization with adaptive restart: a framework for integrated local and global learning
• Stagnation detection with randomized local search
• Speeding up continuous GRASP
• Sequential stopping rules for the multistart algorithm in global optimisation
• Stopping eules for the multistart method when different local minima have different function values
• Stopping Rules for a Random Optimization Method
• Statistical inferences for termination of Markov type random search algorithms
• Stopping rules for box-constrained stochastic global optimization
• A cutoff time strategy based on the coupon collector's problem
• Annealing evolutionary stochastic approximation Monte Carlo for global optimization
• Annealing evolutionary stochastic approximation Monte Carlo for global optimization
• Bayesian stopping rules for improvement of local minima algorithms in global optimization
• Probabilistic stopping rules for GRASP heuristics and extensions

This page was built for publication: Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search

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