The relaxation convergence of multisplitting AOR method for linear complementarity problem

DOI10.1080/03081087.2018.1511680MaRDI QIDQ4965573zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

AOR methodconvergencelinear complementarity problemmultisplitting method

Mathematics Subject Classification ID

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

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

Cites work

• A modified modulus method for symmetric positive-definite linear complementarity problems.
• Convergence of relaxed parallel multisplitting methods
• scientific article; zbMATH DE number 3747703 (Why is no real title available?)
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 2051935 (Why is no real title available?)
• scientific article; zbMATH DE number 1433445 (Why is no real title available?)
• Improved convergence theorems of multisplitting methods for the linear complementarity problem
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• Matrix multisplitting relaxation methods for linear complementarity problems
• Modulus-based matrix splitting iteration methods for linear complementarity problems.
• Modulus-based synchronous multisplitting iteration methods for linear complementarity problems.
• Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• On the solution of large, structured linear complementarity problems: the block partitioned case
• The convergence of parallel iteration algorithms for linear complementarity problems
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems

Cited in

(6)

• Modified AOR methods for linear complementarity problem
• 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 the convergence of the MSMAOR method for linear complementarity problems.
• A note on block preconditioner for generalized saddle point matrices with highly singular \((1,1)\) block

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)