The weaker convergence of modulus-based synchronous multisplitting multi-parameters methods for linear complementarity problems

DOI10.1016/j.camwa.2014.04.018zbMath1367.65101OpenAlexW2050067781MaRDI QIDQ2364230

Li-Tao Zhang, Jian-Lei Li

Publication date: 18 July 2017

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2014.04.018

zbMATH Keywords

linear complementaritymodulus-based methodsuccessive relaxation\(H_+\)-matrix

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for variational inequalities and related problems (65K15)

Related Items (12)

Accelerated modulus-based matrix splitting iteration methods for a restricted class of nonlinear complementarity problems ⋮ Improved convergence theorems of multisplitting methods for the linear complementarity problem ⋮ Convergence improvement of relaxed multisplitting USAOR methods for \(H\)-matrices linear systems ⋮ Two-Step Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems ⋮ A note on the inner-outer iterative method for solving the linear equation \(Ax = b\) ⋮ Overlapping restricted additive Schwarz method with damping factor for \(H\)-matrix linear complementarity problem ⋮ New convergence of modulus-based synchronous block multisplitting multi-parameter methods for linear complementarity problems ⋮ GLOBAL RELAXED MODULUS-BASED SYNCHRONOUS BLOCK MULTISPLITTING MULTI-PARAMETERS METHODS FOR LINEAR COMPLEMENTARITY PROBLEMS ⋮ The improved convergence of MSMMAOR method for linear complementarity problems ⋮ Improved convergence theorems of the two-step modulus-based matrix splitting and synchronous multisplitting iteration methods for solving linear complementarity problems ⋮ A generalized modulus-based Newton method for solving a class of non-linear complementarity problems with \(P\)-matrices ⋮ Convergence of relaxed matrix parallel multisplitting chaotic methods for \(H\)-matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weaker convergence of non-stationary matrix multisplitting methods for almost linear systems
• Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
• Convergence of relaxed parallel multisplitting methods
• The convergence of parallel iteration algorithms for linear complementarity problems
• Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
• Improved convergence theorems of modulus-based matrix splitting iteration methods for linear complementarity problems
• A general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
• Modulus-based synchronous multisplitting iteration methods for linear complementarity problems
• A modified modulus method for symmetric positive-definite linear complementarity problems
• Modulus-based matrix splitting iteration methods for linear complementarity problems
• On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem
• Matrix multisplitting relaxation methods for linear complementarity problems
• Engineering and Economic Applications of Complementarity Problems
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods

This page was built for publication: The weaker convergence of modulus-based synchronous multisplitting multi-parameters methods for linear complementarity problems