Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization

@article{Gaviano2003Algorithm8S,
  title={Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization},
  author={Marco Gaviano and Dmitri E. Kvasov and Daniela Lera and Yaroslav D. Sergeyev},
  journal={ACM Trans. Math. Softw.},
  year={2003},
  volume={29},
  pages={469-480}
}
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… 

Figures from this paper

A filling function method for unconstrained global optimization
TLDR
The problem of finding a global minimum point of a given continuously differentiable function is considered and a suitable Gaussian-based filling function is constructed using the quadratic model of the objective function, and added to the objective to fill the basin.
A Novel Class of Test Problems for Performance Evaluation of Niching Methods
  • A. Ahrari, K. Deb
  • Computer Science
    IEEE Transactions on Evolutionary Computation
  • 2018
TLDR
A novel procedure for generating parametric scalable functions with diverse properties to strengthen numerical evaluation of niching methods, which results in computationally inexpensive composite functions, when compared to those generated by available methods.
A local search method for continuous global optimization
TLDR
This paper looks for the optimal probability value to be set at each iteration so that by moving from a local minimum to a new one, the average number of function evaluations evals is minimal.
GOSH: derivative-free global optimization using multi-dimensional space-filling curves
TLDR
A practical derivative-free deterministic method reducing the dimensionality of the problem by using space-filling curves and working simultaneously with all possible estimates of Lipschitz and Hölder constants is proposed, which shows clear superiority over w.r.t. the popular method DIRECT and other competitors.
A Generator for Multimodal Test Functions with Multiple Global Optima
TLDR
This paper describes the attempt in constructing a test function generator to allow the generation of easily tunable test functions and implements new parameterizable function families for generating desired landscapes and a selection of well known test functions from literature.
LIPSCHITZ OPTIMIZATION FOR MULTI-OBJECTIVE PROBLEMS
TLDR
The proposed algorithm was tested using 600 random test problems of different complexity, showing competitive results with two popular advanced algorithms which are based on similar assumptions.
An Experimental Study of Univariate Global Optimization Algorithms for Finding the Shape Parameter in Radial Basis Functions
TLDR
A recently proposed approach for the search of the optimal value of the shape parameter is studied, which consists of using global optimization algorithms to minimize the error function obtained using a leave-one-out cross validation technique, which is commonly used for solving machine learning problems.
A new benchmark optimization problem of adaptable difficulty: theoretical considerations and practical testing
TLDR
The difficulty of finding the global optimum can be changed from quite small to almost insurmountable, as demonstrated by applying five widely used optimization methods, namely genetic algorithms, sequential quadratic programming, simulated annealing, Knitro and branch and bound.
A univariate global search working with a set of Lipschitz constants for the first derivative
TLDR
A new geometric method evolving its ideas to the case of the objective function having a Lipschitz derivative is introduced and studied, and numerical experiments show that the usage of derivatives allows one to obtain an acceleration in comparison with the DIRECT algorithm.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 34 REFERENCES
Test Functions with Variable Attraction Regions for Global Optimization Problems
TLDR
This paper investigates a technique for constructing test functions for global optimization problems for which the problem dimension, the number of local minima, the local minata points, and the function values of theLocal minima are fixed a priori.
Construction of large-scale global minimum concave quadratic test problems
Construction of problems with known global solutions is important for the computational testing of constrained global minimization algorithms. In this paper, it is shown how to construct a concave
Handbook of global optimization
TLDR
This paper presents algorithms for global optimization of mixed-integer nonlinear programs using the Reformulation-Linearization/Convexification Technique (RLT) and an introduction to dynamical search.
Generation of large-scale quadratic programs for use as global optimization test problems
TLDR
A method is presented for the generation of test problems for global optimization algorithms that constructs nonconvex quadratic functions whose global minimum is attained at the selected vertex.
Construction of Test Problems for a Class of Reverse Convex Programs
TLDR
The proposed method systematically generates cuts that slice the cube in such a way that a prespecified global solution on its edge remains intact.
Generating quadratic assignment test problems with known optimal permutations
TLDR
Computational results indicate that the test problems generated can be used to test the effectiveness of heuristic algorithms for the QAP and show the superiority of the new test-problem generators proposed.
Construction of test problems in quadratic bivalent programming
TLDR
A method of constructing test problems for constrained bivalent quadratic programming is presented and a standardized random test problem generator for unconstrainedquadratic zero-one programming is given.
Global minimum test problem construction
TLDR
A method is presented for the construction of test problems for which the global minimum point is known, and a concave quadratic function is constructed which attains its global minimum at the selected vertex.
A Note on the Griewank Test Function
TLDR
It turns out that a simple Multistart algorithm is able to detect its global minimum more and more easily as the dimension increases, and a justification of this counterintuitive behavior is given.
Testing Unconstrained Optimization Software
TLDR
A relatwely large but easy-to-use collection of test functions and designed gmdelines for testing the reliability and robustness of unconstrained optimization software.
...
1
2
3
4
...