| [1] Berman A, Plemmons R. Nonnegative Matrix in the Mathematical Sciences[M]. Academic Press, New York, 1979.[2] Cottle R, Pang J. Stone R.E. The Linear Complementarity Problem[M]. Academic Press, San Diego, 1992.[3] Murty K. Linear Complementarity, Linear and Nonlinear Programming[M]. Haldermann Verlag, Berlin, 1988.[4] Cryer W. The solution of a quadratic programming problem using systematic overrelaxation[J]. SIAM J. Control., 1971, 9:385-392.[5] Mangasarian O. Solution of symmetric linear complementarity problems by iterative methods[J]. J. Optim. Theory Appl., 1977, 22:465-485.[6] Ahn B. Solution of nonsymmetric linear complementarity problems by iterative methods[J]. J. Optim. Theory Appl., 1981, 33:185-197.[7] Pang J. Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem[J]. J. Optim. Theory Appl., 1984, 42:1-17.[8] Bai Z Z. On the convergence of the multisplitting methods for the linear complementarity problem[J]. SIAM J. Matrix Anal. Appl., 1999, 21:67-78.[9] Bai Z Z, Evans D J. Matrix multisplitting relaxation methods for linear complementarity problems[J]. Int. J. Comput. Math., 1997, 63:309-326.[10] Dehghan M, Hajarian M. Convergence of SSOR Methods for linear complementarity problems[J]. Oper. Res. lett., 2009, 37:219-223.[11] W.M.G. Bokhoven v. A Class of Linear Complementarity Problems is Solvable in Polynomial Time. Unpublished paper, Dept.of Electrical Engineering, University of Technology, The Netherlands, 1980.[12] Kappel N W, Watson L T. Iterative algorithms for the linear complementarity problem[J]. Int. J. Comput. Math., 1986, 19:273-296.[13] Bai Z Z. Modulus-based matrix splitting iteration methods for linear complementarity problems[J]. Numer. Linear Algebra Appl., 2010, 6:917-933.[14] Dong J L, Jiang M Q. A modified modulus method for symmetric positive-definite linear complementarity problems[J]. Numer. Linear Algebra Appl., 2009, 16:129-143.[15] Hadjidimos A, Tzoumas M. Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem[J]. Linear Algebra Appl., 2009, 431:197-210.[16] Hadjidimos A, Lapidakis M, Tzoumas M. On iterative solution for linear complementarity problem with an H+-matrix[J]. SIAM J. Matrix Anal. Appl., 2011, 33:97-110.[17] Zhang L L. Two-step modulus based matrix splitting iteration for linear complementarity problems[J]. Numer. Algor., 2011, 57:83-99.[18] Zheng N, Yin J F. Accelerated modulus-based matrix splitting iteration methods for linear complementarity problems[J]. Numer. Algor., 2013, 64:245-262.[19] Zheng N. Yin, J.-F. Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an H+-matrix[J]. J. Comput. Appl. Math., 2014, 260:281-293.[20] Bai, Z Z, Zhang, L L. Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems[J]. Numer. Algor., 2013, 62:59-77.[21] Hadjidimos A, Noutsos D, Tzoumas M. More on modifications and improvements of classical iterative schemes for M-matrices[J]. Linear Algebra Appl., 2003, 364:253-279.[22] Li W, Sun W. Modified Gauss-Seidel type methods and Jacobi type methods for Z-matrices[J]. Linear Algebra Appl., 2000, 317:227-240.[23] Li W. The convergence of the modified Gauss-Seidel methods for consistent linear systems[J]. J. Comput. Appl. Math., 2003, 154:97-105.[24] Li W. A note on the preconditioned Gauss-Seidel (GS) method for linear systems[J]. J. Comput. Appl. Math., 2005, 182:81-90.[25] Wang L., Song Y. Preconditioned AOR iterative method for M-matrices[J]. J. Comput. Appl. Math., 2009, 226:114-124.[26] Liu C.Y., Li C.L. A new preconditioned Generalised AOR methods for the linear complementarity problem based on a generalised Hadjidimos preconditioner[J]. East Asian J. Appl. Math., 2012, 2:94-107.[27] Dai P F, Li J C, Li Y T, Bai J. A general preconditioner for linear complementarity problem with an M-matrix[J]. J. Comput. Appl. Math., 2017, 317:100-112.[28] Varga R S. Matrix Iterative Analysis[M]. Prentice-Hall. Englewood Cliffs, NJ, 1962.[29] Frommer A, Mayer G. Convergence of relaxed parallel multisplitting methods[J]. Linear Algebra Appl., 1989, 119:141-152.[30] Neumann M, Plemmons R J. Convergence of parallel multisplitting iterative methods for Mmatrices[J]. Linear Algebra Appl., 1987, 88:559-573.[31] Axelsson O. Iterative Solution methods. Cambridge University Press[M]. Cambridge, 1996.[32] Seydel Rüdiger U. Tools for Computational Finance[M]. 4ed., Springer, 2009.[33] Wilmott P, Dewynne J, Howison S. Option Pricing:Mathematical Models and Computation[M]. Oxford Financial Press, Oxford, UK, 1993.[34] Ahn B H. Iterative methods for linear complementarity problems with upper-bounds on primary variables[J]. Math. Program., 1983, 26:295-315. |
