Combinatorial complexity of the central curve

Authors:
Peter A. Beling;Sushil Verma
Affiliations:
Department of Systems Engineering, University of Virginia, Charlottesville, VA;Department of Industrial Engineering and Systems Engineering, University of Southern California, Los Angeles, CA
Venue:
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Year:
1997

Citing 6
Cited 0

Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems

Mathematical Programming: Series A and B
A simplex variant solving an m×d linear program in O(min(m2,d2)) expected number of pivot steps

Journal of Complexity
Interior path following primal-dual algorithms. Part II: Convex quadratic programming

Mathematical Programming: Series A and B
Unified complexity analysis for Newton LP methods

Mathematical Programming: Series A and B
An accelerated interior point method whose running time depends only on A (extended abstract)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The curvature integral and the complexity of linear complementarity problems

Mathematical Programming: Series A and B

Quantified Score

Hi-index	0.00

Visualization

Abstract