“…"(a) ⇒ (b)" Since (a) holds, the elements x, y operator commute by Proposition 6 in [5]. Thus, there is a Jordan frame {e 1 , · · · , e r } such that x = r i=1 x i e i and y = r i=1 y i e i .…”
Section: Theorem 2 If G(·) Is Locally Lipschitz Onmentioning
confidence: 91%
“…SCCP provides a simple, natural, and unified framework for various existing complementarity problems, such as the NCP, SDCP and the second-order cone complementarity problem (SOCCP); see, e.g., [3,5,6,8,11,14,21].…”
We prove necessary and sufficient conditions for locally Lipschitz Löwner operators to be monotone, strictly monotone and strongly monotone. Utilizing our characterization of the strict monotonicity of Löwner operators, we generalize Mangasarian class of Nonlinear Complementarity Problem (NCP)-functions to the setting of symmetric cone complementarity problem. This affirmatively answers a question of Tseng [Math. Program. 83, 159-185(1998)].
“…"(a) ⇒ (b)" Since (a) holds, the elements x, y operator commute by Proposition 6 in [5]. Thus, there is a Jordan frame {e 1 , · · · , e r } such that x = r i=1 x i e i and y = r i=1 y i e i .…”
Section: Theorem 2 If G(·) Is Locally Lipschitz Onmentioning
confidence: 91%
“…SCCP provides a simple, natural, and unified framework for various existing complementarity problems, such as the NCP, SDCP and the second-order cone complementarity problem (SOCCP); see, e.g., [3,5,6,8,11,14,21].…”
We prove necessary and sufficient conditions for locally Lipschitz Löwner operators to be monotone, strictly monotone and strongly monotone. Utilizing our characterization of the strict monotonicity of Löwner operators, we generalize Mangasarian class of Nonlinear Complementarity Problem (NCP)-functions to the setting of symmetric cone complementarity problem. This affirmatively answers a question of Tseng [Math. Program. 83, 159-185(1998)].
In this article, based on the min-max theorem of Hirzebruch, we formulate and prove the Cauchy interlacing theorem in simple Euclidean Jordan algebras. As a consequence , we relate the inertias of an element and its principal components and extend some well known matrix theory theorems and inequalities to the setting of simple Euclidean Jordan algebras.
“…Every l i (x)(i {1,..., r}) is called an eigenvalue of x, which is a continuous function with respect to x (see [20]). Define Tr(x) := r i=1 λ i (x), where Tr(x) denotes the trace of x.…”
In this article, we consider the numerical method for solving the system of inequalities under the order induced by a symmetric cone with the function involved being monotone. Based on a perturbed smoothing function, the underlying system of inequalities is reformulated as a system of smooth equations, and a smoothing-type method is proposed to solve it iteratively so that a solution of the system of inequalities is found. By means of the theory of Euclidean Jordan algebras, the algorithm is proved to be well defined, and to be globally convergent under weak assumptions and locally quadratically convergent under suitable assumptions. Preliminary numerical results indicate that the algorithm is effective.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.