A Successive Quadratic Programming Based Feasible Directions Algorithm

The two-stage Feasible Directions Algorithm for Nonlinearly Constrained Optimization determines a search direction in two stages.First a descent direction is defined; by modifying it, a feasible descent direction is then obtained. We apply this idea in order to state a new feasible directions algorithm based on a well known method for Nonlinear Programming studied by WILSON, HAN and POWELL.