解不等式约束问题的不可行SSLE滤子算法  

An Infeasible SSLE Filter Algorithm for Inequality Constrained Optimization

作　　者：沈春根[1,2] 李晓彬[2] 

机构地区：[1]同济大学数学系,上海200092 [2]上海金融学院应用数学系,上海201209

出　　处：《同济大学学报（自然科学版）》2009年第9期1256-1261,共6页Journal of Tongji University:Natural Science

基　　金：国家自然科学基金资助项目(10771162);上海市教育委员会科研创新资助项目(09YZ408)

摘　　要：考虑将原不等式约束优化问题转化为与其等价的带等式约束的优化问题,并证明它们具有相同的KKT条件.转化后的问题要求其乘子是非负的,故其KKT条件与一般的等式约束优化问题不同.针对这种具有特定的等式约束优化问题,提出了一种求解不等式约束优化问题的不可行序列线性规划滤子方法.该算法只需求解两个具有相同系数矩阵的线性方程组以得到搜索方向,因此计算量较小.最后给出了该算法的全局收敛性证明和数值结果.The inequality constrained optimization problem is reformulated as its equivalent equality constrained optimization problem. It is proved that they have the same Karush-Kuhn-Tucker（KKT） conditions under some suitable conditions. The multiplier of the equivalent equality constrained optimization problem needs to be nonnegative. Therefore, its KKT conditions are different from those of the general equality constrained optimization problem. An infeasible sequential system of linear equations（SSLE） filter algorithm is presented to solve this type of problem. It only needs to solve two systems of linear equations with the same nonsingular coefficient matrix, which results in a less computation. The global convergence of the algorithm is established under suitable conditions. Some numerical results are also reported.

关 键 词：序列线性方程组 滤子 线搜索 非线性约束优化 

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