We study analyticity, differentiability, and semismoothness of Löwner’s operator and spectral functions under the framework of Euclidean Jordan algebras. In particular, we show that many optimization-related classical results in the symmetric matrix space can be generalized within this framework. For example, the metric projection operator over any symmetric cone defined in a Euclidean Jordan a...

Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...

We review various properties of the exceptional Euclidean Jordan algebra of degree three. Euclidean Jordan algebras of degree three and their corresponding Freudenthal triple systems were recently shown to be intimately related to extremal black holes in N = 2, d = 4 homogeneous supergravities. Using a novel type of eigenvalue problem with eigenmatrix solutions, we elucidate the rich matrix geo...

We describe a Jordan-algebraic version of E. Lieb convexity inequalities. A joint convexity of Jordan-algebraic version of quantum entropy is proven. A version of noncommutative Bernstein inequality is proven as an application of one of convexity inequalities. A spectral theory on semi-simple complex algebras is used as a tool to prove the convexity results. Possible applications to optimizatio...

Jordan C*-algebras go back to Kaplansky, see [20]. Let J be a complex Banach Jordan algebra, that is, a complex Banach space with commutative bilinear product x◦y satisfying x◦(x2◦y) = x2◦(x◦y) as well as ||x◦y|| ≤ ||x||·||y||, Bounded symmetric domains and generalized operator algebras 51 and suppose that on J is given a (conjugate linear) isometric algebra involution x 7→ x∗. Then J is called...