期刊文献+

一类积极集SQP滤子方法 被引量:4

Active Set Sequential Quadratic Programming Filter Method
下载PDF
导出
摘要 积极集策略是在约束最优化问题中减少约束条件个数的一个有效手段.基于此策略,结合序列二次规划(SQP)方法,并利用滤子以避免罚函数的使用,提出了一类积极集SQP滤子方法,并在合理条件下证明了算法的全局收敛性.数值结果表明算法是有效的. The active set technique is one of the most effective methods for reducing the number of constraints in the nonlinear optimization. Based on this technique and the sequential quadratic programming (SQP) method,a new active set filter SQP method is proposed in which the penalty function is not required by filter strategy. The global convergence is obtained under some reasonable conditions. And some numerical results are reported in this paper.
作者 苏珂 濮定国
机构地区 同济大学数学系
出处 《同济大学学报(自然科学版)》 EI CAS CSCD 北大核心 2008年第5期690-694,共5页 Journal of Tongji University:Natural Science
基金 国家自然科学基金资助项目(1057113710771162)
关键词 约束最优化 积极集 滤子方法 序列二次规划 非线性规划 constrained optimization active set filter method sequential quadratic programming nonlinear programming
  • 相关文献

参考文献8

  • 1Han S P. Superlinearly convergence variable metric algorithm for general nonlinear programming problems [ J ]. Math Program,1976,11:263.
  • 2Han S P. A globally convergent method for nonlinear programming [J]. J Optim The ory Appl, 1977,22:297.
  • 3Liu X W. Global convergence on an active set SQP for inequality constrained optimization[J]. J Comput Appl Math,2005,180:201.
  • 4Fletcher R, Leyffer S. Nonlinear programming without a penalty function[J]. Math Program,2002,91:239.
  • 5Fletcher R, Leyffer S, Toint P L. On the global convergence of a filter-SQP algorithm[ J ]. SIAM J Optim,2002,13 : 44.
  • 6Fletcher R, Leyffer S. A boundle filter method for north nonlinear optimization [ R ]. Scotland: University of Dundee, Department of Mathematics, 1999.
  • 7Fletcher R,Gould N I M,Leyffer S,et al. Global convergence of a trust region SQP-filter algorithm for general nonlinear programming[J]. SIAM J Optim,2002,13:635.
  • 8Hock W, Schittkowski K. Test examples for nonlinear programming codes[M]. Berlin: Springer- Verlag, 1981.

同被引文献20

  • 1聂普焱.筛选法解非线性方程组[J].应用数学学报,2004,27(3):407-415. 被引量:3
  • 2朱志斌,张可村.Minimax问题的一个超线性收敛的SQP算法[J].数值计算与计算机应用,2005,26(3):161-176. 被引量:4
  • 3Fletcher R, Leyffer S. Nonlinear Programming Without A Penalty Function [ J ]. Mathematical Programming,2002, 91 (2) :239.
  • 4Panier E R, Tits A L. A Superlinearly Convergent Feasible Method For The Solution of Inequality Constrained Optimization Problems. SIAM [J]. Control And Optimization, 1987,25:934-950.
  • 5Charelambous C and Conn A R. An Efficient Method To Solre The Minimax Problem Directly [ J]. SIAM J. Numer. Anal. , 1978,15:162 -187.
  • 6Zhou J L, Tits A L. Nonmonotone Line Search For Minimax Problem[ J] . JOTA, 1993,76:455 - 476.
  • 7Chen J S. The Semi - smooth-related Properties Of A Merit Function And A Descent Method For The Nonlinear Complementarity Problem[ J]. J Glob Optim, 2006, 36:565 - 580.
  • 8ZHANG L P, GAO Z Y . Superlinear/Quadratic One-step Smoothing Newton Method For PO-NCP Without Strict Complementarity [ J]. Mathematical Methods Of Operation Research , 2002, 56:231 - 241.
  • 9Fletcher, Gould NIM, Leyffer S, et al. Global Convergence Of A Trust Region SQP-filter Algorithm for General Nonlinear Programming [ J]. SIAM Journal On Optimization, 2002, 13:635.
  • 10周岩,濮定国.解约束优化问题的QP-free可行域方法(英文)[J].运筹学学报,2007,11(3):31-43. 被引量:5

引证文献4

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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