Improving the convergence rate of the DIRECT global optimization algorithm
- 321 Downloads
DIRECT is derivative-free global-search algorithm has been found to perform robustly across a wide variety of low-dimensional test problems. The reason DIRECT’s robustness is its lack of algorithmic parameters that need be “tuned” to make the algorithm perform well. In particular, there is no parameter that determines the relative emphasis on global versus local search. Unfortunately, the same algorithmic features that enable DIRECT to perform so robustly have a negative side effect. In particular, DIRECT is usually quick to get close to the global minimum, but very slow to refine the solution to high accuracy. This is what we call DIRECT’s “eventually inefficient behavior.” In this paper, we outline two root causes for this undesirable behavior and propose modifications to eliminate it. The paper builds upon our previously published “MrDIRECT” algorithm, which we can now show only addressed the first root cause of the “eventually inefficient behavior.” The key contribution of the current paper is a further enhancement that allows MrDIRECT to address the second root cause as well. To demonstrate the effectiveness of the enhanced MrDIRECT, we have identified a set of test functions that highlight different situations in which DIRECT has convergence issues. Extensive numerical work with this test suite demonstrates that the enhanced version of MrDIRECT does indeed improve the convergence rate of DIRECT.
KeywordsGlobal optimization Multilevel algorithm DIRECT algorithm MrDIRECT algorithm Convergence rate
We would like to thank two anonymous reviewers for their very helpful suggestions, which improve this paper greatly. We would like to thank Doctor Finkel D.E., Professor Kelley C.T. and Professor Sergeyev Ya. D. for their DIRECT code and the GKLS codes, respectively.
- 4.Finkel D.E.: Global optimization with the DIRECT algorithm. PHD thesis, North Carolina State University (2005)Google Scholar
- 12.Holland, J.H.: Adaption in Nature and Artificial Systems, 2nd edn. MIT Press, Cambrige, MA (1992)Google Scholar
- 13.Holmstrom, K., Goran A.O., Edvall M.M.: User’s Guide for TOMLAB 7. Tomlab optimization. http://tomopt.com
- 16.Jones, D.R.: The DIRECT global optimization algorithm. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of optimization. Kluwer Academic, Dordrecht (2001)Google Scholar
- 19.Liang J.J.: Novel particle swarm optimizers with hybrid, dynamic & adaptive neighborhood structures. PhD thesis, Nanyang Technological University, Singapore (2008)Google Scholar
- 20.Liang J.J., Qu B.Y., Suganthan P.N.: Problem definitions and evaluation criteria for the CEC 2013 special session and competition on real-parameter optimization. Technical Report 201212, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore, January (2013)Google Scholar
- 27.Liuzzi, G., Lucidi, S., Piccialli, V.: Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization. Comput. Optim. Appl. (2015). doi: 10.1007/s10589-015-9741-9
- 30.Pardalos, P.M., Schoen, F.: Recent advances and trends in global optimization: deterministic and stochastic methods. In: Proceedings of the Sixth International Conference on Foundations of Computer-Aided Process Design, DSI, vol. 1, pp. 119–131 (2004)Google Scholar