DocumentCode
2414726
Title
A Nonlinear Conjugate Gradient Method without Line Search and Its Global Convergence
Author
Wu, Qing-jun
fYear
2011
fDate
21-23 Oct. 2011
Firstpage
1148
Lastpage
1152
Abstract
Based on the method of Sun and Zhang (2001), we present a conjugate gradient method without line search. At each iteration, the step size is determined by a formula, which does not involve any matrix and uses both available function value and gradient information. Under mild assumptions, we prove that the proposed method has global convergence if the parameter is computed by five well-known formulae given by Feltcher-Reeves, Polak-Ribiere, Hestenses-Stiefel, Dai-Yuan and the conjugate descent method.
Keywords
Convergence; Educational institutions; Gradient methods; Search problems; Sun; Tensile stress; conjugate gradient methods; global convergence; line search; unconstrained optimization;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational and Information Sciences (ICCIS), 2011 International Conference on
Conference_Location
Chengdu, China
Print_ISBN
978-1-4577-1540-2
Type
conf
DOI
10.1109/ICCIS.2011.45
Filename
6086409
Link To Document