1. D.P. Bertsekas and D. Elbaz, “Distributed asynchronous relaxation methods for convex network flow problems,”SIAM Journal on Control and Optimization 25 (1987) 74–85.
2. D.P. Bertsekas, P.A. Hosein and P. Tseng, “Relaxation methods for network flow problems with convex arc costs,” LIDS Report P-1523, Mass. Institute of Technology, December 1985,SIAM Journal on Control and Optimization, to appear.
3. D.P. Bertsekas and P. Tseng, “Relaxation Methods for Linear Programs,” LIDS Report P-1553, Mass. Institute of Technology, April 1986, to appear inMathematics of Operations Research.
4. R.W. Cottle and J.S. Pang, “On the convergence of a block successive over-relaxation method for a class of linear complementary problems,”Mathematical Programming Study 17 (1982) 126–138.
5. G.H. Golub and C.F. Van Loan,Matrix Computations (Johns Hopkins Univ. Press, Baltimore, MD, 1985).