期刊文献+

线性互补约束优化序列线性方程组算法的一个降维技术 被引量:2

A technique of reducing dimension on sequential system of linear equations algorithm for optimization with linear complementary constraints
下载PDF
导出
摘要 线性互补约束优化是一类特殊的非线性优化问题,利用广义互补函数将其转换为含参数μ的光滑非线性约束优化问题,然后利用牛顿步和积极集思想改写光滑非线性问题的KKT条件,得到一个线性方程组。经过适当讨论,使得每次迭代仅需求解低维线性方程组,从而进一步减小了计算量。 Mathematical programs with linear complementarity constraints are a special kind of nonlinear optimization problem. Through introducing generalized complementary function, the original problem is transformed into a smoothing nonlinear constraint problem containing Parameter μ. Then, using Newton iteration and active set strategy, the KKT systems of the nonlinear problem are changed as a system of linear equations. After some discussion, we only need solving a system of linear equations with lower dimension under appreciate condition. Thus the cost of computation becomes smaller.
作者 张聪 朱志斌
出处 《桂林电子科技大学学报》 2008年第4期327-329,共3页 Journal of Guilin University of Electronic Technology
基金 国家自然科学基金项目(0501009) 广西自然科学基金项目(桂科自0728206)
关键词 线性互补约束 牛顿步 积极集策略 KKT条件 linear complementary constraints Newton method Active set strategy KKT condition
  • 相关文献

参考文献4

  • 1CHEN X J, Fukushima M. A smoothing method for a mathematical programm with P-matrix linear complementarity constraints[J]. Computational Optimization and Application,2004, 27:223-246.
  • 2ZHU Z B, ZHANG K C. A superlinearly convergent SQP algorithm for mathematical programm with linear complementarity Constraints[J]. Application and Computation, 2006,172:222- 244.
  • 3FUKUSHIMA M,LUO Z Q,PANG J S. A golbally convergent Sequential quadratic programming algorithm for mathematical programs with linear complementarity Constraints[J]. Computational Optimization and Application, 1998,10 : 5-34.
  • 4LI J L, JIAN J B. A Superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints [J]. Journal of Global Optimization, 2005,33: 477-510.

同被引文献12

  • 1文新辉.一类求解无约束min-max问题的新算法[J].西安电子科技大学学报,1989,16(2):166-174. 被引量:2
  • 2陈小红,马昌凤.非线性互补问题光滑牛顿法的全局收敛性[J].桂林电子科技大学学报,2006,26(5):402-405. 被引量:9
  • 3简金宝,覃义,梁玉梅.非线性互补约束规划的一个广义强次可行方向算法[J].高等学校计算数学学报,2007,29(1):15-27. 被引量:7
  • 4LUO Z Q, PANG J S, RALPH D, WU S Q. Exact penalization and stationary conditions of mathematical programs with equilibrium constraints [J]. Mathematical programming, 1996 (75) :19-76.
  • 5JIANG H Y,RALPH D. Smooth SQP methods for mathematical programs with nonlinear complementarity constraints [J]. SIAM J Optim,2000(10) :779-808.
  • 6FUKUSHIMA M, LUO Z Q, FANG J S. A globally convergent sequential quadratic programming algorithm for mathematic programs with linear complementarity constraints[J]. Comput Optim Appl, 1998(10) : 5-34.
  • 7FENG Ye. A smoothing trust-region Newton-CG method for minimax problem[J]. Applied Mathematics and Computation, 2008,199: 581-589.
  • 8ZANG I. A smoothing technique for rain-max optimization[J]. Mathematical Programming, 1980, 19: 61-77.
  • 9POLAK E, ROYSET J O, WOMERSLEY R. S. Algorithms with adaptive smoothing for minimax problems[J]. Journal of Optimization Theory and Applications, 2003,119(3):459-484.
  • 10PAN Shao-hua. An efficient algorithm for the smallest enclosing ball problem in high dimensions[J]. Applied Mathematics and Computation, 2006,172 : 49-61.

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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