Multidimensional bisection: The performance and the context

Zhang Baoping*, G. R. Wood, W. P. Baritompa

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    13 Citations (Scopus)


    Two aspects of the multidimensional bisection algorithms for the global optimisation of Lipschitz continuous functions are investigated. Firstly, for several test functions we examine the numerical performance of the deepest point algorithm and two acceleration procedures. Secondly, we phrase the branch and bound framework of Horst and Tuy in terms of covers, and show the algorithms to be included in this framework. A result of Basso on the convergence of localisations is extended to higher dimensions.

    Original languageEnglish
    Pages (from-to)337-358
    Number of pages22
    JournalJournal of Global Optimization
    Issue number3
    Publication statusPublished - Sep 1993


    • Bisection
    • branch and bound
    • deterministic
    • global optimisation
    • localisation
    • mathematical programming
    • Mathematics Subject Classifications (1991): 90C30, 65K05
    • numerical performance
    • simplex


    Dive into the research topics of 'Multidimensional bisection: The performance and the context'. Together they form a unique fingerprint.

    Cite this