Abstract: Global optimization problem still become an interest because of the challenge on finding global minimizer(s) of nonlinear objective function with multiple local minima. In this study, the parameter free filled function method is proposed. The algorithm method is combination of parameter free filled function Newton’s method and steepest descent method. Algorithm method is implemented to two and three-dimensional benchmark test functions. The numerical performance shows that the method succeeds on solving unconstrained global optimization problem.