Learn More
In this paper we present a convergence analysis for some inexact (polynomial) variants of the infeasible-interior-point-algorithm of Kojima, Megiddo and Mizuno. For this analysis we assume that the iterates are bounded. The new variants allow the use of search directions that are calculated from the deening linear system with only moderate accuracy, e.g.(More)
  • 1