On the Relative Efficiencies of Gradient Methods
- 1 July 1967
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 21 (99) , 360-367
- https://doi.org/10.2307/2003238
Abstract
A comparison is made among various gradient methods for maximizing a function, based on a characterization by Crockett and Chernoff of the class of these methods. By defining the “efficiency” of a gradient step in a certain way, it becomes easy to compare the efficiencies of different schemes with that of Newton’s method, which can be regarded as a particular gradient scheme. For quadratic functions, it is shown that Newton’s method is the most efficient (a conclusion which may be approximately true for nonquadratic functions). For functions which are not concave (downward), it is shown that the Newton direction may be just the opposite of the most desirable one. A simple way of correcting this is explained.Keywords
This publication has 3 references indexed in Scilit:
- A Rapidly Convergent Descent Method for MinimizationThe Computer Journal, 1963
- Gradient methods of maximizationPacific Journal of Mathematics, 1955
- Methods of Mathematical Physics, Vol. IPhysics Today, 1954