Towards Pure Adaptive Search - A general framework and a one-dimensional realisation

W. P. Baritompa; Zhang Baoping; R. H. Mladineo; G. R. Wood; Z. B. Zabinsky

doi:10.1007/BF01100207

Towards Pure Adaptive Search - A general framework and a one-dimensional realisation

W. P. Baritompa^*, Zhang Baoping, R. H. Mladineo, G. R. Wood, Z. B. Zabinsky

^*Corresponding author for this work

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

6 Citations (Scopus)

Abstract

The algorithm known as Pure Adaptive Search is a global optimisation ideal with desirable complexity. In this paper we temper it to a framework we term Somewhat Adaptive Search. This retains the desirable complexity, but allows scope for a practical realisation. We introduce a new algorithm termed Pure Localisation Search which attempts to reach the practical ideal. For a certain class of one variable functions the gap is bridged.

Original language	English
Pages (from-to)	93-110
Number of pages	18
Journal	Journal of Global Optimization
Volume	7
Issue number	1
DOIs	https://doi.org/10.1007/BF01100207
Publication status	Published - Jul 1995

Keywords

complexity
Global optimisation
localisation
random search
stochastic

Access to Document

10.1007/BF01100207

Cite this

@article{c65836e41dbc4b77b1772c7f185eb485,

title = "Towards Pure Adaptive Search - A general framework and a one-dimensional realisation",

abstract = "The algorithm known as Pure Adaptive Search is a global optimisation ideal with desirable complexity. In this paper we temper it to a framework we term Somewhat Adaptive Search. This retains the desirable complexity, but allows scope for a practical realisation. We introduce a new algorithm termed Pure Localisation Search which attempts to reach the practical ideal. For a certain class of one variable functions the gap is bridged.",

keywords = "complexity, Global optimisation, localisation, random search, stochastic",

author = "Baritompa, {W. P.} and Zhang Baoping and Mladineo, {R. H.} and Wood, {G. R.} and Zabinsky, {Z. B.}",

year = "1995",

month = jul,

doi = "10.1007/BF01100207",

language = "English",

volume = "7",

pages = "93--110",

journal = "Journal of Global Optimization",

issn = "0925-5001",

publisher = "Springer, Springer Nature",

number = "1",

}

TY - JOUR

T1 - Towards Pure Adaptive Search - A general framework and a one-dimensional realisation

AU - Baritompa, W. P.

AU - Baoping, Zhang

AU - Mladineo, R. H.

AU - Wood, G. R.

AU - Zabinsky, Z. B.

PY - 1995/7

Y1 - 1995/7

N2 - The algorithm known as Pure Adaptive Search is a global optimisation ideal with desirable complexity. In this paper we temper it to a framework we term Somewhat Adaptive Search. This retains the desirable complexity, but allows scope for a practical realisation. We introduce a new algorithm termed Pure Localisation Search which attempts to reach the practical ideal. For a certain class of one variable functions the gap is bridged.

AB - The algorithm known as Pure Adaptive Search is a global optimisation ideal with desirable complexity. In this paper we temper it to a framework we term Somewhat Adaptive Search. This retains the desirable complexity, but allows scope for a practical realisation. We introduce a new algorithm termed Pure Localisation Search which attempts to reach the practical ideal. For a certain class of one variable functions the gap is bridged.

KW - complexity

KW - Global optimisation

KW - localisation

KW - random search

KW - stochastic

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

U2 - 10.1007/BF01100207

DO - 10.1007/BF01100207

M3 - Article

AN - SCOPUS:34249753497

SN - 0925-5001

VL - 7

SP - 93

EP - 110

JO - Journal of Global Optimization

JF - Journal of Global Optimization

IS - 1

ER -

Towards Pure Adaptive Search - A general framework and a one-dimensional realisation

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this