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
Hi-index | 0.01 |
We develop a condition-based complexity analysis for homogeneous polyhedra with real number data. We analyze the dependency of primal-dual interior point algorithm efficiency on this condition number for finding a point in a polyhedron. Keywords: polyhedron, interior point algorithms, condition-based complexity