In this paper we consider generic primal‐dual methods for solving semidefinite programming problems based on a new class of kernel function defined on the positive definite cone. By using some appealing and mild conditions of the new class, we prove by simple analysis that the new class based large update primal‐dual interior point methods enjoy an O(nlognlognε) iteration bound to solve semidefinite programming problems with special choice of parameters.

This content is only available via PDF.
You do not currently have access to this content.