Stopping rules in \(k\)-adaptive global random search algorithms

DOI10.1007/s10898-010-9528-6zbMath1202.90220OpenAlexW2045401237MaRDI QIDQ1959253

Emily Hamilton, Anatoly A. Zhigljavsky

Publication date: 6 October 2010

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-010-9528-6

zbMATH Keywords

waiting timesextreme order statistics\(k\)-th order statistic

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

Performance of global random search algorithms for large dimensions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pure adaptive search in global optimization
• Stochastic adaptive search for global optimization.
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Stochastic global optimization.
• Statistical inference for bounds of random variables