Two-stage parallel iterative methods for the symmetric linear complementarity problem
From MaRDI portal
Publication:1201951
DOI10.1007/BF02186474zbMath0753.90065MaRDI QIDQ1201951
Publication date: 19 January 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Inexact multisplitting methods for linear complementarity problems, Error bounds in mathematical programming, Parallel Newton methods for the nonlinear complementarity problem, An inexact NE/SQP method for solving the nonlinear complementarity problem, Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems
Cites Work
- On the gradient-projection method for solving the nonsymmetric linear complementarity problem
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
- On the convergence of a basic iterative method for the implicit complementarity problem
- Solution of symmetric linear complementarity problems by iterative methods
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- Blocs-H-matrices et convergence des méthodes itératives classiques par blocs
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP
- Inexact Newton Methods
- Inexact Newton methods for the nonlinear complementarity problem
- On Quadratic Programming
