An improvement on the Newton-Gauss algorithm

One of the primary objectives in the design of optimization algorithms is the reduction of computation time. Such a reduction is accomplished by ensuring as rapid a convergence as possible. This letter presents one-dimensional search procedure which improves the rate of convergence of the Newton-Gauss algorithm.