A global optimization using interval arithmetic

In order to establish an algorithm for bounding the global minimizers of a twice continuously differentiable function f :Rn ? R1 in a given box ( a compact interval in Rn ) using interval arithmetic, which is superior in the sense of less time needed compared to other method ([2]), in this paper we will attempt to describe as much as possible the ideas which presents and fulfill the explicitly mentioned algorithm