The relaxation convergence of multisplitting AOR method for linear complementarity problem

DOI10.1080/03081087.2018.1511680zbMATH Open1461.90151OpenAlexW2890761047MaRDI QIDQ4965573FDOQ4965573

Authors: Lu-Bin Cui, Cuixia 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

Recommendations

• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• The improved convergence of MSMMAOR method for linear complementarity problems
• A note on the convergence of the MSMAOR method for linear complementarity problems.
• Convergence analysis of the parallel multisplitting chaotic GAOR method for the linear complementarity problem
• Modified AOR methods for linear complementarity problem

zbMATH Keywords

convergencelinear complementarity problemAOR methodmultisplitting method

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
• Modulus-based matrix splitting iteration methods for linear complementarity problems.
• Title not available (Why is that?)
• Matrix multisplitting relaxation methods for linear complementarity problems
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• Title not available (Why is that?)
• Convergence of relaxed parallel multisplitting methods
• Two-sweep modulus-based matrix splitting 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.
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• Title not available (Why is that?)
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• On the solution of large, structured linear complementarity problems: the block partitioned case
• Improved convergence theorems of multisplitting methods for the linear complementarity problem
• The convergence of parallel iteration algorithms for linear complementarity problems
• Title not available (Why is that?)

Cited In (6)

• Modified AOR methods for linear complementarity problem
• A note on block preconditioner for generalized saddle point matrices with highly singular \((1,1)\) block
• Nonlinear transform induced tensor nuclear norm for tensor completion
• A parameterized shift-splitting preconditioner for saddle point problems
• Superlinearly convergent methods for solving a class of implicit complementarity problems based on sign analysis
• A note on the convergence of the MSMAOR method for linear complementarity problems.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965573)