On the asymptotic tractability of global optimization

Authors

James M. Calvin, New Jersey Institute of Technology

Document Type

Article

Publication Date

1-1-2016

Abstract

We consider the intrinsic difficulty of global optimization in high dimensional Euclidean space. We adopt an asymptotic analysis, and give a lower bound on the number of function evaluations required to obtain a given error tolerance. This lower bound complements upper bounds provided by recently proposed algorithms.

Identifier

84994496468 (Scopus)

Publication Title

Springer Optimization and Its Applications

External Full Text Location

https://doi.org/10.1007/978-3-319-29975-4_1

e-ISSN

19316836

ISSN

19316828

First Page

3

Last Page

12

Volume

107

Recommended Citation

Calvin, James M., "On the asymptotic tractability of global optimization" (2016). Faculty Publications. 10735.
https://digitalcommons.njit.edu/fac_pubs/10735