New criss-cross type algorithms for linear complementarity problems with sufficient matrices (Q5478870): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/10556780500095009
+Normal rank
@@ Property / OpenAlex ID @@
+W2115992951
@@ Property / OpenAlex ID: W2115992951 / rank @@
+Normal rank
@@ Property / cites work @@
+New variants of the criss-cross method for linearly constrained convex quadratic programming
+Normal rank
@@ Property / cites work @@
+NP-completeness of the linear complementarity problem
+Normal rank
@@ Property / cites work @@
+Sufficient matrices and the linear complementarity problem
+Normal rank
@@ Property / cites work @@
+EP theorems and linear complementarity problems
@@ Property / cites work: EP theorems and linear complementarity problems / rank @@
+Normal rank
@@ Property / cites work @@
+The linear complementarity problem, sufficient matrices, and the criss- cross method
+Normal rank
@@ Property / cites work @@
+The role of pivoting in proving some fundamental theorems of linear algebra
+Normal rank
@@ Property / cites work @@
+A convergent criss-cross method
@@ Property / cites work: A convergent criss-cross method / rank @@
+Normal rank
@@ Property / cites work @@
+Criteria for sufficient matrices
@@ Property / cites work: Criteria for sufficient matrices / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5478870