中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A Trust Region Algorithm for Solving Bilevel Programming Problems

文献类型:期刊论文

作者Liu Guoshan1; Xu Shiqin1; Han Jiye2
刊名ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES
出版日期2013
卷号29期号:3页码:491-498
关键词NONSMOOTH OPTIMIZATION CONVERGENCE Bilevel programming problem trust region algorithm global convergence mathematical program with equilibrium constraints stationary point
ISSN号0168-9673
其他题名A Trust Region Algorithm for Solving Bilevel Programming Problems
英文摘要In this paper, we present a new trust region algorithm for a nonlinear bilevel programming problem by solving a series of its linear or quadratic approximation subproblems. For the nonlinear bilevel programming problem in which the lower level programming problem is a strongly convex programming problem with linear constraints, we show that each accumulation point of the iterative sequence produced by this algorithm is a stationary point of the bilevel programming problem.
资助项目[National Natural Science Foundation of China]
语种英语
CSCD记录号CSCD:4851584
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/53389]  
专题中国科学院数学与系统科学研究院
作者单位1.中国人民大学
2.中国科学院数学与系统科学研究院
推荐引用方式
GB/T 7714
Liu Guoshan,Xu Shiqin,Han Jiye. A Trust Region Algorithm for Solving Bilevel Programming Problems[J]. ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES,2013,29(3):491-498.
APA Liu Guoshan,Xu Shiqin,&Han Jiye.(2013).A Trust Region Algorithm for Solving Bilevel Programming Problems.ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES,29(3),491-498.
MLA Liu Guoshan,et al."A Trust Region Algorithm for Solving Bilevel Programming Problems".ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES 29.3(2013):491-498.

入库方式: OAI收割

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

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

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