The goal of this paper is to discuss the following nonlinear programming problem (P): \(\min f(x)\) subject to \(g_j(x)\leq0\), \(j=1,2,\dots,m\). The authors present a one-step feasible algorithm for the unconstrained and constrained case and prove global convergence and local superlinear convergence under some mild conditions.