Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204): Difference between revisions

@@ Property / author @@
-Benjamin Jansen
@@ Property / author: Benjamin Jansen / rank @@
-Normal rank
@@ Property / author @@
-Cornelis Roos
@@ Property / author: Cornelis Roos / rank @@
-Normal rank
@@ Property / author @@
-Tamás Terlaky
@@ Property / author: Tamás Terlaky / rank @@
-Normal rank
@@ Property / author @@
+Benjamin Jansen
@@ Property / author: Benjamin Jansen / rank @@
+Normal rank
@@ Property / author @@
+Cornelis Roos
@@ Property / author: Cornelis Roos / rank @@
+Normal rank
@@ Property / author @@
+Tamás Terlaky
@@ Property / author: Tamás Terlaky / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
+Normal rank
@@ Property / cites work @@
+Q5588268
@@ Property / cites work: Q5588268 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3033554
@@ Property / cites work: Q3033554 / rank @@
+Normal rank
@@ Property / cites work @@
+Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
+Normal rank
@@ Property / cites work @@
+A polynomial method of approximate centers for linear programming
+Normal rank
@@ Property / cites work @@
+The Projective SUMT Method for Convex Programming
@@ Property / cites work: The Projective SUMT Method for Convex Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3491304
@@ Property / cites work: Q3491304 / rank @@
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. I: Linear programming
+Normal rank
@@ Property / cites work @@
+An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Computational experience with a primal-dual interior point method for linear programming
+Normal rank
@@ Property / cites work @@
+An Implementation of a Primal-Dual Interior Point Method for Linear Programming
+Normal rank
@@ Property / cites work @@
+On the Implementation of a Primal-Dual Interior Point Method
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for a class of linear complementarity problems
+Normal rank
@@ Property / cites work @@
+A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+Path-Following Methods for Linear Programming
@@ Property / cites work: Path-Following Methods for Linear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4296156
@@ Property / cites work: Q4296156 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. II: Convex quadratic programming
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02191759
+Normal rank
@@ Property / OpenAlex ID @@
+W2032415977
@@ Property / OpenAlex ID: W2032415977 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1337204