Primal-dual interior point algorithms for convex quadratically constrained and semidefinite optimization problems