期刊文献+

A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities 被引量:1

A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities
原文传递
导出
摘要 We consider a class of mathematical programs governed by parameterized quasi-variational inequalities(QVI).The necessary optimality conditions for the optimization problem with QVI constraints are reformulated as a system of nonsmooth equations under the linear independence constraint qualification and the strict slackness condition.A set of second order sufficient conditions for the mathematical program with parameterized QVI constraints are proposed,which are demonstrated to be sufficient for the second order growth condition.The strongly BD-regularity for the nonsmooth system of equations at a solution point is demonstrated under the second order sufficient conditions.The smoothing Newton method in Qi-Sun-Zhou [2000] is employed to solve this nonsmooth system and the quadratic convergence is guaranteed by the strongly BD-regularity.Numerical experiments are reported to show that the smoothing Newton method is very effective for solving this class of optimization problems. We consider a class of mathematical programs governed by parameterized quasi-variational inequalities(QVI).The necessary optimality conditions for the optimization problem with QVI constraints are reformulated as a system of nonsmooth equations under the linear independence constraint qualification and the strict slackness condition.A set of second order sufficient conditions for the mathematical program with parameterized QVI constraints are proposed,which are demonstrated to be sufficient for the second order growth condition.The strongly BD-regularity for the nonsmooth system of equations at a solution point is demonstrated under the second order sufficient conditions.The smoothing Newton method in Qi-Sun-Zhou [2000] is employed to solve this nonsmooth system and the quadratic convergence is guaranteed by the strongly BD-regularity.Numerical experiments are reported to show that the smoothing Newton method is very effective for solving this class of optimization problems.
出处 《Science China Mathematics》 SCIE 2011年第6期1269-1286,共18页 中国科学:数学(英文版)
基金 supported by National Natural Science Foundation of China (Grant No.11071029) the Fundamental Research Funds for the Central Universities
关键词 smoothing Newton method MPEC QVI optimality conditions 数学规划方法 拟变分不等式 牛顿方法 不等式约束 平滑 非光滑方程组 优化问题 充分条件
  • 相关文献

参考文献26

  • 1Xiaojun Chen,Masao Fukushima.A Smoothing Method for a Mathematical Program with P-Matrix Linear Complementarity Constraints[J]. Computational Optimization and Applications . 2004 (3)
  • 2Liqun Qi,Defeng Sun,Guanglu Zhou.A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities[J]. Mathematical Programming . 2000 (1)
  • 3Houyuan Jiang,Daniel Ralph.QPECgen, a MATLAB Generator for Mathematical Programs with Quadratic Objectives and Affine Variational Inequality Constraints[J]. Computational Optimization and Applications . 1999 (1-3)
  • 4Andreas Fischer.Solution of monotone complementarity problems with locally Lipschitzian functions[J]. Mathematical Programming . 1997 (3)
  • 5Ji?í Outrata,Jochem Zowe.A numerical approach to optimization problems with variational inequality constraints[J]. Mathematical Programming . 1995 (1-3)
  • 6Liqun Qi,Jie Sun.A nonsmooth version of Newton’s method[J]. Mathematical Programming . 1993 (1-3)
  • 7Roger L. Tobin.Uniqueness results and algorithm for Stackelberg-Cournot-Nash equilibria[J]. Annals of Operations Research . 1992 (1)
  • 8Patrick T. Harker,Jong-Shi Pang.Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications[J]. Mathematical Programming . 1990 (1-3)
  • 9Terry L. Friesz,Roger L. Tobin,Hsun-Jung Cho,Nihal J. Mehta.Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints[J]. Mathematical Programming . 1990 (1-3)
  • 10P. Marcotte.Network design problem with congestion effects: A case of bilevel programming[J]. Mathematical Programming . 1986 (2)

同被引文献1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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