Construction of large-scale global minimum concave quadratic test problems
Journal of Optimization Theory and Applications
More test examples for nonlinear programming codes
More test examples for nonlinear programming codes
A collection of test problems for constrained global optimization algorithms
A collection of test problems for constrained global optimization algorithms
Construction of test problems in quadratic bivalent programming
ACM Transactions on Mathematical Software (TOMS)
A test problem generator for the Steiner problem in graphs
ACM Transactions on Mathematical Software (TOMS)
Construction of test problems for a class of reverse convex programs
Journal of Optimization Theory and Applications
Generation of large-scale quadratic programs for use as global optimization test problems
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
Study of multiscale global optimization based on parameter space partition
Journal of Global Optimization
| Hi-index | 0.00 |
Functions with local minima and size of their ’regionof attraction‘ known a priori, are often needed for testing the performanceof algorithms that solve global optimization problems. In this paperwe investigate a technique for constructing test functions for globaloptimization problems for which we fix a priori:(i) the problem dimension,(ii) the number of local minima,(iii) the local minima points,(iv) the function values of the local minima.Further, the size of the region of attraction of each local minimum may bemade large or small.The technique consists of first constructing a convex quadratic function andthen systematically distorting selected parts of this function so as tointroduce local minima.