1. On minimizing a convex function subject to linear inequalities;Beale, E. M. L.;J. Roy. Statist. Soc. Ser. B,1955
2. A. Charnes and C. E. Lemke, The continuous limit method I; minimization of convex functionals over convex polyhedra; presented at Am. Math. Soc. Meeting, Cambridge, Mass., Aug. 1958
3. An algorithm for quadratic programming;Frank, Marguerite;Naval Res. Logist. Quart.,1956
4. A quadratic programming procedure;Hildreth, Clifford;Naval Res. Logist. Quart.,1957
5. Philip Wolfe, The simplex method for quadratic programming, RAND Rep. P-1205, Oct. 1957