On the Complexity of a Class of Projective Interior Point Methods

We present a generic projective interior point algorithm for linear programming which includes modified versions of Karmarkar's original algorithm and most other projective algorithms that have been proposed as special cases. We show that this class of algorithms has a worst case iteration bound of O(√nL) and is closely related to the class of potential reduction interior point methods.