Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
type: Item
instance of: scholarly article
title: Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
zbMATH Open document ID: 0665.90090
DOI: 10.1007/BF01589410
published in: Mathematical Programming. Series A. Series B
publication date: 1988-01-01T00:00:00Z
review text: Convergence is established for asynchronous parallel successive overrelaxation (SOR) algorithms for the symmetric linear complementarity problem. For the case of a strictly diagonally dominant matrix convergence is achieved for a relaxation factor interval of (0,2] with line search, and (0,1] without line search. Computational tests on the Sequent Symmetry S81 multiprocessor give speedup efficiency in the 43 \%- 91 \% range for the cases for which convergence is established. The tests also show superiority of the asynchronous SOR algorithms over their synchronous counterparts.
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4089347
zbMATH Keywords: convergence analysis
zbMATH Keywords: parallel algorithms
zbMATH Keywords: asynchronous parallel successive overrelaxation
zbMATH Keywords: symmetric linear complementarity
zbMATH Keywords: strictly diagonally dominant matrix
zbMATH Keywords: line search
zbMATH Keywords: Computational tests
author: Renato De Leone
author: O. L. Mangasarian
MaRDI profile type: Publication
cites work: Solution of nonsymmetric, linear complementarity problems by iterative methods
cites work: Asynchronous Iterative Methods for Multiprocessors
cites work: Q3793938
cites work: Solution of symmetric linear complementarity problems by iterative methods
cites work: Sparsity-preserving SOR algorithms for separable quadratic and linear programming
cites work: Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
cites work: Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
cites work: On the convergence of a basic iterative method for the implicit complementarity problem
description: scientific article; zbMATH DE number 4089347