A collection of test problems for constrained global optimization algorithms
A collection of test problems for constrained global optimization algorithms
A Nonsmooth Global Optimization Technique Using Slopes: The One-Dimensional Case
Journal of Global Optimization
Three-Dimensional Model Based Face Recognition
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
A filled function method for constrained global optimization
Journal of Global Optimization
Fusion of classifiers for illumination robust face recognition
Expert Systems with Applications: An International Journal
Computers & Mathematics with Applications
Coefficient estimation of IIR filter by a multiple crossover genetic algorithm
Computers & Mathematics with Applications
Hi-index | 0.09 |
In this paper, we propose a filled function method for solving nonsmooth constrained global optimization problems. Based on a new definition of the filled function, a more practical one-parameter filled function is constructed which overcomes some drawbacks of the previous filled functions. Then a corresponding algorithm is presented. It attains a local minimizer by implementing a local search procedure, and finds a better local minimizer gradually by optimizing the filled function constructed on the minimizer, previously found. By repeating these steps, a global minimizer is obtained. Numerical experiments are presented to show the practicability of the proposed filled function method. In the end, extension conceivable applications are given in order to evaluate the merits of this method.