在求解非线性规划问题的方法中,序列二次规划型方法是最有效的求解方法之一.而最近又出现了一类新的称为滤子的方法,因为该方法有着良好的数值结果,近年来已经广泛应用于非线性规划问题的求解中.在这篇文章中,提出了一类组合了该滤子技巧和上述SQP信赖域技巧的方法来解决非线性规划问题.该方法保证了每个试探点都不会远离可行域.同时在合适的条件下建立了算法的收敛性,并在最后给出了一些数值算例.
Sequential quadratic programming(SQP) type method is one of the most effective methods for solving nonlinear programming.Recently,filter method,for its good numerical results,are extensively studied to handle nonlinear programming problems. In this paper,a new modified approach combined the filter technique and SQP trust region method is proposed to tackle the original problem,which ensures that every trail point will not be far away from the feasible region.Global convergence results of the proposed algorithm are established under suitable conditions.Some numerical results are reported in this paper.