PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 1, 1967Mathematics of Computation123 citations

On the relative efficiencies of gradient methods

View Full Paper
JGJohn Greenstadt

Key Points

Key points are not available for this paper at this time.

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

John Greenstadt (1967) studied this question.

synapsesocial.com/papers/6a7988ee1ba4614d7ff38e38https://doi.org/10.1090/s0025-5718-1967-0223073-7
Ask AI
Helpful
Bookmark
Share
View Full Paper