Convergence of nonlinear conjugate gradient methods

	Convergence of nonlinear conjugate gradient methods
	Dai, YH
	2001-09-01
发表期刊	JOURNAL OF COMPUTATIONAL MATHEMATICS
ISSN	0254-9409
卷号	19 期号:5 页码:539-548
摘要	This paper proves that a simplified Armijo-type line search can ensure the global convergences of the Fletcher-Reeves method and the Polak-Ribiere-Polyak method for unconstrained optimization. Although it seems not possible to verify that the PRP method using the generalized Armijo line search converges globally for generally problems, it can be shown that in this case the PRP method always solves uniformly convex problems.
关键词	unconstrained optimization conjugate gradient (generalized) line search global convergence
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied ; Mathematics
WOS记录号	WOS:000170843600010
出版者	VSP BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/16455
专题	计算数学与科学工程计算研究所
作者单位	Chinese Acad Sci, Acad Math & Syst Sci, ICMSEC, LSEC, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Dai, YH. Convergence of nonlinear conjugate gradient methods[J]. JOURNAL OF COMPUTATIONAL MATHEMATICS,2001,19(5):539-548.
APA	Dai, YH.(2001).Convergence of nonlinear conjugate gradient methods.JOURNAL OF COMPUTATIONAL MATHEMATICS,19(5),539-548.
MLA	Dai, YH."Convergence of nonlinear conjugate gradient methods".JOURNAL OF COMPUTATIONAL MATHEMATICS 19.5(2001):539-548.