Pseudomonotonicity and related properties in Euclidean Jordan algebras
نویسندگان
چکیده
In this paper, we extend the concept of pseudomonotonicity from Rn to the setting of Euclidean Jordan algebras. We study interconnections between pseudomonotonicity, monotonicity, and the Z-property.
منابع مشابه
Ela Pseudomonotonicity and Related Properties in Euclidean Jordan Algebras
In this paper, we extend the concept of pseudomonotonicity from Rn to the setting of Euclidean Jordan algebras. We study interconnections between pseudomonotonicity, monotonicity, and the Z-property.
متن کاملAutomorphism Invariance of P- and GUS-Properties of Linear Transformations on Euclidean Jordan Algebras
Generalizing the P-property of a matrix, Gowda et al. [Gowda, M. S., R. Sznajder, J. Tao. 2004. Some P-properties for linear transformations on Euclidean Jordan algebras. Linear Algebra Appl. 393 203–232] recently introduced and studied Pand globally uniquely solvable (GUS)-properties for linear transformations defined on Euclidean Jordan algebras. In this paper, we study the invariance of thes...
متن کاملJordan Algebras and Extremal Black Holes
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...
متن کاملOn p-semilinear transformations
In this paper, we introduce $p$-semilinear transformations for linear algebras over a field ${bf F}$ of positive characteristic $p$, discuss initially the elementary properties of $p$-semilinear transformations, make use of it to give some characterizations of linear algebras over a field ${bf F}$ of positive characteristic $p$. Moreover, we find a one-to-one correspondence between $p$-semiline...
متن کاملPrimal-dual path-following algorithms for circular programming
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...
متن کامل