In this paper, an interior-point algorithm for Semidefinite Optimization (SDO) problems based on a new parametric kernel function is proposed. By means of some simple analysis tools, we prove that the primal-dual interior-point algorithm for solving SDO problems meets O (root lognlogn/epsilon), iteration complexity bound for large-update methods. Numerical results confirm that our new proposed kernel function is doing well in practice in comparison with some existing kernel functions in the literature.