Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
- 1 February 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 3 (1) , 155-163
- https://doi.org/10.1137/0803008
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality ProblemSIAM Journal on Optimization, 1992
- On the convergence of the coordinate descent method for convex differentiable minimizationJournal of Optimization Theory and Applications, 1992
- On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity ProblemSIAM Journal on Control and Optimization, 1991
- Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity ProblemSIAM Journal on Optimization, 1991
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity ProblemsSIAM Journal on Control and Optimization, 1987
- Iterative Methods for Large Convex Quadratic Programs: A SurveySIAM Journal on Control and Optimization, 1987
- On the gradient-projection method for solving the nonsymmetric linear complementarity problemJournal of Optimization Theory and Applications, 1984
- Solution of symmetric linear complementarity problems by iterative methodsJournal of Optimization Theory and Applications, 1977
- The Solution of a Quadratic Programming Problem Using Systematic OverrelaxationSIAM Journal on Control, 1971
- On the Solution of Singular and Semidefinite Linear Systems by IterationJournal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis, 1965