A new memory gradient method under exact line search

CSpace

	A new memory gradient method under exact line search
	Shi, ZJ
	2003-11-01
发表期刊	ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
ISSN	0217-5959
卷号	20 期号:2 页码:275-284
摘要	The paper presents a new memory gradient method for unconstrained optimization problem, and proves the convergence of the algorithm under exact line searches. The linear convergence rate is investigated when the objective function is uniformly convex. Numerical experiments show that the new algorithm is very effective in practice.
关键词	unconstrained optimization memory gradient method exact line search convergence numerical experiment
语种	英语
WOS研究方向	Operations Research & Management Science
WOS类目	Operations Research & Management Science
WOS记录号	WOS:000187459600009
出版者	ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/18209
专题	中国科学院数学与系统科学研究院
通讯作者	Shi, ZJ
作者单位	1.Qufu Normal Univ, Coll Operat Res & Management, Rizhao 276826, Shandong, Peoples R China 2.Chinese Acad Sci, Inst Computat Math & Sci Engn Comp, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Shi, ZJ. A new memory gradient method under exact line search[J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH,2003,20(2):275-284.
APA	Shi, ZJ.(2003).A new memory gradient method under exact line search.ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH,20(2),275-284.
MLA	Shi, ZJ."A new memory gradient method under exact line search".ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 20.2(2003):275-284.