An exterior-point method for linear programming problems (Q2564164): Difference between revisions

@@ Property / author @@
-Jan Frederick Andrus
@@ Property / author: Jan Frederick Andrus / rank @@
-Normal rank
@@ Property / author @@
-M. R. Schäferkotter
@@ Property / author: M. R. Schäferkotter / rank @@
-Normal rank
@@ Property / author @@
+Jan Frederick Andrus
@@ Property / author: Jan Frederick Andrus / rank @@
+Normal rank
@@ Property / author @@
+M. R. Schäferkotter
@@ Property / author: M. R. Schäferkotter / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+An exterior point method for the convex programming problem
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms in linear programming
@@ Property / cites work: Polynomial algorithms in linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. I: Linear programming
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm, based on Newton's method, for linear programming
+Normal rank
@@ Property / cites work @@
+An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
+Normal rank
@@ Property / cites work @@
+Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2564164