CONVERGENCE OF DFP ALGORITHM

	CONVERGENCE OF DFP ALGORITHM
	YUAN, YX
	1995-11-01
发表期刊	SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY & TECHNOLOGICAL SCIENCES
ISSN	1001-6511
卷号	38 期号:11 页码:1281-1294
摘要	The DFP method is one of the most famous numerical algorithms for unconstrained optimization. For uniformly convex objective functions convergence properties of the DFP method are studied. Several conditions that can ensure the global convergence of the DFP method are given.
关键词	GLOBAL CONVERGENCE DFP ALGORITHM LINE SEARCH
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied ; Mathematics
WOS记录号	WOS:A1995TH48300001
出版者	PERGAMON-ELSEVIER SCIENCE LTD
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/28563
专题	计算数学与科学工程计算研究所
通讯作者	YUAN, YX
作者单位	CHINESE ACAD SCI,ICMSEC,STATE KEY LAB SCI & ENGN COMP,BEIJING 100080,PEOPLES R CHINA
推荐引用方式 GB/T 7714	YUAN, YX. CONVERGENCE OF DFP ALGORITHM[J]. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY & TECHNOLOGICAL SCIENCES,1995,38(11):1281-1294.
APA	YUAN, YX.(1995).CONVERGENCE OF DFP ALGORITHM.SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY & TECHNOLOGICAL SCIENCES,38(11),1281-1294.
MLA	YUAN, YX."CONVERGENCE OF DFP ALGORITHM".SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY & TECHNOLOGICAL SCIENCES 38.11(1995):1281-1294.