1. S.-J. Chung and K.G. Murty, “Polynomially bounded ellipsoid algorithms for convex quadratic programming,” In Nonlinear Programming O.L. Mangasarian, R.R. Meyer, and S.M. Robinson (Eds.), Academic Press, New York, 1981, vol. 4, pp. 439–485.
2. R.W. Cottle and G. Dantzig, “Complementary pivot theory of mathematical programming,” Linear Algebra and its Applications, vol. 1, pp. 103–125, 1968.
3. R.W. Cottle, J.-S. Pang, and R.E. Stone, The Linear Complementarity Problem, Academic Press, New York, 1992.
4. CPLEX Optimization Inc., Incline Village, Nevada. Using the CPLEX(TM) Linear Optimizer and CPLEX(TM) Mixed Integer Optimizer (Version 2.0), 1992.
5. O.L. Mangasarian, Nonlinear Programming, Reprint: SIAM Classic in Applied Mathematics 10, 1994, Philadelphia, McGraw–Hill, New York, 1969.