On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- 1 September 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 29 (5), 1037-1060
- https://doi.org/10.1137/0329057
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Relaxation Methods for Network Flow Problems with Convex Arc CostsSIAM Journal on Control and Optimization, 1987
- On the gradient-projection method for solving the nonsymmetric linear complementarity problemJournal of Optimization Theory and Applications, 1984
- On the convergence of a block successive over-relaxation method for a class of linear complementarity problemsPublished by Springer Nature ,1982
- A family of iterative quadratic optimization algorithms for pairs of inequalities, with application in diagnostic radiologyPublished by Springer Nature ,1978
- 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
- On Quadratic ProgrammingManagement Science, 1971
- Convex programming in Hilbert spaceBulletin of the American Mathematical Society, 1964
- A convex programming procedureNaval Research Logistics Quarterly, 1959
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956