Lower Bounds for Hit-and-Run Direct Search

DOI10.1007/978-3-540-74871-7_11zbMath1175.68416OpenAlexW1592418880MaRDI QIDQ3608504

Jens Jägersküpper

Publication date: 5 March 2009

Published in: Stochastic Algorithms: Foundations and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74871-7_11

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (4)

Principled Design of Continuous Stochastic Search: From Theory to Practice ⋮ Oblivious Randomized Direct Search for Real-Parameter Optimization ⋮ Efficient covariance matrix update for variable metric evolution strategies ⋮ Variable metric random pursuit

This page was built for publication: Lower Bounds for Hit-and-Run Direct Search