Skip to main content
Top

2019 | OriginalPaper | Chapter

Comparison of Several Stochastic and Deterministic Derivative-Free Global Optimization Algorithms

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In this paper popular open-source solvers are compared against Globalizer solver, which is developed at the Lobachevsky State University. The Globalizer is designed to solve problems with black-box objective function satisfying the Lipschitz condition and shows competitive performance with other similar solvers. The comparison is done on several sets of challenging multi-extremal benchmark functions. Also this work considers a method of heuristic hyperparameters control for the Globalizer allowing to reduce amount of initial tuning before optimization. The proposed scheme allows substantially increase convergence speed of the Globalizer by switching between “local” and “global” search phases in runtime.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
1
Software implementations of these generators are available in source codes at the page https://​github.​com/​sovrasov/​global-optimization-test-problems.
 
Literature
1.
go back to reference Ali, M.M., Khompatraporn, C., Zabinsky, Z.B.: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J. Glob. Optim. 31(4), 635–672 (2005)MathSciNetCrossRef Ali, M.M., Khompatraporn, C., Zabinsky, Z.B.: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J. Glob. Optim. 31(4), 635–672 (2005)MathSciNetCrossRef
2.
go back to reference Beiranvand, V., Hare, W., Lucet, Y.: Best practices for comparing optimization algorithms. Optim. Eng. 18(4), 815–848 (2017)MathSciNetCrossRef Beiranvand, V., Hare, W., Lucet, Y.: Best practices for comparing optimization algorithms. Optim. Eng. 18(4), 815–848 (2017)MathSciNetCrossRef
3.
go back to reference Evtushenko, Y., Posypkin, M.: A deterministic approach to global box-constrained optimization. Optim. Lett. 7, 819–829 (2013)MathSciNetCrossRef Evtushenko, Y., Posypkin, M.: A deterministic approach to global box-constrained optimization. Optim. Lett. 7, 819–829 (2013)MathSciNetCrossRef
4.
go back to reference Gablonsky, J.M., Kelley, C.T.: A locally-biased form of the direct algorithm. J. Glob. Optim. 21(1), 27–37 (2001)MathSciNetCrossRef Gablonsky, J.M., Kelley, C.T.: A locally-biased form of the direct algorithm. J. Glob. Optim. 21(1), 27–37 (2001)MathSciNetCrossRef
5.
go back to reference Gaviano, M., Kvasov, D.E., Lera, D., Sergeev, Ya.D.: Software for generation of classes of test functions with known local and global minima for global optimization. ACM Trans. Math. Softw. 29(4), 469–480 (2003)MathSciNetCrossRef Gaviano, M., Kvasov, D.E., Lera, D., Sergeev, Ya.D.: Software for generation of classes of test functions with known local and global minima for global optimization. ACM Trans. Math. Softw. 29(4), 469–480 (2003)MathSciNetCrossRef
6.
go back to reference Gergel, V.P., Barkalov, K.A., Sysoyev, A.V.: A novel supercomputer software system for solving time-consuming global optimization problems. Numer. Algebr. Control. Optim. 8(1), 47–62 (2018)MathSciNetCrossRef Gergel, V.P., Barkalov, K.A., Sysoyev, A.V.: A novel supercomputer software system for solving time-consuming global optimization problems. Numer. Algebr. Control. Optim. 8(1), 47–62 (2018)MathSciNetCrossRef
7.
go back to reference Grishagin, V.: Operating characteristics of some global search algorithms. Probl. Stoch. Search 7, 198–206 (1978). (In Russian)MATH Grishagin, V.: Operating characteristics of some global search algorithms. Probl. Stoch. Search 7, 198–206 (1978). (In Russian)MATH
11.
go back to reference Kan, A.H.G.R., Timmer, G.T.: Stochastic global optimization methods Part II: multi level methods. Math. Program. 39, 57–78 (1987)CrossRef Kan, A.H.G.R., Timmer, G.T.: Stochastic global optimization methods Part II: multi level methods. Math. Program. 39, 57–78 (1987)CrossRef
12.
go back to reference Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN 1995 - International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995) Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN 1995 - International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)
13.
go back to reference Kvasov, D.E., Mukhametzhanov, M.S.: Metaheuristic vs. deterministic global optimization algorithms: the univariate case. Appl. Math. Comput. 318, 245–259 (2018)MathSciNet Kvasov, D.E., Mukhametzhanov, M.S.: Metaheuristic vs. deterministic global optimization algorithms: the univariate case. Appl. Math. Comput. 318, 245–259 (2018)MathSciNet
14.
go back to reference Liberti, L., Kucherenko, S.: Comparison of deterministic and stochastic approaches to global optimization. Int. Trans. Oper. Res. 12, 263–285 (2005)MathSciNetCrossRef Liberti, L., Kucherenko, S.: Comparison of deterministic and stochastic approaches to global optimization. Int. Trans. Oper. Res. 12, 263–285 (2005)MathSciNetCrossRef
15.
go back to reference Madsen, K., Zertchaninov, S.: A new branch-and-bound method for global optimization (1998) Madsen, K., Zertchaninov, S.: A new branch-and-bound method for global optimization (1998)
16.
go back to reference Mullen, K.: Continuous global optimization in R. J. Stat. Softw. 60(6), 1–45 (2014)CrossRef Mullen, K.: Continuous global optimization in R. J. Stat. Softw. 60(6), 1–45 (2014)CrossRef
17.
go back to reference Paulavivcius, R., Zilinskas, J., Grothey, A.: Parallel branch and bound for global optimization with combination of Lipschitz bounds. Optim. Methods Softw. 26(3), 487–498 (1997)MathSciNetCrossRef Paulavivcius, R., Zilinskas, J., Grothey, A.: Parallel branch and bound for global optimization with combination of Lipschitz bounds. Optim. Methods Softw. 26(3), 487–498 (1997)MathSciNetCrossRef
18.
go back to reference Pošík, P., Huyer, W., Pál, L.: A comparison of global search algorithms for continuous black box optimization. Evol. Comput. 20(4), 509–541 (2012)CrossRef Pošík, P., Huyer, W., Pál, L.: A comparison of global search algorithms for continuous black box optimization. Evol. Comput. 20(4), 509–541 (2012)CrossRef
19.
20.
go back to reference Schluter, M., Egea, J.A., Banga, J.R.: Extended ant colony optimization for non-convex mixed integer nonlinear programming. Comput. Oper. Res. 36(7), 2217–2229 (2009)MathSciNetCrossRef Schluter, M., Egea, J.A., Banga, J.R.: Extended ant colony optimization for non-convex mixed integer nonlinear programming. Comput. Oper. Res. 36(7), 2217–2229 (2009)MathSciNetCrossRef
21.
go back to reference Sergeyev, Y., Kvasov, D.: Global search based on efficient diagonal partitions and a set of Lipschitz constants. SIAM J. Optim. 16(3), 910–937 (2006)MathSciNetCrossRef Sergeyev, Y., Kvasov, D.: Global search based on efficient diagonal partitions and a set of Lipschitz constants. SIAM J. Optim. 16(3), 910–937 (2006)MathSciNetCrossRef
23.
go back to reference Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997)MathSciNetCrossRef Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997)MathSciNetCrossRef
24.
go back to reference Strongin, R.: Numerical Methods in Multiextremal Problems (Information-Statistical Algorithms). Nauka, Moscow (1978). (In Russian) Strongin, R.: Numerical Methods in Multiextremal Problems (Information-Statistical Algorithms). Nauka, Moscow (1978). (In Russian)
25.
go back to reference Strongin R.G., Sergeyev Ya.D.: Global Optimization with Non-convex Constraints: Sequential and Parallel Algorithms. Kluwer Academic Publishers, Dordrecht (2000)CrossRef Strongin R.G., Sergeyev Ya.D.: Global Optimization with Non-convex Constraints: Sequential and Parallel Algorithms. Kluwer Academic Publishers, Dordrecht (2000)CrossRef
27.
go back to reference Xiang, Y., Sun, D., Fan, W., Gong, X.: Generalized simulated annealing algorithm and its application to the thomson model. Phys. Lett. A 233(3), 216–220 (1997)CrossRef Xiang, Y., Sun, D., Fan, W., Gong, X.: Generalized simulated annealing algorithm and its application to the thomson model. Phys. Lett. A 233(3), 216–220 (1997)CrossRef
Metadata
Title
Comparison of Several Stochastic and Deterministic Derivative-Free Global Optimization Algorithms
Author
Vladislav Sovrasov
Copyright Year
2019
DOI
https://doi.org/10.1007/978-3-030-22629-9_6

Premium Partner