Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
DOI10.1016/j.laa.2009.02.024zbMath1168.65027OpenAlexW1979551665MaRDI QIDQ1019647
Apostolos Hadjidimos, Michael Tzoumas
Publication date: 4 June 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.02.024
convergencenumerical exampleslinear complementarity problemextrapolation\(P\)-matricesnonlinear conjugate gradient methoditerative schemes(Block) modulus algorithmreal symmetric positive definite matrices
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the modulus algorithm for the linear complementarity problem.
- A new iterative criterion for \(H\)-matrices: The reducible case
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Solution of symmetric linear complementarity problems by iterative methods
- Modified AOR methods for linear complementarity problem
- How to improve MAOR method convergence area for linear complementarity problems
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- Improving projected successive overrelaxation method for linear complementarity problems
- Complementary pivot theory of mathematical programming
- Iterative algorithms for the linear complementarity problem
- On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem
- Matrix multisplitting relaxation methods for linear complementarity problems
- A Linear Complementarity Problem with a P-Matrix
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- On the Cayley transform of positivity classes of matrices
- Bimatrix Equilibrium Points and Mathematical Programming
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- A Partition Theorem for Euclidean n-Space
This page was built for publication: Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem