Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (Q1872636): Difference between revisions

@@ Property / DOI @@
-.1006/jcom.2002.0640
@@ Property / DOI: 10.1006/jcom.2002.0640 / rank @@
-Normal rank
@@ Property / cites work @@
+A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
+Normal rank
@@ Property / cites work @@
+New results on the average behavior of simplex algorithms
+Normal rank
@@ Property / cites work @@
+Q2743961
@@ Property / cites work: Q2743961 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+Q3134873
@@ Property / cites work: Q3134873 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
+Normal rank
@@ Property / cites work @@
+Erratum: A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes
+Normal rank
@@ Property / cites work @@
+Q4296156
@@ Property / cites work: Q4296156 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4346077
@@ Property / cites work: Q4346077 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4494406
@@ Property / cites work: Q4494406 / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Finding an interior point in the optimal face of linear programs
+Normal rank
@@ Property / cites work @@
+On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+On the average number of steps of the simplex method of linear programming
+Normal rank
@@ Property / cites work @@
+Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
+Normal rank
@@ Property / cites work @@
+Probabilistic Models for Linear Programming
@@ Property / cites work: Probabilistic Models for Linear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
+Normal rank
@@ Property / cites work @@
+Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
+Normal rank
@@ Property / cites work @@
+Q4382667
@@ Property / cites work: Q4382667 / rank @@
+Normal rank
@@ Property / DOI @@
+.1006/JCOM.2002.0640
@@ Property / DOI: 10.1006/JCOM.2002.0640 / rank @@
+Normal rank