Theoretical Convergence of Large-step Primal-dual Interior Point Algorithms for Linear Programming
These rules allow large steps without performing any line search. Rule G is especially flexible enough for implementation in practically efficient primal-dual interior point algorithms."