International Business Machines Corporation. Research Division, M. Kojima, N. Megiddo, S. Mizuno
Theoretical Convergence of Large-step Primal-dual Interior Point Algorithms for Linear Programming
Theoretical Convergence of Large-step Primal-dual Interior Point Algorithms for Linear ProgrammingInternational Business Machines Corporation. Research Division
Sign up to use
International Business Machines Corporation. Research Division, M. Kojima, N. Megiddo, S. Mizuno
Theoretical Convergence of Large-step Primal-dual Interior Point Algorithms for Linear Programming

Theoretical Convergence of Large-step Primal-dual Interior Point Algorithms for Linear Programming

Sign up to use
Sign up to use
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."