The relaxation convergence of multisplitting AOR method for linear complementarity problem

DOI10.1080/03081087.2018.1511680zbMath1461.90151OpenAlexW2890761047MaRDI QIDQ4965573

Lu-Bin Cui, Cui-Xia Li, Shi-Liang Wu

Publication date: 6 March 2021

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2018.1511680

zbMATH Keywords

convergencelinear complementarity problemAOR methodmultisplitting method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Iterative numerical methods for linear systems (65F10) General methods in interval analysis (65G40)

Related Items (4)

A parameterized shift-splitting preconditioner for saddle point problems ⋮ Nonlinear transform induced tensor nuclear norm for tensor completion ⋮ Superlinearly convergent methods for solving a class of implicit complementarity problems based on sign analysis ⋮ A NOTE ON BLOCK PRECONDITIONER FOR GENERALIZED SADDLE POINT MATRICES WITH HIGHLY SINGULAR (1, 1) BLOCK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems
• Improved convergence theorems of multisplitting methods for the linear complementarity problem
• Convergence of relaxed parallel multisplitting methods
• On the solution of large, structured linear complementarity problems: the block partitioned case
• The convergence of parallel iteration algorithms for linear complementarity problems
• Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
• 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
• Matrix multisplitting relaxation methods for linear 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
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation

This page was built for publication: The relaxation convergence of multisplitting AOR method for linear complementarity problem