Abstract
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 defining linear system with only moderate accuracy, e.g., via the use of Krylov subspace methods like CG or QMR. Furthermore, some numerical results for the proposed methods are given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
