Login / Signup
Lower bounds for randomized direct search with isotropic sampling.
Jens Jägersküpper
Published in:
Oper. Res. Lett. (2008)
Keyphrases
</>
direct search
lower bound
upper bound
differential evolution
pattern search
randomized algorithm
branch and bound
hill climbing
objective function
stationary points
branch and bound algorithm
genetic algorithm
multi objective
np hard
worst case
special case
pairwise
search algorithm
optimal solution