Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
838464 | Nonlinear Analysis: Real World Applications | 2007 | 12 Pages |
Filter approaches, initially proposed by Fletcher and Leyffer in 2002, are recently attached importance to. If the objective function value or the constraint violation is reduced, this step is accepted by a filter, which is the basic idea of the filter. In this paper, the filter approach is employed in a sequential penalty quadratic programming (SlQP) algorithm which is similar to that of Yuan's. In every trial step, the step length is controlled by a trust region radius. In this work, our purpose is not to reduce the objective function and constraint violation. We reduce the degree of constraint violation and some function, and the function is closely related to the objective function. This algorithm requires neither Lagrangian multipliers nor the strong decrease condition. Meanwhile, in our SlQP filter there is no requirement of large penalty parameter. This method produces K-T points for the original problem.