A Jordan-algebraic approach to potential-reduction algorithms

We consider the linear monotone complementarity problem for domains obtained as the intersection of an affine subspace and the Cartesian product of symmetric cones. A primal-dual potential reduction algorithm is described and its complexity estimates are established with the help of the Jordan-algebraic technique.