Recently, Y.Q. Bai, M. El Ghami and C. Roos [3] introduced a new class ofso-called eligible kernel functions which are defined by somesimple conditions.The authors designed primal-dual interior-point methods for linear optimization (LO)based on eligible kernel functionsand simplified the analysis of these methods considerably.In this paper we consider the semidefinite optimization (SDO) problemand we generalize the aforementioned results for LO to SDO.The iteration bounds obtained are analogous to the results in [3] for LO.
