A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS

DOI10.1080/10637199708915590zbMath0880.65041OpenAlexW2011596063MaRDI QIDQ4347261

Deren Wang, David J. Evans, Zhong Zhi Bai

Publication date: 22 January 1998

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199708915590

zbMATH Keywords

linear complementarity problemparallel computationoverrelaxationmultisplitting method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Parallel numerical computation (65Y05)

Related Items

Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods ⋮ A class of generalized multisplitting relaxation methods for linear complementarity problems ⋮ Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems ⋮ The PMCGAOR and PMCSSOR methods for solving linear complementarity problems

Cites Work

• Unnamed Item
• Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
• Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
• Solution of nonsymmetric, linear complementarity problems by iterative methods
• Solution of symmetric linear complementarity problems by iterative methods
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Matrix multi-splitting multi-parameter relaxation methods