The convergence of parallel iteration algorithms for linear complementarity problems
- 1 November 1996
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 32 (9), 1-17
- https://doi.org/10.1016/0898-1221(96)00172-1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Parallel Numerical Solution of Variational InequalitiesSIAM Journal on Numerical Analysis, 1994
- Convergence of relaxed parallel multisplitting methodsLinear Algebra and its Applications, 1989
- Multisplittings and parallel iterative methodsComputer Methods in Applied Mechanics and Engineering, 1987
- Multi-Splittings of Matrices and Parallel Solution of Linear SystemsSIAM Journal on Algebraic Discrete Methods, 1985
- An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problemsApplied Mathematics & Optimization, 1985
- On the solution of large, structured linear complementarity problems: The block partitioned caseApplied Mathematics & Optimization, 1977
- The Solution of a Quadratic Programming Problem Using Systematic OverrelaxationSIAM Journal on Control, 1971
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- Bimatrix Equilibrium Points and Mathematical ProgrammingManagement Science, 1965