Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- 1 February 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 1 (1), 114-122
- https://doi.org/10.1137/0801009
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity ProblemSIAM Journal on Control and 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
- Error bounds for monotone linear complementarity problemsMathematical Programming, 1986
- More results on the convergence of iterative methods for the symmetric linear complementarity problemJournal of Optimization Theory and Applications, 1986
- Simple computable bounds for solutions of linear complementarity problems and linear programsPublished by Springer Nature ,1985
- On the gradient-projection method for solving the nonsymmetric linear complementarity problemJournal of Optimization Theory and Applications, 1984
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problemJournal of Optimization Theory and Applications, 1984
- On the convergence of a basic iterative method for the implicit complementarity problemJournal of Optimization Theory and Applications, 1982
- Solution of symmetric linear complementarity problems by iterative methodsJournal of Optimization Theory and Applications, 1977