中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Compute a Celis-Dennis-Tapia step

文献类型:期刊论文

作者Li, GD; Yuan, YX
刊名JOURNAL OF COMPUTATIONAL MATHEMATICS
出版日期2005-09-01
卷号23期号:5页码:463-478
关键词the CDT subproblem local solution global solution dual function
ISSN号0254-9409
英文摘要In this paper, we present an algorithm for the CDT subproblem. This problem stems from computing a trust region step of an algorithm, which was first proposed by Celis, Dennis and Tapia for equality constrained optimization. Our algorithm considers general case of the CDT subproblem, convergence of the algorithm is proved. Numerical examples are also provided.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000232012900002
出版者VSP BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/1032]  
专题计算数学与科学工程计算研究所
通讯作者Li, GD
作者单位1.Beijing Univ Technol, Coll Appl Sci, Beijing 100022, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Li, GD,Yuan, YX. Compute a Celis-Dennis-Tapia step[J]. JOURNAL OF COMPUTATIONAL MATHEMATICS,2005,23(5):463-478.
APA Li, GD,&Yuan, YX.(2005).Compute a Celis-Dennis-Tapia step.JOURNAL OF COMPUTATIONAL MATHEMATICS,23(5),463-478.
MLA Li, GD,et al."Compute a Celis-Dennis-Tapia step".JOURNAL OF COMPUTATIONAL MATHEMATICS 23.5(2005):463-478.

入库方式: OAI收割

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

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

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