An upper bound on the asymptotic complexity of global optimization of smooth univariate functions
Document Type
Syllabus
Publication Date
1-1-2016
Abstract
We study the problem of approximating the global minimum for a class of twice-continuously differentiable functions defined on the unit interval. For an algorithm that uses only function values, we show that the loga- rithm of the reciprocal of the error is asymptotically of order n/log(n) after n function evaluations.
Identifier
85116523692 (Scopus)
ISBN
[9789813109032]
Publication Title
Information and Complexity
External Full Text Location
https://doi.org/10.1142/9789813109032_0012
First Page
303
Last Page
315
Recommended Citation
Calvin, James M., "An upper bound on the asymptotic complexity of global optimization of smooth univariate functions" (2016). Faculty Publications. 10809.
https://digitalcommons.njit.edu/fac_pubs/10809
COinS
