中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A note on the convergence of the DFP algorithm on quadratic uniformly convex functions

文献类型:期刊论文

作者Liu, GH; Han, JY; Xu, DC
刊名OPTIMIZATION
出版日期2002-04-01
卷号51期号:2页码:339-352
关键词global convergence DFP algorithm inexact line search
ISSN号0233-1934
DOI10.1080/02331930290019468
英文摘要This paper analyzes the open question of the convergence of the DFP algorithm with inexact line searches. We prove that the DFP algorithm is convergent for quadratic uniformly convex function with commonly used inexact line searches.
WOS研究方向Operations Research & Management Science ; Mathematics
语种英语
WOS记录号WOS:000175121700008
出版者TAYLOR & FRANCIS LTD
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/17989]  
专题中国科学院数学与系统科学研究院
通讯作者Liu, GH
作者单位1.Unitd Airlines, WHQKB, Res & Dev, Elk Grove Village, IL 60007 USA
2.Chinese Acad Sci, Inst Appl Math, Acad Math & Syst Sci, Beijing 100080, Peoples R China
3.Chinese Acad Sci, Inst Computat Math & Sci Engn Comp, Acad Math & Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Liu, GH,Han, JY,Xu, DC. A note on the convergence of the DFP algorithm on quadratic uniformly convex functions[J]. OPTIMIZATION,2002,51(2):339-352.
APA Liu, GH,Han, JY,&Xu, DC.(2002).A note on the convergence of the DFP algorithm on quadratic uniformly convex functions.OPTIMIZATION,51(2),339-352.
MLA Liu, GH,et al."A note on the convergence of the DFP algorithm on quadratic uniformly convex functions".OPTIMIZATION 51.2(2002):339-352.

入库方式: OAI收割

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

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

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