Multidimensional bisection: The performance and the context

Zhang Baoping; G. R. Wood; W. P. Baritompa

doi:10.1007/BF01096775

Multidimensional bisection

The performance and the context

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

^*Corresponding author for this work

Research output: Contribution to journal › Article

11 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	337-358
Number of pages	22
Journal	Journal of Global Optimization
Volume	3
Issue number	3
DOIs	https://doi.org/10.1007/BF01096775
Publication status	Published - Sep 1993

Keywords

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

Access to Document

10.1007/BF01096775

Link to publication in Scopus

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

Cite this

@article{14046457388340d2914bc8148b4bd5fb,

title = "Multidimensional bisection: The performance and the context",

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

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

author = "Zhang Baoping and Wood, {G. R.} and Baritompa, {W. P.}",

year = "1993",

month = "9",

doi = "10.1007/BF01096775",

language = "English",

volume = "3",

pages = "337--358",

journal = "Journal of Global Optimization",

issn = "0925-5001",

publisher = "Springer, Springer Nature",

number = "3",

}

TY - JOUR

T1 - Multidimensional bisection

T2 - The performance and the context

AU - Baoping, Zhang

AU - Wood, G. R.

AU - Baritompa, W. P.

PY - 1993/9

Y1 - 1993/9

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

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

KW - Bisection

KW - branch and bound

KW - deterministic

KW - global optimisation

KW - localisation

KW - mathematical programming

KW - Mathematics Subject Classifications (1991): 90C30, 65K05

KW - numerical performance

KW - simplex

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

U2 - 10.1007/BF01096775

DO - 10.1007/BF01096775

M3 - Article

VL - 3

SP - 337

EP - 358

JO - Journal of Global Optimization

JF - Journal of Global Optimization

SN - 0925-5001

IS - 3

ER -