An integral-level set method for solving global optimization problems was proposed in 1978 and improved in 1999.

This paper presents a modified conceptual algorithm that has two characteristics: (1) each phase must construct a new function and this function and the primitive objective function have the same global optimization; (2) compared with Zheng s method, the proposed algorithm avoids solving level set procedure.

In “A method for solving global optimization”, Zheng proposed an integral level set method for solving global optimization that it is only a theoretic algorithm, its actual algorithm is performed by stochastic sampling, hence, its actual algorithm convergence is unsolved problem.

In this paper,we investigate the method which use mathematical ex- pectation of level value to approximate to the global minimum of a class optimization problem.

This paper presents a new numerical method for searching global minimum of some kind of multidimensional functions by synthesizirig three determinate and random methods.

Based on interval analysis,in this paper, an interval algorithm for solving global optimization of nondifferential functions is proposed,which is developed by defining a special gradient to the functions and uses the interval extension of gradient.