滤子QP-free算法  

Filter QP-free Method

作　　者：李康弟[1] 濮定国[1] 

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

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

基　　金：国家自然科学基金资助项目(10571137);上海市教委自然科学基金资助项目(05LZ05)

摘　　要：提出了求解光滑不等式约束最优化问题的滤子QP-free非可行域方法.通过乘子函数和F-B非线性互补函数,构造一个等价于原约束问题一阶KKT条件的非光滑方程组.在此基础上,通过牛顿、拟牛顿迭代得到KKT最优条件的解,在迭代的线搜索中,采用了滤子方法.证明了该方法是可以实现的并具有全局收敛性.另外,在较弱条件下可以证明该方法具有超线性收敛性.This paper presents a filter QP-free infeasible method for minimizing a smooth function subjected to smooth inequality constraints. This iterative method is based on the solution of nonsmooth equations obtained by the multiplier and some nonlinear complementarity problem（ NCP） functions for the KKT first-order optimality conditions. Locally, each iteration of this method can be viewed as a perturbation of a Newton or quasi-Newton iteration on both the primal and dual variables for the solution of the KKT optimality conditions. The filter is also adopted in the linear searches. This method is implementable and globally convergent. The method proves to be of super linear convergence rate under some mild conditions.

关 键 词：约束最优化 滤子 QP-free法 收敛性 NCP函数 

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