Abstract:Recently, Y.Q. Bai, M. El Ghami and C. Roos  introduced a new class of so-called eligible kernel functions which are defined by some simple conditions. The authors designed primal-dual interiorpoint methods for linear optimization (LO) based on eligible kernel functions and simplified the analysis of these methods considerably. In this paper we consider the semidefinite optimization (SDO) problem and we generalize the aforementioned results for LO to SDO. The iteration bounds obtained are analogous to the results in  for LO.