1. R.H. Bartels, G.H. Golub, and M.A. Saunders, “Numerical techniques in mathematical programming”. in: J.B. Rosen, O.I. Mangasarian and K. Ritter, eds.,Nonlinear programming (Academic Press, New York, 1970) pp. 123–176.
2. E.M.L. Beale, “On minimizing a convex function subject to linear inequalities,”Journal of the Royal Statistical Society Series B 17 (1955) 173–184.
3. E.M.L. Beale, “On quadratic programming,”Naval Research Logistics Quarterly 6 (1959) 227–243.
4. M.G. Biggs, “Constrained minimization using recursive quadratic programming: some alternative subproblem formulations,” in: L.C.W. Dixon and G.P. Szego, eds.,Towards global optimization (North-Holland, Amsterdam, 1975) pp. 341–349.
5. Computing Science Technical Report;J.W. Bunch,1977