We present a general framework whereby analysis of interior-point algorithms for semidefinite programming can be extended verbatim to optimization problems over all classes of symmetric cones ...