1. Chung, S. J., andMurty, K. G.,Polynomially Bounded Ellipsoid Algorithms for Convex Quadratic Programming, Nonlinear Programming 4, Edited by O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, Academic Press, New York, New York, pp. 439–485, 1981.
2. Dantzig, G. B., andCottle, R. W.,Positive Semidefinite Programming, Nonlinear Programming, Edited by J. Abadie, North-Holland Publishing Company, Amsterdam, Holland, pp. 55–73, 1967.
3. Lemke, C. E.,On Complementary Pivot Theory, Mathematics of the Decision Sciences, Part 1, Edited by G. B. Dantzig and A. F. Veinott, American Mathematical Society, Providence, Rhode Island, pp. 95–114, 1968.
4. Shiau, T. H.,Iterative Linear Programming for Linear Complementarity and Related Problems, University of Wisconsin, Madison, Wisconsin, Computer Sciences Department, PhD Thesis, 1983.
5. Ahn, B. H.,Solution of Nonsymmetric Linear Complementarity Problems by Iterative Methods, I, Journal of Optimization Theory and Applications, Vol. 33, pp. 175–185, 1981.