Black-box search by elimination of fitness functions
Gautham Anil, R. Paul Wiegand · 2009
In black-box optimization an algorithm must solve one of many possible functions, though the precise instance is unknown. In practice, it is reasonable to assume that an algorithm designer has some basic knowledge of the problem class in order to choose appropriate methods. In traditional approaches, one focuses on how to select samples and direct search to minimize the number of function evaluations to find an optima.