解约束优化问题的QP-free方法及其全局收敛性  

A New Globally and Superlinearly Convergent QP-Free Method for Inequality Constrained Optimization

作　　者：苏珂[1] 

机构地区：[1]同济大学数学系

出　　处：《同济大学学报（自然科学版）》2008年第2期268-272,共5页Journal of Tongji University:Natural Science

基　　金：国家自然科学基金资助项目(10571137,10771162)

摘　　要：对于约束优化问题,基于Fischer-Burmeister NCP函数提出了一类新的QP-free方法.为了避免Maratos效应,引入了一个高阶修正方向.同时,算法采用线搜索以代替弧搜索.与其他传统的SQP方法不同,这个方法只需要在每步迭代中求解不多于三个线性系统的方程组,并且具有总体收敛性.在不需要假设聚点是孤立点的情况下,证明了序列的每个聚点都是优化问题的KKT点.Based on a non-smooth equation of KKT optimality condition, this paper presents a new QPfree method for inequality constrained optimization by using the Fischer-Burmeister NCP function, which ensures the feasibility of all iterates and makes it unnecessary to search along an arc. To avoid Maratos effect, a high-order modified correction is introduced. Compared with the traditional SQP method, this new method only needs to solve no more than three systems of linear equation per iteration with global convergence and local superlinear convergence under some reachable conditions. Without assuming isolateness of the accumulation point or boundedness of the Lagrangian multiplier approximation sequence, every accumulation point of the iterative sequence generated by this method is a KKT point.

关 键 词：约束优化 KKT点 非线性互补问题 收敛性 

分 类 号：O221.2[理学—运筹学与控制论]