A computationally efficient feasible sequential quadratic programming algorithm

A sequential quadratic programming (SQP) algorithm generating feasible iter ates is described and analyzed. What distinguishes this algorithm from prev ious feasible SQP algorithms proposed by various authors is a reduction in the amount of computation required to generate a new iterate while the prop osed scheme still enjoys the same global and fast local convergence propert ies. A preliminary implementation has been tested and some promising numeri cal results are reported.