Abstract
Although DIRECT global optimization algorithm quickly gets close to the basin of the optimum, it often takes much longer to refine the solution to a high degree of accuracy. This behavior of DIRECT is similar to the “smooth mode phenomenon” encountered when solving linear systems discretized from partial differential equation (PDE). In the case of PDE, this smooth mode phenomenon can be eliminated efficiently by the multigrid algorithm in which the PDE solver is applied at different levels of discretization. In this paper we adapt the multigrid approach to a robust version of DIRECT algorithm, obtaining a “multilevel” robust DIRECT (MrDIRECT) algorithm. Although additional parameters are needed, our numerical results show that MrDIRECT is insensitive to the parameters, and the parameters setting proposed in this paper performs very well on the tested sets of benchmark problems, in terms of the speed with which the global optimum is found to a high degree of accuracy.
Similar content being viewed by others
References
Björkman, M., Holmström, K.: Global optimization using the DIRECT algorithm in Matlab. Adv. Model. Optim. 1, 17–37 (1999)
Briggs, W.L., Henson, V.E., McCormick, S.: A Multigrid Tutorial. SIAM, Philadelphia (2000)
Dolan, E.D., Moré, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201–213 (2002)
Finkel, D.E., Kelley, C.T.: Convergence analysis of the DIRECT algorithm. Technical Report CRSC-TR04-28, North Carolina State University, Center for Research in Scientific Computation (2004)
Finkel, D.E.: DIRECT optimization user guide. In: Center for Research and Scientific Computation CRSC-TR03-11, North Carolina State University, Raleigh, NC (2003)
Finkel, D.E.: Global optimization with the DIRECT algorithm. PHD thesis, North Carolina State University (2005)
Finkel, D.E., Kelley, C.T.: Additive scaling and the DIRECT algorithm. J. Glob. Optim. 36, 597–608 (2006)
Floudas, C.A., Gounaris, C.E.: A review of recent advances in global optimization. J. Glob. Optim. 45, 3–38 (2009)
Gablonsky, J.M., Kelley, C.T.: A locally-biased form of the DIRECT algorithm. J. Glob. Optim. 21, 27–37 (2001)
Gaviano, M., Kvasov, D.E., Lera, D., Sergeyev Ya, D.: Algorithm 829: software for generation of classes of test functions with known local and global minima for global optimization. ACM Trans. Math. Softw. 9(4), 469–480 (2003)
Hedar, A.: http://www-optima.amp.i.kyoto-u.ac.jp/member/student/hedar/Hedar_files/TestGO.htm
Holmstrom, K., Goran, A.O., Edvall, M.M.: User’s Guide for TOMLAB 7. Tomlab optimization. http://tomopt.com
Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996)
Huyer, W., Neumaier, A.: Global optimization by multilevel coordinate search. J. Glob. Optim. 14(4), 331–355 (1999)
Jones, D.R.: The DIRECT global optimization algorithm. In: The Encyclopedia of Optimization, Kluwer (2001)
Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the Lipschitz constant. J. Optim. Theory Appl. 79(1), 157–181 (1993)
Knuth, D.: The Art of Computer Programming, vol. 2: Seminumerical Algorithms (Third Edition). Reading, Massachusetts: Addison-Wesley (1997)
Liu, Q.F., Cheng, W.Y.: A modified DIRECT algorithm with bilevel partition. J. Glob. Optim. (2014). doi:10.1007/s10898-013-0119-1, online
Liu, Q.F., Zeng, J.P.: Global optimization by multilevel partition. J. Glob. Optim. (2014). doi:10.1007/s10898-014-0152-8, online
Liu, Q.F., Zhang, J.X., Chen, F.: Modified DIRECT algorithm for scaled global optimization problems (2014). In: D. Gao et al. (eds.), Advances in Global Optimization, Springer Proceedings in Mathematics & Statistics 95, doi:10.1007/978-3-319-08377-3_41
Liu, Q.F.: Linear scaling and the DIRECT algorithm. J. Glob. Optim. 56, 1233–1245 (2013)
Liuzzi, G., Lucidi, S., Piccialli, V.: A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems. Comput. Optim. Appl. 45(2), 353–375 (2010)
Liuzzi, G., Lucidi, S., Piccialli, V.: A partion-based global optimization algorithm. J. Glob. Optim. 48, 113–128 (2010)
Ljunberg, K., Holmgren, S.: Simultaneous search for multiple QTL using the global optimization algorithm DIRECT. Bioinformatics 20(12), 1887–1895 (2004)
Moré, J., Wild, S.: Benchmarking derivative-free optimization algorithms. SIAM Journal on Optimization 20(1), 172–191 (2009)
Paulavic̆ius, R., Sergeyev, Y.D., Kvasov, D.E., Z̆ilinskas, J.: Globally-biased disimpl algorithm for expensive global optimization. J. Glob. Optim. 59, 545–567 (2014)
Rios, L.M., Sahinidis, N.V.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Glob. Optim. 56(3), 1247–1293 (2013)
Sasena, M., Papalambros, P., Goovaerts, P.: Global optimization of problems with disconnected feasible regions via surrogate modeling. In: 9th AIAA/ISSMO Symposium on Multidisciplinary Analysis and Optimization. Atlanta, GA (2002)
Weise, T.: Global Optimization Algorithms—Theory and Applications (3rd edition). Online available as e-book at http://www.it-weise.de/projects/book (2011)
Xu, J.: An Introduction to Multilevel Methods. Oxford University Press, Oxford (1997)
Acknowledgments
We would like to thank an anonymous reviewer for the helpful comments and suggestions, which improve this paper greatly. We would like to thank Doctor Finkel D.E. and Professor Kelley C.T. for their DIRECT codes. We would also like to thank Professor Sergeyev Ya. D. for the GKLS codes.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by National Natural Science Foundation of China (Grant No. 11271069) and MOE (Ministry of Education in China) Project of Humanities and Social Sciences (Project No. 13YJC630095).
Rights and permissions
About this article
Cite this article
Liu, Q., Zeng, J. & Yang, G. MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems. J Glob Optim 62, 205–227 (2015). https://doi.org/10.1007/s10898-014-0241-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-014-0241-8