An Improved HS Type Spectral Conjugate Gradient Method
Abstract
unconstrained optimization problems. In this paper, an improved HS spectral conjugate gradient method is proposed. Under
common assumptions, the descent and global convergence of this method are proved.
Keywords
Full Text:
PDFReferences
[1] Aiguo Lu et al. A variant spectral-type FR conjugate gradient method and its global convergence[J]. Applied Mathematics and Computation, 2011, 217(12) : 5547-5552.
[2] Chen LW, Xia F Q, Jia Z Y. A new PRP type spectral conjugate gradient method and its global convergence [J].Journal of He- nan Normal University (Natural Science),2013,41(03): 5-9+14.
[3] Neculai Andrei. A new three-term conjugate gradient algorithm for unconstrained optimization[J].Numerical Algorithms,2015, 68(2):305-321.
[4] Wang G F, Shan R, Huang W, et al. Two newspectralconjugategradient algorithms based on Hestenes - Stiefel.J. Algorithms Comput. Technol. 2017,11(4):345–352.[5]Fang M L, Sun M, A modified DY spectral conjugate gradient method based on Wolfe line searching, Journal of Yangtze University(Nat Scl Edit),15(13)(2018) 7-10.
DOI: https://doi.org/10.18282/l-e.v10i3.2422
Refbacks
- There are currently no refbacks.