Superlinear convergence of an infeasible interior point algorithm on the homogeneous feasibility model of a semi-definite program

In the literature, superlinear convergence of implementable polynomial-time interior point algorithms to solve semi-definite programs (SDPs) can only be shown by (i) assuming that the given SDP is nondegenerate and modifying these algorithms, or (ii) considering special classes of SDPs, such as the class of linear semi-definite feasibility problems, when a suitable initial iterate is … Read more