Lower bounds for randomized direct search with isotropic sampling

DOI10.1016/j.orl.2007.10.003zbMath1152.90668OpenAlexW2008892982MaRDI QIDQ943792

Jens Jägersküpper

Publication date: 10 September 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.10.003

zbMATH Keywords

heuristic optimizationprobabilistic analysisrandom searchdirect search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Principled Design of Continuous Stochastic Search: From Theory to Practice ⋮ Oblivious Randomized Direct Search for Real-Parameter Optimization ⋮ Drift conditions for estimating the first hitting times of evolutionary algorithms ⋮ Efficient covariance matrix update for variable metric evolution strategies

Cites Work

• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• Upper and lower bounds for randomized search heuristics in black-box optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bounds for randomized direct search with isotropic sampling