期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

A Trust Region Algorithm for Solving Bilevel Programming Problems

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. 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.
作者 Guo-shan LIU Shi-qin XU Ji-ye HAN
机构地区 School of Business Academy of Mathematics and Systems Science
出处 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2013年第3期491-498,共8页 应用数学学报（英文版）
基金 Supported by the National Natural Science Foundation of China(No.11171348,11171252 and 71232011)
关键词 Bilevel programming problem trust region algorithm global convergence mathematical program with equilibrium constraints stationary point Bilevel programming problem trust region algorithm global convergence mathematical program with equilibrium constraints stationary point
分类号 O221 [理学—运筹学与控制论]
  • 相关文献

参考文献1

二级参考文献10

  • 1Outrate J V, Kocvare M, Zowe J. Nonsmooth Approach to Optimization Problems With Equilibrium Consrtaints[ M]. The Netherlands: Kluwer Academic Publishem, 1998.
  • 2Jiang H, Ralph D. Smooth SQP method for mathematical programs with nonlinear complementarity constraints[ J ]. SIAM J Optimization, 2000,10(3) : 779-808.
  • 3Fukushima M, Luo Z Q, Pang J S. A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints[ J]. Comp Opti Appl, 1998, 10 (1) :5-34.
  • 4Fukushima M, Pang J S. Some feasibility issues in mathematical programs with equilibrium constraints[J]. SIAMJ Optimization, 1998,8(3) : 673-581.
  • 5Panier E R, Tits A L. On combining feasibility, descent and superlinear convergence in inequality constrained optimization[ J]. Mathematical Programming, 1993,59(1) : 261-276.
  • 6Zhu Z B, Zhang K C. A superlineariy convergent SQP algorithm for mathematical programs with linear complementarity constraints[ J]. Applied Mathematics and Computation ,2005,172(1) : 222-244.
  • 7Panier E R, Tits A L. A stoerlinearly convergent feasible method for the solution of inequality constrained optimization problems[J]. SIAM J Control Optim, 1987,25(3) : 934-950.
  • 8Facchinei F, Dacidi S. Quadraticly and superlinearly convergent for the solution of inequality constrained op optimization problem[ J]. J Optim Theory Appl, 1995,85(2 ): 265-289.
  • 9朱志斌,罗志军,曾吉文.互补约束均衡问题一个新的磨光技术[J].应用数学和力学,2007,28(10):1253-1260. 被引量：4
  • 10马昌凤,梁国平.A New Successive Approximation Damped Newton Method for Nonlinear Complementarity Problems[J].Journal of Mathematical Research and Exposition,2003,23(1):1-6. 被引量：1

共引文献8

Acta Mathematicae Applicatae Sinica
2013年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部