A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases (Q3955153): Difference between revisions

@@ Property / cites work @@
+A stabilization of the simplex method
@@ Property / cites work: A stabilization of the simplex method / rank @@
+Normal rank
@@ Property / cites work @@
+On the Automatic Scaling of Matrices for Gaussian Elimination
+Normal rank
@@ Property / cites work @@
+A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination
+Normal rank
@@ Property / cites work @@
+Updated triangular factors of the basis to maintain sparsity in the product form simplex method
+Normal rank
@@ Property / cites work @@
+On the Bartels—Golub decomposition for linear programming bases
+Normal rank
@@ Property / cites work @@
+Reinversion with the preassigned pivot procedure
@@ Property / cites work: Reinversion with the preassigned pivot procedure / rank @@
+Normal rank
@@ Property / cites work @@
+A bump triangular dynamic factorization algorithm for the simplex method
+Normal rank
@@ Property / cites work @@
+The Elimination form of the Inverse and its Application to Linear Programming
+Normal rank
@@ Property / cites work @@
+Evolution of Linear Programming Computing Techniques
+Normal rank
@@ Property / cites work @@
+A degeneracy exploiting LU factorization for the simplex method
+Normal rank
@@ Property / cites work @@
+A Note on the Stability of Gaussian Elimination
@@ Property / cites work: A Note on the Stability of Gaussian Elimination / rank @@
+Normal rank
@@ Property / cites work @@
+Pivoting for Size and Sparsity in Linear Programming Inversion Routes
+Normal rank