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 journalArticle

    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 languageEnglish
    Pages (from-to)93-110
    Number of pages18
    JournalJournal of Global Optimization
    Volume7
    Issue number1
    DOIs
    Publication statusPublished - Jul 1995

    Keywords

    • complexity
    • Global optimisation
    • localisation
    • random search
    • stochastic

    Fingerprint Dive into the research topics of 'Towards Pure Adaptive Search - A general framework and a one-dimensional realisation'. Together they form a unique fingerprint.

  • Cite this

    Baritompa, W. P., Baoping, Z., Mladineo, R. H., Wood, G. R., & Zabinsky, Z. B. (1995). Towards Pure Adaptive Search - A general framework and a one-dimensional realisation. Journal of Global Optimization, 7(1), 93-110. https://doi.org/10.1007/BF01100207