Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes (Q3565464): Difference between revisions

@@ Property / cites work @@
+On the curvature of the central path of linear programming theory
+Normal rank
@@ Property / cites work @@
+NEWTON FLOW AND INTERIOR POINT METHODS IN LINEAR PROGRAMMING
+Normal rank
@@ Property / cites work @@
+Polytopes and arrangements: diameter and curvature
+Normal rank
@@ Property / cites work @@
+The central path visits all the vertices of the Klee–Minty cube
+Normal rank
@@ Property / cites work @@
+How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
+Normal rank
@@ Property / cites work @@
+Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
+Normal rank
@@ Property / cites work @@
+Computational techniques of the simplex method
@@ Property / cites work: Computational techniques of the simplex method / rank @@
+Normal rank
@@ Property / cites work @@
+Boundary Behavior of Interior Point Algorithms in Linear Programming
+Normal rank
@@ Property / cites work @@
+A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
+Normal rank
@@ Property / cites work @@
+On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
+Normal rank
@@ Property / cites work @@
+Interior Point Methods for Linear Optimization
@@ Property / cites work: Interior Point Methods for Linear Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of following the central path of linear programs by linear extrapolation. II
+Normal rank
@@ Property / cites work @@
+A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
+Normal rank
@@ Property / cites work @@
+A primal-dual interior point method whose running time depends only on the constraint matrix
+Normal rank
@@ Property / cites work @@
+Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
+Normal rank