1. R.O. Barr, “An efficient computational procedure for a generalized quadratic programming problem”,SIAM Journal on Control 7 (1969) 415–429.
2. L.C. Barbosa and E. Wong, “On a class of iterative algorithms for linear inequalities with applications to pattern classification”, in:Proceedings of the first annual Princeton conference of information sciences and systems, 1967, pp. 86–89.
3. M.D. Canon and C.D. Cullum, “The determination of optimum separating hyperplanes I. A finite step procedure”, RC 2023, IBM Watson Research Center, Yorktown Heights, New York (February, 1968).
4. G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, N.J. 1963).
5. E.G. Gilbert, “An iterative procedure for computing the minimum of a quadratic form on a convex set”,SIAM Journal on Control 4 (1966) 61–80.