On the convergence of SOR- and JOR-type methods for convex linear complementarity problems
From MaRDI portal
Publication:808627
DOI10.1016/0024-3795(91)90396-EzbMath0732.65054MaRDI QIDQ808627
Alvaro Rodolfo de Pierro, Alfredo Noel Iusem
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
iterative methodslinear complementarity problemslinear convergencesuccessive overrelaxationSOR methodJacobi overrelaxation
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (1)
Cites Work
- On the convergence properties of Hildreth's quadratic programming algorithm
- Solution of symmetric linear complementarity problems by iterative methods
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- Projection method for solving a singular system of linear equations and its applications
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the convergence of SOR- and JOR-type methods for convex linear complementarity problems
