A primal-dual variant of the Iri-Imai algorithm for linear programming

A local acceleration method for primal-dual potential-reduction algorithms is introduced. The method developed here uses modified Newton search directions to minimize the Tanabe-Todd-Ye (TTY) potential function, and can be regarded as a primal-dual variant df the Iri-Imai algorithm based on the multiplicative analogue of Karmarkar's potential function. When iterates are close to an optimal solution, the TTY potential function hits negative curvature along the generated search directions. Therefore, large reductions in the potential function can be obtained, guaranteeing polynomial and quadratic convergence to nondegenerate solutions.