atrustregionalgorithmforsolvingbilevelprogrammingproblems

CSpace

	atrustregionalgorithmforsolvingbilevelprogrammingproblems
	Liu Guoshan 1; Xu Shiqin 1; Han Jiye 2
	2013-01-01
发表期刊	actamathematicaeapplicataesinica
ISSN	0168-9673
卷号	29 期号:3 页码:491
摘要	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]
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/45056
专题	中国科学院数学与系统科学研究院
作者单位	1.中国人民大学 2.中国科学院数学与系统科学研究院
推荐引用方式 GB/T 7714	Liu Guoshan,Xu Shiqin,Han Jiye. atrustregionalgorithmforsolvingbilevelprogrammingproblems[J]. actamathematicaeapplicataesinica,2013,29(3):491.
APA	Liu Guoshan,Xu Shiqin,&Han Jiye.(2013).atrustregionalgorithmforsolvingbilevelprogrammingproblems.actamathematicaeapplicataesinica,29(3),491.
MLA	Liu Guoshan,et al."atrustregionalgorithmforsolvingbilevelprogrammingproblems".actamathematicaeapplicataesinica 29.3(2013):491.