The GLOBAL optimization method revisited
- 196 Downloads
The multistart clustering global optimization method called GLOBAL has been introduced in the 1980s for bound constrained global optimization problems with black-box type objective function. Since then the technological environment has been changed much. The present paper describes shortly the revisions and updates made on the involved algorithms to utilize the novel technologies, and to improve its reliability. We discuss in detail the results of the numerical comparison with the old version and with C-GRASP, a continuous version of the GRASP method. According to these findings, the new version of GLOBAL is both more reliable and more efficient than the old one, and it compares favorably with C-GRASP too.
KeywordsGlobal optimization Direct methods Clustering Numerical tests
Unable to display preview. Download preview PDF.
- 3.Banga, J.R., Moles, C.G., Alonso, A.A.: Global Optimization of Bioprocesses using Stochastic and Hybrid Methods. In: Floudas, C.A., Pardalos, P.M. (eds.) Frontiers in Global Optimization, pp. 45–70. Springer, Berlin (2003)Google Scholar
- 5.Bánhelyi, B., Csendes, T., Garay, B.M.: A verified optimization technique to bound topological entropy rigorously. In: Proceedings of the SCAN-2006 Conference. IEEE 10, (2007)Google Scholar
- 11.Gill, P.E., Murray, W., Wright, M.H.: Practical Optimization. Academic, New York (1984)Google Scholar
- 13.Hirsch, M.J., Pardalos, P.M., Resende, M.G.C.: Speeding up Continuous GRASP. Eur. J. Oper. Res. (2007) (submitted)Google Scholar
- 15.Järvi, T.: A random search optimizer with an application to a max-min problem. Publications of the Institute for Applied Mathematics, University of Turku, No. 3, 1973Google Scholar
- 22.Sendín, J.O.H., Banga, J.R., Csendes, T.: Extensions of a multistart clustering algorithm for constrained global optimization problems. Manuscript submitted for pubication. Available at http://www.inf.u-szeged.hu/~csendes/ReportGLOBALm.doc