1. R.W. Cottle, F. Giannessi and J.-L. Lions, eds.,Variational Inequalities and Complementarity Problems (Wiley, Chichester, 1980).
2. D. Goldfarb and S. Liu, “An O(n 3 L) primal interior point algorithm for convex quadratic programming,” preprint.
3. A. King, “An implementation of the Lagrangian finite generation method,” in: Y. Ermoliev and R.J.-B. Wets, eds.,Numerical Techniques for Stochastic Programming Problems (Springer, Berlin, 1988).
4. K.C. Kiwiel, Methods of Descent for Nondifferentiable Optimization,Lecture Notes in Mathematics, Vol. 1133 (Springer, Berlin, 1985).
5. Y.Y. Lin and J.-S. Pang, “Iterative methods for large convex quadratic programs: a survey,”SIAM Journal on Control and Optimization 25 (1987) 383–411.