1. C.W. Cryer, “The solution of a quadratic programming problem using systematic overrelaxation,”SIAM Journal on Control 22 (1971) 385–392.
2. U. Eckhardt, “Quadratic programming by successive overrelaxation,” Kernforschungsanlage Jülich, Technical Report No. Jül-1064-MA, 1974.
3. S.-P. Han and G. Lou, “A parallel algorithm for a class of convex programs,” to appear inSIAM Journal on Control and Optimization (Oct., 1986).
4. O.L. Mangasarian, “Solution of symmetric linear complementarity problem by iterative methods,”Journal of Optimization Theory and its Applications 22 (1977) 465–485.
5. J.J. Moré, “The Levenberg-Marquardt algorithm: Implementation and theory,” in: G.A. Watson, ed.,Proceedings of the 1978 Dundee Conference on Numerical Analysis, Lecture Notes in Mathematics 630 (Springer-Verlag, Berlin, 1978) pp. 105–116.