Lower bound on complexity of optimization of continuous functions
This paper considers the problem of approximating the minimum of a continuous function using a fixed number of sequentially selected function evaluations. A lower bound on the complexity is established by analyzing the average case for the Brownian bridge. (C) 2003 Elsevier Inc. All rights reserved.
global optimization wiener measure average case complexity