KMS Of Academy of mathematics and systems sciences, CAS
A trust-region and affine scaling algorithm for linearly constrained optimization | |
Chen, ZW; Zhang, XS | |
2002-11-01 | |
发表期刊 | SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY |
ISSN | 1006-9283 |
卷号 | 45期号:11页码:1390-1397 |
摘要 | A new trust-region and affine scaling algorithm for linearly constrained optimization is presented in this paper. Under no nondegenerate assumption, we prove that any limit point of the sequence generated by the new algorithm satisfies the first order necessary condition and there exists at least one limit point of the sequence which satisfies the second order necessary condition. Some preliminary numerical experiments are reported. |
关键词 | linear constraint trust-region affine scaling interior point method |
语种 | 英语 |
WOS研究方向 | Mathematics |
WOS类目 | Mathematics, Applied ; Mathematics |
WOS记录号 | WOS:000179209500004 |
出版者 | SCIENCE CHINA PRESS |
引用统计 | |
文献类型 | 期刊论文 |
条目标识符 | http://ir.amss.ac.cn/handle/2S8OKBNM/17574 |
专题 | 应用数学研究所 |
通讯作者 | Zhang, XS |
作者单位 | 1.Suzhou Univ, Dept Math, Suzhou 215006, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China |
推荐引用方式 GB/T 7714 | Chen, ZW,Zhang, XS. A trust-region and affine scaling algorithm for linearly constrained optimization[J]. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY,2002,45(11):1390-1397. |
APA | Chen, ZW,&Zhang, XS.(2002).A trust-region and affine scaling algorithm for linearly constrained optimization.SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY,45(11),1390-1397. |
MLA | Chen, ZW,et al."A trust-region and affine scaling algorithm for linearly constrained optimization".SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY 45.11(2002):1390-1397. |
条目包含的文件 | 条目无相关文件。 |
个性服务 |
推荐该条目 |
保存到收藏夹 |
查看访问统计 |
导出为Endnote文件 |
谷歌学术 |
谷歌学术中相似的文章 |
[Chen, ZW]的文章 |
[Zhang, XS]的文章 |
百度学术 |
百度学术中相似的文章 |
[Chen, ZW]的文章 |
[Zhang, XS]的文章 |
必应学术 |
必应学术中相似的文章 |
[Chen, ZW]的文章 |
[Zhang, XS]的文章 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论