Partially and totally asynchronous algorithms for linear complementarity problems
From MaRDI portal
Publication:2277372
See the preview in Zbl 0702.90085.
Cites work
- Asynchronous Iterative Methods for Multiprocessors
- Chaotic relaxation
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3393631 (Why is no real title available?)
- Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- Parallel Newton methods for the nonlinear complementarity problem
- Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
- Solution of symmetric linear complementarity problems by iterative methods
- Sufficient matrices and the linear complementarity problem
Cited in
(2)
This page was built for publication: Partially and totally asynchronous algorithms for linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277372)