On the convergence of SOR- and JOR-type methods for convex linear complementarity problems
DOI10.1016/0024-3795(91)90396-EzbMATH Open0732.65054MaRDI QIDQ808627FDOQ808627
Authors: Álvaro Rodolfo De Pierro, Alfredo Iusem 
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
- Convergence of SSOR methods for linear complementarity problems
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- Convergence Properties of Iterative Methods for Symmetric Positive Semidefinite Linear Complementarity Problems
- On the convergence of iterative methods for symmetric linear complementarity problems
- scientific article; zbMATH DE number 177992
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)
Cites Work
- Title not available (Why is that?)
- Solution of symmetric linear complementarity problems by iterative methods
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- Projection method for solving a singular system of linear equations and its applications
- Title not available (Why is that?)
- On the convergence properties of Hildreth's quadratic programming algorithm
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
Cited In (5)
- A parallel relaxation method for quadratic programming problems with interval constraints
- On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds
- Convergence analysis of projected SOR iteration method for a class of vertical linear complementarity problems
- Convergence of SSOR methods for linear complementarity problems
- Title not available (Why is that?)
This page was built for publication: On the convergence of SOR- and JOR-type methods for convex linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808627)
