An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization

摘要

A feasible interior point type algorithm is proposed for the inequality constrained optimization. Iterate points are prevented from leaving to interior of the feasible set. It is observed that the algorithm is merely necessary to solve three systems of linear equations with the same coefficient matrix. Under some suitable conditions, superlinear convergence rate is obtained. Some numerical results are also reported.