A Note on the Sequential Unconstrained Minimization Technique for Non-Linear Programming

This note considers a method due to Carroll for replacing a constrained minimization problem by a sequence of unconstrained problems. Mathematical validity or convergence of this technique is shown under fairly general conditions. No computability is asserted beyond that obtained by other authors under more restrictive assumptions.