Gap between the Lower and Upper Bounds for the Iteration Complexity of Interior-Point Methods

Abstract

Recenrly, the uu of interior-point methods to solve linear optimi:arion problems, have been becoming great a/fenrion ro the researchers. The most important thing is that the interior point methods have the best complexity compared to other methods and also efficient in practice Gon:aga. Afomeiro and Adler presented small-update path-following methods. a varionr of interior-point methods. which is the best known upper bound for the iteration complexity of an interior-point method. Roos...