1. Biggs, M. C. (1975) “Constrained minimization using recursive quadratic programming: some alternative subproblem formulations” in Towards global optimization, eds. L.C.W. Dixon and G.P. Szego, North-Holland Publishing Co. (Amsterdam).
2. Fletcher, R. (1970). “The Calculation of Feasible Points for Linearly Constrained Optimization Problems”, UKAFA Research Group Report, AERE R 6354 (Harwell).
3. Fletcher, R. (1970). “A FORTRAN Subroutine for Quadratic Programming”. UKAEA Research Group Report. AERE R 6370 (Harwell).
4. Fletcher, R. (1971). “A general quadratic programming algorithm” Journal Inst. Math. Applics, Vol. 7, pp. 76–91.
5. Goldfarb, D. (1972). “Extension of Newton's method and simplex methods for solving quadratic program”, in Numerical Methods for Nonlinear Optimization, ed. F. Lootsma, Academic Press (London), pp. 239–254.