中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A trust region algorithm for bilevel programing problems

文献类型:期刊论文

作者Liu, GS; Han, JY; Wang, SY
刊名CHINESE SCIENCE BULLETIN
出版日期1998-05-01
卷号43期号:10页码:820-824
关键词bilevel programming problem trust region algorithm global convergence
ISSN号1001-6538
英文摘要A trust region algorithm is proposed for solving bilevel programming problems where the lower level programming problem is a strongly convex programming problem with linear constraints. This algorithm is based on a trust region algorithm for nonsmooth unconstrained optimization problems, and its global convergence is also proved.
WOS研究方向Science & Technology - Other Topics
语种英语
WOS记录号WOS:000074493200009
出版者SCIENCE PRESS
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/14021]  
专题中国科学院数学与系统科学研究院
通讯作者Liu, GS
作者单位1.Beijing Normal Univ, Dept Math, Beijing 100875, Peoples R China
2.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
3.Chinese Acad Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Liu, GS,Han, JY,Wang, SY. A trust region algorithm for bilevel programing problems[J]. CHINESE SCIENCE BULLETIN,1998,43(10):820-824.
APA Liu, GS,Han, JY,&Wang, SY.(1998).A trust region algorithm for bilevel programing problems.CHINESE SCIENCE BULLETIN,43(10),820-824.
MLA Liu, GS,et al."A trust region algorithm for bilevel programing problems".CHINESE SCIENCE BULLETIN 43.10(1998):820-824.

入库方式: OAI收割

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

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

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