Generalized AOR methods for linear complementarity problem
DOI10.1016/j.amc.2006.09.067zbMath1121.65068OpenAlexW2087239106MaRDI QIDQ2371393
Publication date: 4 July 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.09.067
numerical resultslinear complementarity problemmonotone convergenceGAOR methodGSOR methodgeneralized accelerated overrelaxation methodsgeneralized successive overrelaxation methodsirreducible diagonally dominant matrix
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Iterative numerical methods for linear systems (65F10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On convergence of two-stage splitting methods for linear complementarity problems
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Solution of symmetric linear complementarity problems by iterative methods
- Chaotic iterative methods for the linear complementarity problems
- On the convergence of the generalized AOR method
- Modified AOR methods for linear complementarity problem
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- Konvergenzkriterien für das Verallgemeinerte AOR-Verfahren
- On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem
- Matrix multisplitting relaxation methods for linear complementarity problems
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- A Simple Approach to the Perron-Frobenius Theory for Positive Operators on General Partially-Ordered Finite-Dimensional Linear Spaces
- Convergence of Matrix Iterations Subject to Diagonal Dominance