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

DOI10.1080/10637199708915590zbMath0880.65041MaRDI 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 problem; parallel computation; overrelaxation; multisplitting method

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

65Y05: Parallel numerical computation

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

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