Fast algorithm for the cutting angle method of global optimization
Batten, Lynn M. and Beliakov, Gleb 2002, Fast algorithm for the cutting angle method of global optimization, Journal of global optimization, vol. 24, no. 2, pp. 149-161.
Attached Files
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
The cutting angle method for global optimization was proposed in 1999 by Andramonov et al. (Appl. Math. Lett. 12 (1999) 95). Computer implementation of the resulting algorithm indicates that running time could be improved with appropriate modifications to the underlying mathematical description. In this article, we describe the initial algorithm and introduce a new one which we prove is significantly faster at each stage. Results of numerical experiments performed on a Pentium III 750 Mhz processor are presented.
Notes
The original publication can be found at www.springerlink.com
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO.
If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.