Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem
DOI10.1007/BF02023047zbMATH Open0816.90124OpenAlexW1986882926MaRDI QIDQ1813445FDOQ1813445
Authors: Renato De Leone, O. L. Mangasarian, Tzong-Huei Shiau 
Publication date: 25 June 1992
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02023047
Recommendations
convergence analysismulti-sweep asynchronous parallel successive overrelaxationnonsymmetric linear complementarity
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Complementary pivot theory of mathematical programming
- Title not available (Why is that?)
- Solution of symmetric linear complementarity problems by iterative methods
- Asynchronous Iterative Methods for Multiprocessors
- Chaotic relaxation
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
Cited In (7)
- Title not available (Why is that?)
- Parallel computation of intertemporal multicommodity spatial price equilibria in the presence of quotas
- On the equivalence between some projected and modulus-based splitting methods for linear complementarity problems
- Title not available (Why is that?)
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
- A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem
- Partially and totally asynchronous algorithms for linear complementarity problems
This page was built for publication: Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813445)
