Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem

DOI10.1007/BF01589410zbMath0665.90090MaRDI QIDQ1116899

Renato De Leone, Olvi L. Mangasarian

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

convergence analysisparallel algorithmsline searchstrictly diagonally dominant matrixComputational testssymmetric linear complementarityasynchronous parallel successive overrelaxation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (11)

Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods ⋮ A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem ⋮ A class of parallel nonlinear multisplitting relaxation methods for the large sparse nonlinear complementarity problems ⋮ Multisplitting iteration schemes for solving a class of nonlinear complementarity problems ⋮ Matrix multisplitting relaxation methods for linear complementarity problems ⋮ A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS ⋮ A note on the implementation of the successive overrelaxation method for linear complementarity problems ⋮ A matrix-splitting method for symmetric affine second-order cone complementarity problems ⋮ Synchronous and asynchronous multisplitting iteration schemes for solving mixed linear complementarity problems with \(H\)-matrices ⋮ Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem ⋮ Alternating direction splittings for block angular parallel optimization

Cites Work

• Unnamed Item
• Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
• Sparsity-preserving SOR algorithms for separable quadratic and linear programming
• Solution of nonsymmetric, linear complementarity problems by iterative methods
• On the convergence of a basic iterative method for the implicit complementarity problem
• Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
• Solution of symmetric linear complementarity problems by iterative methods
• Asynchronous Iterative Methods for Multiprocessors

This page was built for publication: Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem