Lower Bounds for Hit-and-Run Direct Search.

Jens Jägersküpper

Published in: SAGA (2007)

Keyphrases

direct search
lower bound
upper bound
hill climbing
pattern search
differential evolution
objective function
branch and bound algorithm
branch and bound
stationary points
worst case
genetic algorithm
np hard
simulated annealing
particle swarm optimization
vc dimension
max sat
learning algorithm