The Helmberg-Rendl-Vanderbei-Wolkowicz/Kojima-Shindoh-Hara/Monteiro
and the Nesterov-Todd search directions have been used in many
primal-dual interior-point methods for semidefinite programs.  This
paper proposes an efficient method for computing the two directions
when a semidefinite program to be solved is large scale and sparse.