Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones

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 derivable from associative algebras. In particular, such analyses are extendible to the cone of positive semidefinite Hermitian matrices with complex and quaternion entries, and to the Lorentz cone. We prove the case of the Lorentz cone by using the embedding of its associated Jordan algebra in the Clifford algebra. As an example of such extensions we take Momerio's polynomial-time complexity analysis of the family of similarly scaled directions – introduced by Monteiro and Zhang – and generalize it to cone linear programming over all representable symmetric cones.