1. S. Agmon, “The relaxation method for linear inequalities”, Canadian Journal on mathematics 6 (1954) 382–392.
2. C.M. Bregman, “The method of successive projection for finding a common point of convex sets”, Soviet Mathematics Doklady 6 (1965) 688–692.
3. R. Chandrasekaran, “A special case of the complementarity pivot problem”, Opsearch 7 (1970) 263–268.
4. R.W. Cottle, “The principal pivoting method of quadratic programming”, in: G.B. Dantzig A.F. Veinott, Jr., eds., Mathematics of the desision sciences, Part I (Am. Math. Soc., Providence, RI, 1968) pp. 148–162.
5. R.W. Cottle, “Manifestations of the Schur complement”, Linear Algebra and its Applications 8 (1974) 189–211.