Primal-dual interior-point methods for semidefinite programming: numerical experience with block-diagonal problems

In this paper, we briefly describe two interior-point algorithms for semidefinite programming. At each iteration, both these algorithms compute search directions by solving a linear system. We discuss some preliminary experiments for moderately sized, block diagonal semidefinite programs, comparing direct and iterative methods for solving the linear systems.