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 | |
Publication status | Published - Sept 1993 |
Keywords
- Bisection
- branch and bound
- deterministic
- global optimisation
- localisation
- mathematical programming
- Mathematics Subject Classifications (1991): 90C30, 65K05
- numerical performance
- simplex