On a commutative class of search directions for linear programming over symmetric cones
The author investigates the complexity of rather general path-following techniques for linear programming problems over symmetric cones. In particular, a commutative class of search directions is studied. As abstract tool the author uses the approach given in the book \textit{J. Faraut} and \textit{A. Korányi} [Analysis on symmetric cones. Clarendon Press, Oxford (1994; Zbl 0841.43002)]. A study of it is recommended to be easier able to follow the applied concept of Euclidean Jordan algebra and Pierce decomposition.
scientific article; zbMATH DE number 1752505