On the convergence of the multisplitting methods for the linear complementarity problem

SIAM Journal on Matrix Analysis and Applications

Volumn 21, Issue 1, 1999, Pages 67-78

  Bai, Zhong Zhi ^a  

^a INSTITUTE OF COMPUTATIONAL MATHEMATICS AND SCIENTIFIC ENGINEERING COMPUTING   (China)

Author keywords

Convergence; Linear complementarity problem; Matrix multisplitting; Relaxed method

Indexed keywords

EID: 0033629867     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479897324032     Document Type: Article

References (21)

1. Z.-Z. BAI AND D.J. EVANS, Matrix multisplitting relaxation methods for linear complementarity problems, Internat. J. Comput. Math., 63 (1997), pp. 309-326.
2. A. BERMAN AND R.J. PLEMMONS, Nonnegative Matrices in the Mathematical Sciences, Academic Press, New York, 1979.
3. R.W. COTTLE AND G.B. DANTZIG, Complementarity pivot theory of mathematical programming, Linear Algebra Appl., 1 (1968). pp. 103-125.
4. R.W. COTTLE, G.H. GOLUB, AND R.S. SACHER, On the solution of large, structured linear complementarity problems: The block partitioned case, Appl. Math. Optim., 4 (1978), pp. 347-363.
5. R.W. COTTLE, J.S. PANG, AND R.E. STONE, The Linear Complementarity Problem, Academic Press, San Diego, 1992.
6. R.W. COTTLE AND R.S. SACHER, On the solution of large, structured linear complementarity problems: The tridiagonal case, Appl. Math. Optim., 4 (1977), pp. 321-340.
7. C.W. CRYER, The solution of a quadratic programming problem using systematic overrelaxation, SIAM J. Control, 9 (1971), pp. 385-392.
8. K. FAN, Topological proofs for certain theorems on matrices with non-negative elements, Monatsh. Math., 62 (1958), pp. 219-237.
9. A. FROMMER AND G. MAYER, Convergence of relaxed parallel multisplitting methods, Linear Algebra Appl., 119 (1989), pp. 141-152.
10. A.N. IUSEM, On the convergence of iterative methods for symmetric linear complementarity problems, Math. Programming, 59 (1993), pp. 33-48.
11. A.N. IUSEM, On the convergence of iterative methods for nonsymmetric linear complementarity problems, Math. Appl. Comput., 10 (1991), pp. 27-41.
12. C.E. LEMKE, Bimatrix equilibrium points and mathematical programming, Management Sci., 11 (1965), pp. 681-689.
13. Z.-Q. LUO AND P. TSENG, On the convergence of a matrix splitting algorithm for the symmetric monotone linear complementarity problem, SIAM J. Control Optim., 29 (1991), pp. 1037-1060.
14. N. MACHIDA, M. FUKUSHIMA, AND T. IBARAKI, A multisplitting method for symmetric linear complementarity problems. J. Comput. Appl. Math., 62 (1995), pp. 217-227.
15. O.L. MANGASARIAN, Solution of symmetric linear complementarity problems by iterative methods, J. Optim. Theory Appl., 22 (1977), pp. 465-485.
16. M. NEUMANN AND R. J. PLEMMONS, Convergence of parallel multisplitting iterative, methods for M-matrices, Linear Algebra Appl., 88/89 (1987), pp. 559-573.
17. D.P. O'LEARY AND R.E. WHITE, Multisplittings of matrices and parallel solution of linear systems, SIAM J. Alg. Discrete Methods, 6 (1985), pp. 630-640.
18. J.M. ORTEGA AND W.C. RHEINBOLDT, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
19. J.S. PANG, Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem, J. Optim. Theory Appl., 42 (1984), pp. 1-17.
20. R.S. VARGA, Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1962.
21. D.R. WANG, On the convergence of the parallel 'multisplitting AOR algorithm, Linear Algebra Appl., 154/156 (1991), pp. 473-486.