On the asymptotic tractability of global optimization

James M. Calvin

doi:10.1007/978-3-319-29975-4_1

On the asymptotic tractability of global optimization

James M. Calvin

Computer Science

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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.

Original language	English (US)
Pages (from-to)	3-12
Number of pages	10
Journal	Springer Optimization and Its Applications
Volume	107
DOIs	https://doi.org/10.1007/978-3-319-29975-4_1
State	Published - 2016

All Science Journal Classification (ASJC) codes

Control and Optimization

Keywords

Adaptive algorithms
Lower complexity bounds
Tractability

Access to Document

10.1007/978-3-319-29975-4_1

Cite this

@article{ebb404b4fd4b4547813901cb4dec61a4,

title = "On the asymptotic tractability of global optimization",

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.",

keywords = "Adaptive algorithms, Lower complexity bounds, Tractability",

author = "Calvin, {James M.}",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.",

year = "2016",

doi = "10.1007/978-3-319-29975-4_1",

language = "English (US)",

volume = "107",

pages = "3--12",

journal = "Springer Optimization and Its Applications",

issn = "1931-6828",

publisher = "Springer International Publishing AG",

}

TY - JOUR

T1 - On the asymptotic tractability of global optimization

AU - Calvin, James M.

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2016.

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

KW - Adaptive algorithms

KW - Lower complexity bounds

KW - Tractability

UR - http://www.scopus.com/inward/record.url?scp=84994496468&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84994496468&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-29975-4_1

DO - 10.1007/978-3-319-29975-4_1

M3 - Article

AN - SCOPUS:84994496468

SN - 1931-6828

VL - 107

SP - 3

EP - 12

JO - Springer Optimization and Its Applications

JF - Springer Optimization and Its Applications

ER -

On the asymptotic tractability of global optimization

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this