首页 | 官方网站   微博 | 高级检索  
     

一类新的求解非线性规划的SQP方法
引用本文:景书杰 张志荣. 一类新的求解非线性规划的SQP方法[J]. 焦作工学院学报, 2007, 26(2): 221-224
作者姓名:景书杰 张志荣
作者单位:河南理工大学数学与信息科学学院,河南焦作454003
基金项目:国家自然科学基金资助项目(10671057)
摘    要:序列二次规划(SQP)方法求解中小规模非线性约束下的最优化问题很有效,因此,笔者研究了序列二次规划(SQP)方法及其在非线性规划中的应用.利用强次可行的SQP方法求解问题时可以避免罚函数应用的不便,笔者通过修订搜索方向克服了SQP方法中经常出现的Maratos现象,并且通过调整参数降低了计算量,从而提高了算法的收敛速度.在给定的条件下证明了算法的全局收敛性.

关 键 词:非线性规划  序列二次规划  全局收敛性
文章编号:1673-9787(2007)02-0221-04
收稿时间:2006-01-16

A Successive Quadratic Programming Algorithm with Inequality and Equality Constraint
JING Shu-jie, ZHANG Zhi-rong. A Successive Quadratic Programming Algorithm with Inequality and Equality Constraint[J]. Journal of Jiaozuo Institute of Technology(Natural Science), 2007, 26(2): 221-224
Authors:JING Shu-jie   ZHANG Zhi-rong
Abstract:The successive quadratic programming method is effective in solving small-scale nonlinear programming restrain problem. In this paper, successive quadratic programming method being used in nonlinear programming was discussed. By using a strongly subfeasible SQP algorithm it can obviate the Maratos effect though revise the search direction, and avoid penalty function of inconvenient in the used. Through proper adjustment scalar reducing calculate and improving the convergence speed, the global convergence of this algorithm is proved in certain condition.
Keywords:nonlinear programming   successive quadratic programming   global convergence
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号