Hostname: page-component-7bb8b95d7b-s9k8s Total loading time: 0 Render date: 2024-09-27T02:00:59.290Z Has data issue: false hasContentIssue false
  • English
  • Français

Topics in Lipschitz global optimisation

Published online by Cambridge University Press:  17 April 2009

Baoping Zhang
Baoping Zhang
Affiliation:
Department of Mathematics and Statistics, University of Canterbury, Private Bag 4800, Christchurch, New Zealand
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Abstracts of Australasian PhD Theses
Information
Bulletin of the Australian Mathematical Society , Volume 55 , Issue 1 , February 1997 , pp. 171 - 173
Copyright
Copyright © Australian Mathematical Society 1997

References

[1]Mladineo, R.H., ‘An algorithm for finding the global maximum of a multi-modal, multi-variate function’, Math. Programming 34 (1986), 185–200.Google Scholar
[2]Pinter, J., ‘Extended univariate algorithms for n–diemnsional global optimization’, Computing 36 (1986), 91–103.Google Scholar
[3]Pinter, J., ‘Globally convergent methods for n–dimensional multi-extremal optimization’, Optimization 17 (1986).Google Scholar
[4]Piyavskii, S.A., ‘An algorithm for finding the absolute extremum of a function’, (original in Russian, 1967), USSR Comput. Math and Math. Phys. 12 (1972), 57–67.Google Scholar
[5]Shubert, B.O., ‘A sequential method seeking the global maximum of a function’, SIAM J. Numer. Anal. 9 (1972), 379–388.Google Scholar
[6]Wood, G.R., ‘The bisection algorithm in higher dimensions’, Math. Programming 55 (1992), 317–338.Google Scholar
[7]Zabinsky, Z.B. and Smith, R.L., ‘Pure adaptive search in global optimization’, Math. Programming 53 (1992), 323–338.Google Scholar