A parallel alternating iterative algorithm for linear complementarity problems
From MaRDI portal
computational complexityglobal convergencenumerical experimentslinear complementarity problemparallel computationalternating iterative algorithmmulti-splitting
Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Iterative numerical methods for linear systems (65F10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Recommendations
- Two-stage multi-splitting parallel algorithm for the linear complementarity problems
- Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem
- scientific article; zbMATH DE number 4152173
- The convergence of parallel iteration algorithms for linear complementarity problems
- Two-stage parallel iterative methods for the symmetric linear complementarity problem
Cited in
(8)- scientific article; zbMATH DE number 3353068 (Why is no real title available?)
- Parallel algorithm for solving linear programming problem under conditions of incomplete data
- scientific article; zbMATH DE number 2219158 (Why is no real title available?)
- Two-stage parallel iterative methods for the symmetric linear complementarity problem
- The convergence of parallel iteration algorithms for linear complementarity problems
- Two-stage multi-splitting parallel algorithm for the linear complementarity problems
- A parallel iterative algorithm for differential linear complementarity problems
- A two-step parallel iteration method for large sparse horizontal linear complementarity problems
This page was built for publication: A parallel alternating iterative algorithm for linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2885701)
