An interval algorithm for nondifferentiable global optimization
Applied Mathematics and Computation
A new hybrid genetic algorithm for global optimization
Proceedings of second world congress on Nonlinear analysts
A Nonsmooth Global Optimization Technique Using Slopes: The One-Dimensional Case
Journal of Global Optimization
A Solution Method for a Special Class of Nondifferentiable Unconstrained Optimization Problems
Computational Optimization and Applications
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
A new criterion for global robust stability of interval delayed neural networks
Journal of Computational and Applied Mathematics
A modification of the DIRECT method for Lipschitz global optimization for a symmetric function
Journal of Global Optimization
Hi-index | 7.29 |
The filled function method is an effective approach to find a global minimizer. In this paper, based on a new definition of the filled function for nonsmooth constrained programming problems, a one-parameter filled function is constructed to improve the efficiency of numerical computation. Then a corresponding algorithm is presented. It is a global optimization method which modify the objective function as a filled function, and which find a better local minimizer gradually by optimizing the filled function constructed on the minimizer previously found. Illustrative examples are provided to demonstrate the efficiency and reliability of the proposed filled function method.