A shifted-barrier primal–dual algorithm model for linearly constrained optimization problems

In this paper we describe a Newton-type algorithm model for solving smooth constrained optimization problems with nonlinear objective function, general linear constraints and bounded variables. The algorithm model is based on the definition of a continuously differentiable exact merit function that follows an exact penalty approach for the box constraints and an exact augmented Lagrangian approach for the general linear constraints. Under very mild assumptions and without requiring the strict complementarity assumption, the algorithm model produces a sequence of pairs {x^k, λ^k} converging quadratically to a pair (&xmacr;, &lambdamn;) where &xmacr; satisfies the first order necessary conditions and &lambdamn; is a KKT multipliers vector associated with the linear constraints. As regards the behaviour of the sequence {x^k} alone, it is guaranteed that it converges at least superlinearly. At each iteration, the algorithm requires only the solution of a linear system that can be performed by means of conjugate gradient methods. Numerical experiments and comparison are reported.