Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem

DOI10.1007/BF02023047zbMath0816.90124OpenAlexW1986882926MaRDI QIDQ1813445

Renato De Leone, Tzong-Huei Shiau, Olvi L. Mangasarian

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

zbMATH Keywords

convergence analysismulti-sweep asynchronous parallel successive overrelaxationnonsymmetric linear complementarity

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem ⋮ On the equivalence between some projected and modulus-based splitting methods for linear complementarity problems ⋮ Partially and totally asynchronous algorithms for linear complementarity problems ⋮ Parallel computation of intertemporal multicommodity spatial price equilibria in the presence of quotas

Cites Work

• Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
• Solution of symmetric linear complementarity problems by iterative methods
• Complementary pivot theory of mathematical programming
• Chaotic relaxation
• Asynchronous Iterative Methods for Multiprocessors
• Unnamed Item

This page was built for publication: Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem