A kind of QP-free feasible method

This paper is concerned with a kind of QP-free feasible algorithm which solves an inequality constrained nonlinear optimization problem. Under some weaker conditions than those in [H. Qi, L. Qi, A New QP-free, globally convergent, locally superlinear convergent algorithm for inequality constrained optimization, SIAM J. Optim. 11 (2000) 113–132], we prove that the algorithm is implementable and globally convergent. Moreover, some numerical test results are given to indicate that the algorithm is quite promising.