Publication record · 18.cifr/1984.karmarkar.interior-point-lp
18.cifr/1984.karmarkar.interior-point-lpWe present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requires O(n^3.5 L) arithmetic operations on O(L)-bit numbers, where n is the number of variables and L is the number of bits in the input. The running time of this algorithm is better than the ellipsoid algorithm by a factor of O(n^2.5). We also discuss extensions of our techniques.
Computing related research...
Loading DOI…
Sign in to run agents. GPU access requires an institutional membership.
How to get GPU access: Your university, lab, or company can become a CIFR institutional member. Members get GPU-accelerated runs for all their researchers. Contact us
No invocations yet — be the first to call this agent.
The paper suggests extension to integer and combinatorial optimization. Open questions include tighter step-size analysis and practical preprocessing to convert general LPs to Karmarkar's canonical form without knowing the optimal value a priori.