Euclidean Jordan-algebra is a commonly used tool in designing interior point algorithms for symmetric cone programs. T-algebra, on the other hand, has rarely been used in symmetric cone programming. In this paper, we use both algebraic characterizations of symmetric cones to extend the target-following framework of linear programming to symmetric cone programming. Within this framework, we design an efficient algorithm that finds the analytic centers of convex sets described by linear matrix and convex quadratic constraints.

## Citation

Pre-print, School of Physical & Mathematical Sciences, Nanyang Technological University, Singapore, June 2008

## Article

View T-algebras and linear optimization over symmetric cones