A new filled function method for global optimization

A new definition of the filled function is given in this paper. Based on the definition, a new filled function which has better characters is presented. And an algorithm for the global optimization problem is developed. As a result, the computational cost of the proposed filled function method is much less than that of other filled function methods. The implementation of the algorithm on several test problems is reported with satisfactory numerical results.