A smoothing QP-free infeasible method for nonlinear inequality constrained optimization

In this paper, a smoothing QP-free infeasible method is proposed for nonlinear inequality constrained optimization problems. This iterative method is based on the solution of nonlinear equations which is obtained by the multipliers and the smoothing Fisher-Burmeister function for the KKT first-order optimality conditions. Comparing with other QP-free methods,this method does not request the strict feasibility of iteration. In particular, this method is implementable and globally convergent without assuming the strict complementarity condition and the isolatedness of accumulation points. Furthermore, the gradients of active constraints are not requested to be linearly independent. Preliminary numerical results indicate that this smoothing QP-free infeasible method is quite promising.