Abstract
Following an elementary substitution approach efficient quadratically convergent algorithms for nonlinear equality constrained optimization problems are derived, which reduce the dimension of the problem and allow to exploit special structures of the constraints. The algorithms obtained are compared with those of the Lagrange-Newton technique.
AMS 1980 Subject Classification: