1. M.J. Best, “A feasible conjugate direction method to solve linearly constrained minimization problems”,Journal of Optimization Theory and Applications 16 (1975) 25–38.
2. A.R. Colville, “A comparative study on nonlinear programming codes”, IBM New York Scientific Center, Report 320-2949 (1968).
3. R.W. Cottle and G.B. Dantzig, “The principal pivoting method of quadratic programming”, in: G.B. Dantzig and A.F. Veinott, Jr., eds.,Mathematics of the decision sciences (Am. Math. Soc., Providence, R.I., 1968) pp. 144–162.
4. A.V. Fiacco and G.P. McCormick,Nonlinear programming: SUMT (Wiley, New York, 1968).
5. U.M. Garcia-Palomares, “Superlinearly convergent quasi-Newton methods for nonlinear programming”, Ph.D. dissertation, University of Wisconsin, Madison (1973).