Mathematica Eterna
Open Access

Abstract

Global Convergence Of A Qp-free Method Without A Penalty Function And A Filter

Ke Su and Bei Gao

In this paper, a QP-free method without a penalty function and a filter is proposed for nonliner programming. The decrease condition of the constraint violation and the object function is require to satisfied in each step. The methods decrease condition compare with the acceptance criterion of filter may achieve more flexibility of accepting trial steps. Based on the solution of nonsmooth equations and decrease condition which the constraint violation and the objective function must satisfied the globally convergence is achieved.