A new proof for the criss-cross method for quadratic programming (Q4327956): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/02331939208843835
+Normal rank
@@ Property / OpenAlex ID @@
+W1991921085
@@ Property / OpenAlex ID: W1991921085 / rank @@
+Normal rank
@@ Property / cites work @@
+New Finite Pivoting Rules for the Simplex Method
@@ Property / cites work: New Finite Pivoting Rules for the Simplex Method / rank @@
+Normal rank
@@ Property / cites work @@
+Complementary pivot theory of mathematical programming
+Normal rank
@@ Property / cites work @@
+Computational complexity of LCPs associated with positive definite symmetric matrices
+Normal rank
@@ Property / cites work @@
+On the finiteness of the criss-cross method
@@ Property / cites work: On the finiteness of the criss-cross method / rank @@
+Normal rank
@@ Property / cites work @@
+The general quadratic optimization problem
@@ Property / cites work: The general quadratic optimization problem / rank @@
+Normal rank
@@ Property / cites work @@
+An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
+Normal rank
@@ Property / cites work @@
+A convergent criss-cross method
@@ Property / cites work: A convergent criss-cross method / rank @@
+Normal rank