Solving linearly constrained nonlinear programming problems by Newton's method

In this paper matrix techniques are developed to implement a modified Newton method to a linearly constrained nonlinear optimisation problem with a twice differentiable and factorable objective function. The problem first is reduced to an unconstrained problem, then the generalised inverse of the positive part of the Hessian matrix is used to generate the direction of search.