ABSTRACT
This paper provides a method for computing search direction for constrained nonlinear optimization problems. We discuss some important differences in formulation and solution that arise in quadratic programming based methods for nonlinearly constrained optimization with particular emphasis on the treatment of inequality constraints. Some issues including incompatibility or ill-conditioning of the constraints determination of active set and estimation of Lagrange multipliers are discussed.
