<p>In this paper,we investigate the solution of the problem offinding the global minimizer for the unconstrained objective function, for that,a new algorithm developed,this algorithm based on two steps.First,we transform the problem in to a one-dimensional according to the number of directions.Second,we construct a new filled function a teach direction in order to minimize the one-dimensional problem and then to find the global minimizer of the multi-dimensional function.We present the results of numerical experiments using test problems taken from literature studies. Theexperiment results indicate the effectiveness and accuracy of the purposed filled function methods.<br></p>