A feasible interior-point algorithm for nonconvex nonlinear programming

In this paper, a new method is presented to deal with nonconvex nonlinear inequality constrained problem by using the idea of ε-effective set. It is only required to solve two systems of linear equations per single iteration. The theoretical analysis shows that the algorithm is global convergence under some suitable conditions.