Worst case complexity of direct search under convexity.

Mahdi Dodangeh Luís Nunes Vicente

Published in: Math. Program. (2016)

Keyphrases

worst case
direct search
upper bound
average case
differential evolution
approximation algorithms
space complexity
lower bound
np hard
computational complexity
complexity bounds
sample size
greedy algorithm
hill climbing
low level