A truncated newton method in an argumented lagrangian framework for nonlinear programming

In this paper we propose a primal-dual algorithm for the solution of general nonlinear programming problems. The core of the method is a local algorithm which relies on a truncated procedure for the computation of a search direction, thus resulting suitable for large scale problems.The truncated direction produces a sequence of points which locally converges to a KKT pair with super linear convergence rate.