中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
CONVERGENCE OF DFP ALGORITHM

文献类型:期刊论文

作者YUAN, YX
刊名SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY & TECHNOLOGICAL SCIENCES
出版日期1995-11-01
卷号38期号:11页码:1281-1294
关键词GLOBAL CONVERGENCE DFP ALGORITHM LINE SEARCH
ISSN号1001-6511
英文摘要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.
语种英语
WOS记录号WOS:A1995TH48300001
出版者PERGAMON-ELSEVIER SCIENCE LTD
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/28562]  
专题计算数学与科学工程计算研究所
通讯作者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.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。