A multisplitting method for symmetric linear complementarity problems
From MaRDI portal
The symmetric linear complementarity problem (LCP) is to find an \(n\)-dimensional vector \(z\) such that \(Mz+ q\geq 0\), \(z\geq 0\), \(z^T(Mz+ q)= 0\) for given \(M\) and \(q\). Most of the known methods have their origin in the solution of a system of linear equations and may be classified into pivoting methods and iterative methods. Effective methods are the so-called splitting methods and the multisplitting methods which are parallel iterative methods for solving a system of linear equations. The last methods are able to be implemented on multiprocessors. In the present paper the idea of multisplitting is extended to the symmetric LCP. Convergence theorems are given. Then the multisplitting method is applied to the parallel successive overrelaxation. The effectiveness of multisplitting is examined by some computational experiments.
Recommendations
- A multiplicative multisplitting method for solving the linear complementarity problem
- Inexact multisplitting methods for linear complementarity problems
- Matrix multisplitting relaxation methods for linear complementarity problems
- A class of generalized multisplitting relaxation methods for linear complementarity problems
- Multisplitting and Schwarz methods for solving linear complementary problems
- Multisplitting iteration schemes for solving a class of nonlinear complementarity problems
- A two-stage multi-splitting parallel method for solving non-symmetric linear complementarity problems
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- Splitting methods for a class of horizontal linear complementarity problems
- scientific article; zbMATH DE number 2217636
Cites work
- Comparisons of weak regular splittings and multisplitting methods
- Convergence of parallel multisplitting iterative methods for M-matrices
- Convergence of relaxed parallel multisplitting methods
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- Multisplitting of a Symmetric Positive Definite Matrix
- Multisplitting with Different Weighting Schemes
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
- On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- On the convergence of iterative methods for symmetric linear complementarity problems
- On the convergence of the parallel multisplitting AOR algorithm
- On the solution of large, structured linear complementarity problems: the block partitioned case
- On the theory and practice of multisplitting methods in parallel computation
- Parallel algorithms and architectures for multisplitting iterative methods
- Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
- Solution of symmetric linear complementarity problems by iterative methods
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
Cited in
(31)- A multisplitting method for symmetrical affine second-order cone complementarity problem
- A class of generalized multisplitting relaxation methods for linear complementarity problems
- Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
- A matrix-splitting method for symmetric affine second-order cone complementarity problems
- A class of modified modulus-based synchronous multisplitting iteration methods for linear complementarity problems
- Two-stage multisplitting iteration methods using modulus-based matrix splitting as inner iteration for linear complementarity problems
- A preconditioned multisplitting and Schwarz method for linear complementarity problem
- The PMCGAOR and PMCSSOR methods for solving linear complementarity problems
- Inexact multisplitting methods for linear complementarity problems
- Improved convergence theorems of multisplitting methods for the linear complementarity problem
- Modulus-based synchronous multisplitting iteration methods for linear complementarity problems.
- A multiplicative Schwarz algorithm for the nonlinear complementarity problem with an M-function
- Weighted max-norm estimate of additive schwarz methods for solving nonlinear complementarity problems
- Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
- The relaxation modulus-based matrix splitting iteration method for solving a class of nonlinear complementarity problems
- A monotone Newton multisplitting method for the nonlinear complementarity problem with a nonlinear source term
- A two-stage multi-splitting parallel method for solving non-symmetric linear complementarity problems
- Modulus-based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem
- A new preconditioned generalised AOR method for the linear complementarity problem based on a generalised hadjidimos preconditioner.
- Multisplitting and Schwarz methods for solving linear complementary problems
- Two-stage multi-splitting parallel algorithm for the linear complementarity problems
- Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
- On convergence of two-stage splitting methods for linear complementarity problems
- Weighted max-norm estimate of additive Schwarz iteration scheme for solving linear complementarity problems
- Modulus-based inexact non-alternating preconditioned splitting method for linear complementarity problems
- IGAOR and multisplitting IGAOR methods for linear complementarity problems
- Relaxed modulus-based synchronous multisplitting multi-parameters TOR (two-parameters over-relaxation) methods for linear complementarity problems
- Improvement of convergence of one- and two-step MSM iteration methods for nondifferentiable nonlinear complementarity problems
- Synchronous and asynchronous multisplitting iteration schemes for solving mixed linear complementarity problems with H-matrices
- A modified damped Newton method for linear complementarity problems
- A multiplicative multisplitting method for solving the linear complementarity problem
This page was built for publication: A multisplitting method for symmetric linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917824)
