×

Matrix multisplitting relaxation methods for linear complementarity problems. (English) Zbl 0876.90086

Summary: A class of synchronous as well as asynchronous matrix multisplitting methods for solving the linear complementarity problem is set up, and its convergence is proved when the coefficient matrix is an \(H\)-matrix with positive diagonal elements.

MSC:

90C33 Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C20 Quadratic programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DOI: 10.1007/BF00935545 · Zbl 0422.90079
[2] Bai Z. Z., J. UEST China 23 pp 428– (1994)
[3] Bai Z. Z., J. UEST China 22 pp 420– (1993)
[4] Berman A., Nonnegative Matrices in the Mathematical Sciences (1979) · Zbl 0484.15016
[5] DOI: 10.1016/0024-3795(89)90074-8 · Zbl 0676.65022
[6] DOI: 10.1007/BF01589410 · Zbl 0665.90090
[7] DOI: 10.1007/BF01268170 · Zbl 0341.65049
[8] DOI: 10.1016/0305-0548(69)90004-5 · Zbl 0606.90102
[9] DOI: 10.1007/BF00940194 · Zbl 0595.90090
[10] DOI: 10.1137/0606062 · Zbl 0582.65018
[11] DOI: 10.1007/BF00934765 · Zbl 0482.90084
[12] DOI: 10.1007/BF01581264 · Zbl 0784.90089
[13] Varga R. S., Matrix Iterative Analysis (1962) · Zbl 0133.08602
[14] DOI: 10.1016/0024-3795(91)90390-I · Zbl 0732.65025
[15] Wang D. R., Parallel Algorithms AppL 2 pp 173– (1994)
[16] Wang D. R., Parallel Algorithms AppL 2 pp 209– (1994)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.