A lower bound on complexity of optimization on the Wiener space

This paper is a study of the complexity of optimization of continuous univariate functions using a fixed number of sequentially selected function evaluations. The complexity is studied in the average case under a conditioned Wiener measure. We show that to obtain an error of at most , on the order of function evaluations are required. [Copyright &y& Elsevier]