Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Wolfgang Hoyer (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: