SQP feasible algorithm on solving the nonlinear programming

The nonlinear programming problem is a hotspot problem that people care about all the time.Zhu and Zhang make use of the nonlinear programming with inequality constraint to construct a new sequence quadratic programming method.We need only solving one quadratic sub-problem at each iteration and modify the feasible direction automatically in order to avoid the Marotos effect.The method could retain the global convergence under the weak condition.We extend the work of Zhu and Zhang to the nonlinear programming with equality and inequality constraint and obtain a better sequence quadratic programming method.