Filter-sequence of quadratic programming method with nonlinear complementarity problem function  

结合非线性互补问题函数的滤子逐次二次规划算法(英文)

作　　者：金中 濮定国 张宇 蔡力 

机构地区：[1]Department of Mathematics,College of Sciences,Shanghai University [2]Department of Mathematics,Tongji University

出　　处：《Journal of Shanghai University(English Edition)》2008年第2期97-101,共5页上海大学学报（英文版）

基　　金：Project supported by the National Natural Science Foundation of China (Grant Nos.10571137,10771162)

摘　　要：A mechanism for proving global convergence in filter-SQP （sequence of quadratic programming） method with the nonlinear complementarity problem （NCP） function is described for constrained nonlinear optimization problem.We introduce an NCP function into the filter and construct a new SQP-filter algorithm.Such methods are characterized by their use of the dominance concept of multi-objective optimization,instead of a penalty parameter whose adjustment can be problematic.We prove that the algorithm has global convergence and superlinear convergence rates under some mild conditions.为在 filter-SQP (二次的编程的顺序) 证明集中全球的机制功能为抑制非线性的优化问题被描述的有非线性的补充问题(NCP ) 的方法。我们介绍 NCP 功能进过滤器并且构造一个新 SQP 过滤器算法。如此的方法被他们多客观的优化的优势概念的使用描绘，而不是其调整能有问题的一个惩罚参数。我们证明算法在一些温和条件下面有全球集中和超级线性集中率。

关 键 词：nonlinear complementarity problem （NCP） function FILTER sequence of quadratic programming （SQP） globalconvergence. 

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