Algorithm 829

Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization A procedure for generating non-differentiable, continuously differentiable, and twice continuously differentiable classes of test functions for multiextremal multidimensional box-constrained global optimization is presented. Each test class consists of 100 functions. Test functions are generated by defining a convex quadratic function systematically distorted by polynomials in order to introduce local minima. To determine a class, the user defines the following parameters: (i) problem dimension, (ii) number of local minima, (iii) value of the global minimum, (iv) radius of the attraction region of the global minimizer, (v) distance from the global minimizer to the vertex of the quadratic function. Then, all other necessary parameters are generated randomly for all 100 functions of the class. Full information about each test function including locations and values of all local minima is supplied to the user. Partial derivatives are also generated where possible. (Source:

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 28 articles , 1 standard article )

Showing results 1 to 20 of 28.
Sorted by year (citations)

1 2 next

  1. Liu, Qunfeng; Yang, Guang; Zhang, Zhongzhi; Zeng, Jinping: Improving the convergence rate of the DIRECT global optimization algorithm (2017)
  2. Lampariello, F.; Liuzzi, G.: A filling function method for unconstrained global optimization (2015)
  3. Liu, Haitao; Xu, Shengli; Ma, Ying; Wang, Xiaofang: Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces (2015)
  4. Liu, Qunfeng; Zeng, Jinping; Yang, Gang: MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems (2015)
  5. Sergeyev, Yaroslav D.; Kvasov, Dmitri E.: A deterministic global optimization using smooth diagonal auxiliary functions (2015)
  6. Paulavičius, Remigijus; Sergeyev, Yaroslav D.; Kvasov, Dmitri E.; Žilinskas, Julius: Globally-biased disimpl algorithm for expensive global optimization (2014)
  7. Pintér, János D.; Kampas, Frank J.: Benchmarking nonlinear optimization software in technical computing environments (2013)
  8. Aguiar e Oliveira, Hime jun.; Ingber, Lester; Petraglia, Antonio; Rembold Petraglia, Mariane; Soares Machado, Maria Augusta: Stochastic global optimization and its applications with fuzzy adaptive simulated annealing (2012)
  9. Kvasov, Dmitri E.; Sergeyev, Yaroslav D.: Lipschitz gradients for global optimization in a one-point-based partitioning scheme (2012)
  10. Rönkkönen, Jani; Li, Xiaodong; Kyrki, Ville; Lampinen, Jouni: A framework for generating tunable test functions for multimodal optimization (2011) ioport
  11. Sun, Weitao; Dong, Yuan: Study of multiscale global optimization based on parameter space partition (2011)
  12. Ahrari, Ali; Ahrari, Reza: On the utility of randomly generated functions for performance evaluation of evolutionary algorithms (2010)
  13. Gaviano, M.; Lera, D.; Steri, A.M.: A local search method for continuous global optimization (2010)
  14. Lera, Daniela; Sergeyev, Yaroslav D.: An information global minimization algorithm using the local improvement technique (2010)
  15. Lera, D.; Sergeyev, Ya.D.: Lipschitz and Hölder global optimization using space-filling curves (2010)
  16. Tsoulos, Ioannis G.; Stavrakoudis, Athanassios: Enhancing PSO methods for global optimization (2010)
  17. Kvasov, Dmitri E.; Sergeyev, Yaroslav D.: A univariate global search working with a set of Lipschitz constants for the first derivative (2009)
  18. Gaviano, M.; Lera, D.: A global minimization algorithm for Lipschitz functions (2008)
  19. Kvasov, Dmitri E.: Multidimensional Lipschitz global optimization based on efficient diagonal partitions (2008)
  20. Lagaris, I.E.; Tsoulos, I.G.: Stopping rules for box-constrained stochastic global optimization (2008)

1 2 next