Vol. 16, No. 1, 1966

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 331: 1  2
Vol. 330: 1  2
Vol. 329: 1  2
Vol. 328: 1  2
Vol. 327: 1  2
Vol. 326: 1  2
Vol. 325: 1  2
Vol. 324: 1  2
Online Archive
Volume:
Issue:
     
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Officers
 
Subscriptions
 
ISSN 1945-5844 (electronic)
ISSN 0030-8730 (print)
 
Special Issues
Author index
To appear
 
Other MSP journals
Minimization of functions having Lipschitz continuous first partial derivatives

Larry Armijo

Vol. 16 (1966), No. 1, 1–3
Abstract

A general convergence theorem for the gradient method is proved under hypotheses which are given below. It is then shown that the usual steepest descent and modified steepest descent algorithms converge under the same hypotheses. The modified steepest descent algorithm allows for the possibility of variable stepsize.

Mathematical Subject Classification
Primary: 65.10
Secondary: 65.30
Milestones
Received: 30 January 1964
Published: 1 January 1966
Authors
Larry Armijo