Unconstrained Optimization by Approximation of the Gradient Path

A gradient-path oriented algorithm for unconstrained minimization, requiring first derivatives of the objective, is presented. The algorithm possesses the quadratic termination property and it is shown to converge to a stationary point of a continuously differentiable Function.