Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem (Q1837116): Difference between revisions

@@ Property / cites work @@
+On the solution of large, structured linear complementarity problems: the block partitioned case
+Normal rank
@@ Property / cites work @@
+On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
+Normal rank
@@ Property / cites work @@
+The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
+Normal rank
@@ Property / cites work @@
+The solution of linear complementarity problems on an array processor
+Normal rank
@@ Property / cites work @@
+Iterative Solution of Linear Programs
@@ Property / cites work: Iterative Solution of Linear Programs / rank @@
+Normal rank
@@ Property / cites work @@
+A Hybrid Method for the Solution of Some Multi-Commodity Spatial Equilibrium Problems
+Normal rank
@@ Property / cites work @@
+Solution of symmetric linear complementarity problems by iterative methods
+Normal rank
@@ Property / cites work @@
+On the convergence of a basic iterative method for the implicit complementarity problem
+Normal rank
@@ Property / cites work @@
+Q3943082
@@ Property / cites work: Q3943082 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5661059
@@ Property / cites work: Q5661059 / rank @@
+Normal rank
@@ Property / cites work @@
+On recurring theorems on diagonal dominance
@@ Property / cites work: On recurring theorems on diagonal dominance / rank @@
+Normal rank
@@ Property / cites work @@
+Q5591247
@@ Property / cites work: Q5591247 / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsity-preserving SOR algorithms for separable quadratic and linear programming
+Normal rank
@@ Property / cites work @@
+On cone orderings and the linear complementarity problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf00934130
+Normal rank
@@ Property / OpenAlex ID @@
+W2025614874
@@ Property / OpenAlex ID: W2025614874 / rank @@
+Normal rank