The improved convergence of MSMMAOR method for linear complementarity problems
From MaRDI portal
Publication:4965570
DOI10.1080/03081087.2017.1383347zbMath1461.90153OpenAlexW2763850701MaRDI QIDQ4965570
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.2017.1383347
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)
Cites Work
- Convergence of relaxed parallel multisplitting methods
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Solution of symmetric linear complementarity problems by iterative methods
- The convergence of parallel iteration algorithms for linear complementarity problems
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- On linear convergence of iterative methods for the variational inequality problem
- Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
- The weaker convergence of modulus-based synchronous multisplitting multi-parameters 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
- A note on the convergence of the MSMAOR method for linear complementarity problems
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- A wider convergence area for the MSTMAOR iteration methods for LCP
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item