A multisplitting method for symmetric linear complementarity problems

DOI10.1016/0377-0427(94)00103-2zbMath0853.65068OpenAlexW1971440565MaRDI QIDQ1917824

Naoki Machida, Toshihide Ibaraki, Masao Fukushima

Publication date: 5 January 1997

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(94)00103-2

zbMATH Keywords

convergencenumerical examplesiterative methodssplitting methodsmultisplitting methodsparallel successive overrelaxationsymmetric linear complementarity problempivoting methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items

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, Improved convergence theorems of multisplitting methods for the linear complementarity problem, Inexact multisplitting methods for linear complementarity problems, A modified damped Newton method for linear complementarity problems, Modulus-based synchronous multisplitting iteration methods for linear complementarity problems, Modulus-based inexact non-alternating preconditioned splitting method for linear complementarity problems, A class of modified modulus-based synchronous multisplitting iteration methods for linear complementarity problems, IGAOR and multisplitting IGAOR methods for linear complementarity problems, Modulus-based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem, Parallel multisplitting iteration methods based on M-splitting for the PageRank problem, A New Preconditioned Generalised AOR Method for the Linear Complementarity Problem Based on a Generalised Hadjidimos Preconditioner, Weighted max-norm estimate of additive schwarz methods for solving nonlinear complementarity problems, Two-stage multisplitting iteration methods using modulus-based matrix splitting as inner iteration for linear complementarity problems, A matrix-splitting method for symmetric affine second-order cone complementarity problems, Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems, Weighted max-norm estimate of additive Schwarz iteration scheme for solving linear complementarity problems, On convergence of two-stage splitting methods for linear complementarity problems, A multiplicative multisplitting method for solving the linear complementarity problem, Synchronous and asynchronous multisplitting iteration schemes for solving mixed linear complementarity problems with \(H\)-matrices, A MULTIPLICATIVE SCHWARZ ALGORITHM FOR THE NONLINEAR COMPLEMENTARITY PROBLEM WITH ANM-FUNCTION, A multisplitting method for symmetrical affine second-order cone complementarity problem, A monotone Newton multisplitting method for the nonlinear complementarity problem with a nonlinear source term, A preconditioned multisplitting and Schwarz method for linear complementarity problem, The PMCGAOR and PMCSSOR methods for solving linear complementarity problems

Cites Work

• Unnamed Item
• Convergence of parallel multisplitting iterative methods for M-matrices
• On the convergence of the parallel multisplitting AOR algorithm
• Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
• Comparisons of weak regular splittings and multisplitting methods
• Convergence of relaxed parallel multisplitting methods
• On the theory and practice of multisplitting methods in parallel computation
• Solution of symmetric linear complementarity problems by iterative methods
• On the solution of large, structured linear complementarity problems: the block partitioned case
• Parallel algorithms and architectures for multisplitting iterative methods
• Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
• On the convergence of iterative methods for symmetric linear complementarity problems
• On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
• Multisplitting of a Symmetric Positive Definite Matrix
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
• Multisplitting with Different Weighting Schemes
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation