Matrix multisplitting relaxation methods for linear complementarity problems
From MaRDI portal
Publication:4340160
DOI10.1080/00207169708804569zbMath0876.90086MaRDI QIDQ4340160
Publication date: 16 June 1997
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169708804569
linear complementarity; relaxation; matrix multisplitting methods; synchronous and asynchronous iterations
90C20: Quadratic programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
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, Chaotic iterative methods for the linear complementarity problems, Modified AOR methods for linear complementarity problem, How to improve MAOR method convergence area for linear complementarity problems, Asynchronous multisplitting relaxation methods for linear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- On the convergence of the parallel multisplitting AOR algorithm
- Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
- Convergence of relaxed parallel multisplitting methods
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- On the convergence of a basic iterative method for the implicit complementarity problem
- Solution of symmetric linear complementarity problems by iterative methods
- Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
