A class of filled functions for finding global minimizers of a function of several variables

This paper is concerned with filled function methods for finding global minimizers of a function of several variables. A class of filled functions is defined. The advantages and disadvantages of every filled function in the class are analyzed. The best one in this class is pointed out. The idea behind constructing a better filled function is given and employed to construct the class of filled functions. A method is also explored on how to locate minimizers or saddle points of a filled function through only the use of the gradient of a function.