Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Vial et al. (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: