Analysis and parameter selection for an adaptive random search algorithm

DOI10.1016/J.MATCOM.2004.10.002MaRDI QIDQ1780461zbMATH OpenOpenAlexFDO

Authors Rajeeva Kumar, Pierre T. Kabamba, David C. Hyland

Publication date 13 June 2005

Published in Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.matcom.2004.10.002

zbMATH Keywords

global optimizationstopping ruleadaptive random search algorithm

Mathematics Subject Classification ID

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

Recommendations

• On Accelerated Random Search
• A heuristic approach for finding the global minimum: Adaptive random search technique
• Stopping rules in \(k\)-adaptive global random search algorithms
• Simulation optimization using multi-time-scale adaptive random search
• Adaptive partitioned random search to global optimization

Cited in

(8)

• On Accelerated Random Search
• Discrete backtracking adaptive search for global optimization
• The New Arsti Optimization Method: Adaptive Random Search with Translating Intervals
• scientific article; zbMATH DE number 3952512 (Why is no real title available?)
• A heuristic approach for finding the global minimum: Adaptive random search technique
• Adaptive parameterized improving hit-and-run for global optimization
• scientific article; zbMATH DE number 1057701 (Why is no real title available?)
• A Model Reference Adaptive Search Method for Global Optimization

This page was built for publication: Analysis and parameter selection for an adaptive random search algorithm

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