期刊文献+

一类等式约束非线性优化问题的序列二次规划新方法 被引量:2

A New Sequential Quadratic Programming Method for Nonlinear Equality-Constrained Optimization
原文传递
导出
摘要 本文提出一类新的序列二次规划方法来求解等式约束的非线性优化问题,方法不使用罚函数,避开了罚因子的选取对数值结果的影响,也不采用滤子技巧,去除了滤子方法中的恢复过程。在两个温和条件的假设下,步长的选取不需要目标函数和约束违反度的充分下降,扩大了算法的适用范围,证明了算法的全局收敛性。使用Matlab软件,编写了算法的程序,进行了数值试验,并与著名的优化软件LANCELOT比较,结果表明算法强健有效。 This paper presented a new sequence quadratic programming method for solving nonlinear equality constrained optimiza- tion problems. The new method did not use the penalty function, avoided the selection of penalty factor for the numerical results, and also did not use filter tips, removing the filter method in the recovery process. In two mild conditions under the assumption, step size did not need the objective function and the constraint violation for the sufficient descent, expanding the scope of application of the algorithm, the global convergence was proved. Using Matlab software, the preparation of the algorithm procedures, numeri- cal experiments are carried out, and compared with the well-known optimization software LANCELOT, the results show that the algorithm is robust and effective.
出处 《重庆师范大学学报(自然科学版)》 CAS CSCD 北大核心 2014年第2期1-4,共4页 Journal of Chongqing Normal University:Natural Science
基金 常州工学院校级基金(No.YN1312)
关键词 等式约束 序列二次规划 全局收敛 equality-constrained sequential quadratic programming methodl global convergence
  • 相关文献

参考文献11

  • 1Nocedal J, Wright S. Numerical optimization[M]. New York: Springer-Verlag, 1999.
  • 2Sun W Y, Yuan Y X. Optimization Theory and Methods: Nonlinear Programming[M]. New York: Springer Press, 2006.
  • 3Fletcher R, Leyffer S, Toint P L. On the global convergence of a filter-SQP algorithm[J]. SIAM J Optim , 2012,13 (1) : 44-59.
  • 4Ulbrich M, Ulbrich S, Vicente L N. A globally convergent primal-dual interior-point filter method for nonlinear programming[J]. Math Program,2004,100(2) ,379-410.
  • 5Gould N I M,Toint P L. Nonlinear programming without a penalty function or a filter[J]. Math Program, 2009, 122 (1): 155-196.
  • 6Ulbrich M, Ulbrich S. Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function[J]. Math Program, 2003,95(1) : 103-135.
  • 7Solodov M. Global convergence of an SQP method without bounded ness assumptions on any of the iterative sequences[J]. Math. Program,2009,118(1):1-12.
  • 8Andreani R, Birgin E G, Martinez J M, et al. Augmented Lagrangian methods under the constant positive linear dependence constraint qualification[J]. Mathematical Programming, 2007,111 (1) : 5-32.
  • 9Chen L F,Goldfarb D. Interior-point-penalty methods for nonlinear programming with strong global convergence properties[J]. Mathematical Programming, 2006 ,108 (1) : 1-36.
  • 10Liu X W, Yuan Y X. A null-space primal-dual interiorpoint algorithm for nonlinear optimization with nice convergence properties[J]. Mathematical Programming, 2010,125(1):163-193.

同被引文献14

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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