Fast algorithm for the cutting angle method of global optimization
Data(s) |
01/10/2002
|
---|---|
Resumo |
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.<br /><br /> |
Identificador | |
Idioma(s) |
eng |
Publicador |
Springer |
Relação |
http://dro.deakin.edu.au/eserv/DU:30001752/beliakov-fastalgorithm-2002.pdf http://dro.deakin.edu.au/eserv/DU:30001752/beliakov-fastalgrithm-post-2002.pdf http://dx.doi.org/10.1023/A:1020256900863 |
Direitos |
2002, Kluwer Academic Publishers. |
Tipo |
Journal Article |