A stable second-order unconstrained minimization algorithm with quadratic termination is given. The algorithm does not require any one-dimensional minimizations. Computational results presented indicate that the performance of this algorithm compares favorably with other well-known unconstrained minimization algorithms.
No takes yet. Share an insight, caveat, or question.
Ronald Bass (1972) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: