DocumentCode
812485
Title
On the rate of convergence of the conjugate gradient reset method with inaccurate linear minimizations
Author
Kawamura, Kazuhiko ; Volz, Ridhard A.
Author_Institution
University of Michigan, Dearborn, MI, USA
Volume
18
Issue
4
fYear
1973
fDate
8/1/1973 12:00:00 AM
Firstpage
360
Lastpage
366
Abstract
Recently Klessig and Polak have shown that a variation of the Polak-Ribière conjugate gradient reset algorithm converges 
-step quadratically even if the one-dimensional search is not performed exactly. It is shown here that -step quadratic convergence is also obtained for a modification of the Fletcher-Reeves conjugate gradient reset algorithm with inaccurate one-dimensional search.
-step quadratically even if the one-dimensional search is not performed exactly. It is shown here that -step quadratic convergence is also obtained for a modification of the Fletcher-Reeves conjugate gradient reset algorithm with inaccurate one-dimensional search.Keywords
Gradient methods; Convergence; Minimization methods;
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/TAC.1973.1100349
Filename
1100349
Link To Document