Fischer-Burmeister Complementarity Function on Euclidean Jordan Algebras

Size: px
Start display at page:

Download "Fischer-Burmeister Complementarity Function on Euclidean Jordan Algebras"

Transcription

1 Fischer-Burmeister Complementarity Function on Euclidean Jordan Algebras Lingchen Kong, Levent Tunçel, and Naihua Xiu 3 (November 6, 7; Revised December, 7) Abstract Recently, Gowda et al. [] established the Fischer-Burmeister (FB) complementarity function (C-function) on Euclidean Jordan algebras. In this paper, we prove that FB C-function as well as the derivatives of the squared norm of FB C-function are Lipschitz continuous. Keywords: Fischer-Burmeister function, Euclidean Jordan algebra, Lipschitz continuity. MSC Subject Classification: primary: 65K5, 9C33; secondary: 6B5, 5A9. Abbreviated Title: FB C-function on Euclidean Jordan algebras Introduction It is well-known that the scalar-valued FB function φ : R R R is specified by φ(a, b) : a + b a + b, a, b R, (.) which is attributed by Fischer to Burmeister (see [5, 6, 7]). It is a complementarity function for nonlinear complementarity problem (NCP)(called C-function or NCP function), that is, φ(a, b) a, b, ab. (.) FB function has been much studied in the context of NCP, because it has nice properties, such as strong semismoothness. Moreover, the squared norm of FB function has a Lipschitz continuous gradient, which can be effectively employed in the algorithmic development, see, e.g., [3, 8, 3]. Recently, FB function has been generalized to solve the semidefinite complementarity problem (SDCP) and the second-order cone complementarity problem (SOCCP). For instance, Tseng [] (also see Borwein and Lewis []) proved that FB function is a C-function for SDCP, and The work was partly supported by a Discovery Grant from NSERC, and the National Natural Science Foundation of China (67, ). Lingchen Kong, Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario NL 3G, Canada; Department of Applied Mathematics, Beijing Jiaotong University, Beijing 44, P. R. China ( konglchen@6.com) Levent Tunçel, Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario NL 3G, Canada ( ltuncel@math.uwaterloo.ca) 3 Naihua Xiu, Department of Applied Mathematics, Beijing Jiaotong University, Beijing 44, P. R. China ( nhxiu@center.njtu.edu.cn)

2 Fukushima, Luo and Tseng [9] showed that this is true in the setting of SOCCP. It was proved by Sim, Sun and Ralph [7] and Chen, Sun and Sun [] that the squared norm of FB function has a Lipschitz continuous gradient in the settings of SDCP and SOCCP, respectively. Gowda, Sznajder and Tao [] proposed the following (vector-valued) FB function on Euclidean Jordan algebras as Φ F B (x, y) : x + y (x + y ), (.3) (detailed description is in the next section) and showed that it is a C-function for symmetric cone complementarity problem (SCCP) which is to find a vector x J such that x K, y K, x, y, y F (x), (.4) where J is a space of n-dimensional real column vectors, (J,,, ) is a Euclidean Jordan algebra, K is the symmetric cone in V (see Section ), and F : J J is a given continuously differentiable mapping. SCCP provides a simple, natural, and unified framework for various complementarity problems, such as NCP, SOCCP and SDCP. Because of wide applications in engineering, management science and other fields, it has attracted much attention, see, e.g., [,,, 5, 6,, ]. Here, we say Φ : J J J is a C-function (for SCCP) if it satisfies Φ(x, y) x K, y K, x, y. (.5) Liu, Zhang and Wang [6] showed that the squared norm of FB function, Ψ F B : J J R, defined by Ψ F B (x, y) : Φ F B(x, y) (.6) is differentiable. Motivated by all of the cited work above, a natural question arises: Are the derivatives of the squared norm of FB function Ψ F B (given by (.6)) Lipschitz continuous? We answer the above question in the affirmative. To do so, we establish useful inequalities on the Lyapunov operator, employing the norm induced by the underlying inner product. In Section we establish the preliminaries and present some useful results about Lyapunov transformation. We show that FB function is Lipschitz continuous in Section 3. Section 4 establishes that the derivatives of squared norm of FB function are Lipschitz continuous. We conclude the paper in Section 5 and raise an open question. Preliminaries We review some results on Euclidean Jordan algebras (see for instance [4, 4]) and develop some basic inequalities on Euclidean Jordan algebras. A Euclidean Jordan algebra is a triple (J,,, )(V for short), where (J,, ) is a n- dimensional inner product space over real field R and (x, y) x y : J J J is a bilinear mapping which satisfies the following conditions:

3 (i) x y y x for all x, y J, (ii) x (x y) x (x y) for all x, y J where x : x x and (iii) x y, z x, y z for all x, y, z J. We call x y the Jordan product of x and y. In general, the Jordan product is not associative, i.e., (x y) z x (y z) for all x, y, z J. We assume that there exists an element e (called the identity element) such that x e e x x for all x J. Define the set of squares as K : {x : x J }. It is well-known that K is a symmetric cone in V, i.e., K is a closed, convex, homogeneous and self-dual cone. For x J, the degree of x denoted by deg(x) is the smallest positive integer m such that the set {e, x, x,, x m } is linearly dependent. The rank of V is defined as max{deg(x) : x J }. In this paper, r will denote the rank of the underlying Euclidean Jordan algebra. Let dim(j ) denote the dimension of J. Obviously, r dim(j ). Recall that an element c J is idempotent if c c. It is also primitive if it cannot be written as a sum of two idempotents. A complete system of orthogonal idempotents is a finite set {c, c,, c k } of idempotents with c i c j (i j) and k i c i e. A complete system of orthogonal primitive idempotents is called a Jordan frame of V. Thus, for any element x J, we have the following important spectral decomposition theorem. Theorem. (Theorem III.., [4]) Let V be a Euclidean Jordan algebra of rank r. Then for every vector x J there exist a Jordan frame {c (x), c (x),, c r (x)} and real numbers λ (x), λ (x),, λ r (x), the eigenvalues of x, such that We call (.) the spectral decomposition of x. x λ (x)c (x) + λ (x)c (x) + + λ r (x)c r (x). (.) Let x r j λ j(x)c j (x) and be the norm on J induced by the inner product, i.e., x : x, x λ j (x). We have c j (x) for j {,,, r}. as Let g : R R be a real-valued function. We define the vector-valued function G : J J G(x) : g(λ j (x))c j (x) g(λ (x))c (x) + g(λ (x))c (x) + + g(λ r (x))c r (x), j which is a Löwner operator. In particular, taking t + : max{, t}, we can define the projection of x onto K as x + : (λ j (x)) + c j (x). j Note that x K if and only if λ i (x), i {,,, r}. Letting g(t) : t for t R +, we define x : λ j (x)c j (x) for x K. j Therefore, FB function (.3) and its squared norm (.6) are well-defined. We next recall the Peirce decomposition theorem on the space J, where the Jordan frame {c, c,, c r } can be fixed beforehand. 3 j

4 Theorem. (Theorem IV.., [4]) Let {c, c,, c r } be a given Jordan frame in a Euclidean Jordan algebra V of rank r. Then J is the orthogonal direct sum of spaces J ij (i j), where the subspaces J ij for i, j {,,, r} are defined by { J ii : {x J : x c i x} and J ij : x J : x c i } x x c j, i j. Furthermore, (i) J ij J ij J ii + J jj ; (ii) J ij J jk J ik, if i k; (iii) J ij J kl {}, if {i, j} {k, l} Ø. Based on the result above and Lemma IV.. in [4], we have the following connection between x y and x y, which is useful in the subsequent analysis. Lemma.3 Let x J ij, y J kl with i < j and k < l. Then x y x y. Furthermore, if {i, j} {k, l} Ø, x y x y if i k, j l, 8 x y otherwise. Proof. Note that if {i, j} {k, l} Ø, then x y. If x J ij, y J jl with i, j, l all distinct, by Lemma IV.. in [4], x y 8 x y. We only need to prove the conclusion in the case of x, y J ij. By Theorem., x y δ c i + δ c j, for some δ, δ R. Thus, x y δ + δ. Meanwhile, by direct computation, we have x y x y, x y δ c i + δ c j, x y (δ c i + δ c j ) x, y (δ + δ )x, y (by Theorem.) δ + δ x y. Therefore, we conclude in this case that x y x y. Below we consider a very fundamental linear operator, Lyapunov transformation, and derive some inequalities on it that will be useful to us. For each x J, we define the Lyapunov transformation (operator) L(x) : J J by L(x)y x y, for all y J, which is a symmetric operator in the sense that L(x)y, z y, L(x)z for all y, z J. Given a r i λ i(a)c i (a) with λ (a) λ > λ + λ r (a), where (a) : {i : λ i (a) > }, we define a subspace J a : J(e (a), ) : {x J : x e (a) x} with e (a) : 4 i c i (a). (.)

5 It is well-known that L a : L(a) is a one-to-one mapping from J a to J a and therefore it has an inverse L a on J a, i.e., for any x J a, L a (x) is the unique d J a such that a d x. Using Lemma in [], any x J a can be expressed as x i x i c i (a) + i<j x ij, (.3) where x i R and x ij J ij with the given Jordan frame {c (a), c (a),, c r (a)}. The following proposition gives a formula for L a (x). Proposition.4 Let a r i λ i(a)c i (a) with λ (a) λ > λ + λ r (a). Let J a and e (a) be given by (.). Then every x J a can be written as in (.3) and L a (x) i x i λ i (a) c i(a) + j<l λ j (a) + λ l (a) x jl. (.4) In particular, L a (a) e (a) is the identity element in J a, and L a (a k ) a k for k >. Proof. As we noted before, the fact that every x J a can be written in the form (.3) is given by Lemma in []. Let d : L a (x). Then d i d i c i (a) + j<l for some d i R and d jl J jl. By Theorem., direct calculation yields that a d λ i (a)d i c i (a) + λ i (a)c i (a) i i i λ i (a)d i c i (a) + λ i (a)d i c i (a) + i j<l j<l i d jl, j<l λ i (a)c i (a) d jl λ j (a) + λ l (a) d jl. d jl This together with a d x establishes (.4). Likewise, for the above a and (a), we define subspaces J a : J(e (a), ) : {x J : x e (a) }, J a : J(e (a), ) : {x J : x e (a) x}. It is easy to see that Ja J(e e (a), ). Similarly, applying Lemma in [], any x Ja can be expressed as x x i c i (a) + x ij, i+ +i<jr 5

6 where x i R and x ij J ij. It is known that J is the orthogonal direct sum of spaces J a, J a and J a (see Page 6 of [4]). From Theorem., we obtain J a jl J jl, J a j,+lr J jl, J a +jlr J jl. (.5) Thus any x J can be expressed as x x () + x ( ) + x () where x () J a, x ( ) J a x () J a. Observe that a x ( ) J a. Moreover, L a is a one-to-one mapping from J a to J a, which is shown by the following. Proposition.5 Let a r i λ i(a)c i (a) with λ (a) λ > λ + λ r (a). Then every y J a can be written as y j,+lr and y jl (.6) and where y jl J jl. L a (y) j,+lr λ j (a) y jl, (.7) Proof. By Theorem. and (.5), every y J a can be written in the form (.6). Let d : L a (y). Then d d jl, j,+lr for d jl J jl. As in the proof of Proposition.4, we have L a (y) j,+lr λ j (a) + λ l (a) y jl. The desired conclusion follows from λ l (a) for + l r. Next, we consider some continuity property of L a ε where a ε : (a + ε e). Proposition.6 Let a r i λ i(a)c i (a) with λ (a) λ > λ + λ r (a). Then for any x J a and y J a, L (x + y) is well-defined and Let a ε : (a + ε e). Then L a a (x + y) L (x) + L (y). a a lim ε L a ε (x + y) L a (x + y). (.8) Proof. The first part of the theorem is obvious by Propositions.4 and.5. For the second part, since x J a and y J a, we can take x and y as in the forms (.3) and (.6), respectively. 6

7 Noting that a ε r i λ i(a ε )c i (a) with λ i (a ε ) λ i (a) + ε, and employing an argument similar to the one in the proof of Proposition.4, we have L a ε (x + y) i + x i λ i (a ε ) c i(a) + j,+lr j<l λ j (a ε ) + λ l (a ε ) x jl λ j (a ε ) + λ l (a ε ) y jl. This together with the facts λ l (a ε ) ε for + l r, (.4) and (.7) yields (.8). We end this section by presenting various useful inequalities on L. Lemma.7 For x, y J, let a ε (x, y) : (x + y + ε e) with ε. Then for every u, v J, we have L L a (x + y) u ε(x,y) β u, L a (v) x ε(x,y) β v and a (x u) ε(x,y) γ u, where β and γ are positive constants only dependent on the rank of J, which can be taken as β r 4 and γ 3r. Proof. For x, y J, define a : (x +y ) and let a r i λ i(a)c i. For u, v J, by Theorem., we have x x i c i + x jl, y y i c i + y jl, u i u i c i + i j<lr j<lr u jl, v i v i c i + i j<lr j<lr where x i, y i, u i, v i R and x jl, y jl, u jl, v jl J jl. Note that a ε (x, y) (x + y + ε e) λ i (a) + ε c i and a ε(x, y) x + y + ε e. Thus, r i λ i (a) + ε c i, a ε(x, y) c i, x + y ) + ε v jl, x c i, x + y c i, y + ε x i + yi + ( x jl + y jl ) + ε, j<lr,i {j,l} where the second equality holds by c i, e, the fourth follows from the facts that x c i x i c i + j<lr,i {j,l} x jl by Theorem. and x i c i + x jl, x x i + x jl. j<lr,i {j,l} j<lr,i {j,l} This implies that λ i (a) + ε max { x i, y i, x jl, y jl, i {j, l}}, (.9) 7

8 and for j l, j, l {,,, r} we obtain λ j (a) + ε + λ l (a) + ε max { x jl, y jl }. (.) From Proposition.4, we have L a ε (x,y) (x) i x i λ i (a) + ε c i + i j<lr x jl. λ j (a) + ε + λ l (a) + ε Thus, by Theorem., direct calculation yields L a (x) u x i u i ε(x,y) c i + x i c i λ i λ (a) + ε i (a) + ε ( ) + u i c i + i + i j<lr j<lr i λ j (a) + ε + x i u i λ i (a) + ε c i + i j<lr,i {j,l} + j<lr i<kr j<lr u jl x jl λ j (a) + ε + λ l (a) + ε x jl λ l (a) + ε i j<lr,i {j,l} u i λ j (a) + ε + λ j (a) + ε + x i j<lr u jl λ i (a) + ε λ l (a) + ε x jl x jl u ik, λ l (a) + ε where the second equality follows from c i u jl u jl with i {j, l}. Therefore, we have L a ε (x,y) (x) u x i u i c i i λ i (a) + ε + x i u jl i j<lr,i {j,l} λ i (a) + ε u i + x jl i j<lr,i {j,l} λ j (a) + ε + λ l (a) + ε + x jl u ik j<lr i<kr λ j (a) + ε + λ l (a) + ε u i + u jl + u i i + i j<lr,i {j,l} j<lr i<kr λ j (a) + ε + i j<lr,i {j,l} u jl x jl u λ l (a) + ik ε 8

9 r u + r(r ) u + r(r ) u + 4 [r(r )] u, where the second inequality holds by Lemma.3, the third by the fact u max{ u i, u jl }, (.9) and (.). Let β r + 3 r(r ) + 4 [r(r )]. Then L a ε (x,y) (x) u β u. Likewise, we have Similarly, noting that we obtain L (y) u β u. Hence, L a ε (x,y) (x + y) u L a ε (x,y) (x) u + L a ε (x,y) (y) u β u. L a ε (x,y) (v) We next show x u L i v i λ i (a) + ε c i + j<lr L a ε (x,y) (v) x β v. v jl, λ j (a) + ε + λ l (a) + ε a (x u) ε(x,y) γ u with γ only dependent on r. Note that ( ) x i u i c i + x i c i ( ) + u i c i i + j<lr x i u i c i + i + x jl i j<lr j<lr x j + x l i<jr k<lr,{i,j} {k,l} x i u i c i + i + i<j<kr j<lr ( xj + x l j<lr u jl u jl + u jl j<lr x ij u kl + i u j + u l x jl j<lr u jl + u ) j + u l x jl (x ij u jk + x jk u ij ) + j<lr x jl u jl x jl u jl. j<lr By Theorem., we can write x jl u jl c j + c l with, R. Thus, by Proposition.4, L x jl u jl L ( c j + c l) j<lr j<lr j<lr x jl c j + c l. λ j λ (a) + ε l (a) + ε 9

10 { } Observe that since c j c l, with θ jl : min λ j (a) + ε, λ l (a) + ε, we deduce That is, c j + c l λ j λ (a) + ε l (a) + ε c j λ j (a) + + c l ε λ l (a) + ε c j + c θ jl l θ jl ( c j + c l ) θ jl θjl c j + c l (by c j c l ) x jl u jl θ jl x jl u jl θ jl x jl θ jl u jl (by Lemma.3) u jl (θ jl x jl by (.9)) u. c j + c l λ j λ (a) + ε l (a) + ε u. Therefore, we have L j<lr x jl u jl j<lr j<lr j<lr c j + c l λ j λ (a) + ε l (a) + ε c j + c l λ j λ (a) + ε l (a) + ε u r(r ) u. (.) Set ξ : r i x iu i c i + ( ) xj +x l j<lr u jl + u j+u l x jl + i<j<kr (x ij u jk + x jk u ij ). Note that by Theorem., (x ij u jk + x jk u ij ) J ik. Similarly, by Proposition.4, we have L a ε (x,y) (ξ) x i u i c i + λ i (a) + ε i + i<j<kr j<lr λ j (a) + ε + ( xj + x l λ l (a) + ε (x ij u jk + x jk u ij ). λ i (a) + ε + λ k (a) + ε u jl + u ) j + u l x jl

11 Thus, we obtain from Lemma.3 and inequalities (.9) and (.) that L a ε (x,y) (ξ) u i + i j<lr ( u jl + u j + u l ) + i<j<kr ( u jk + u ij ) r u + 3 r(r ) u + r(r ) u. (.) So, combining the above inequalities (.) and (.), we have L a ε (x,y) (x u) L a ε (x,y) ξ + x jl u jl j<lr [r u + 3 ] r(r ) u + r(r ) u + r(r ) u (3r r) u. Letting γ 3r r, we obtain the desired inequality. 3 Lipschitz continuity of FB function In this section, we establish the Lipschitz continuity of FB C-function. For this purpose, we need the following result about the derivative of x in int(k), the interior of K. Lemma 3. The function x is smooth at every x int(k). Moreover, it holds (x (L(x )) ) for every x int(k). (3.) Proof. Clearly, x is smooth at x int(k). For the second part of the lemma, suppose that (x + h) x Sh + o( h ) for some linear operator S. Multiplying both sides of this equation by (x + h) + x, we have ((x + h) + x ) ((x + h) x ) ((x + h) + x ) (Sh + o( h )). Direct computation yields h ((x + h) + x ) Sh + o( h ) or h x (Sh) + o( h ), using (x + h) x + Sh + o( h ) and Sh Sh o( h ). That is, h L(x )(Sh) + o( h ). Hence, S (L(x )) (L(x )) by the linearity of Lyapunov transformation. We now prove the Lipschitz property of (x + y ). Lemma 3. The function (x + y ) is globally Lipschitz continuous everywhere in J J. Proof. Fix x, y J, let a(x, y) : (x + y ) and a ε (x, y) : (x + y + ε e) for ε. Note that for any u, v J, a ε (x + u, y + v) a ε (x, y) a ε (x + u, y + v) a ε (x, y + v) + a ε (x, y + v) a ε (x, y)

12 L L L a ε (x+tu,y+v) L(x + tu)udt + a ε (x+tu,y+v) ((x + tu) u)dt + a ε (x+tu,y+v) ((x + tu) u) dt + γ u dt + γ( u + v ) γ (u, v), γ v dt L a ε (x,y+tv) L(y + tv)vdt L a ε (x,y+tv) ((y + tv) v)dt L a ε (x,y+tv) ((y + tv) v) dt where the second equality holds by the Mean Value Theorem and Lemma 3., the first inequality holds by Lemma.7 and γ is only dependent on r, and the last inequality follows from the fact u + v u + v (u, v). Thus, we deduce a ε (x + u, y + v) a ε (x, y) γ (u, v). The desired conclusion follows by taking ε in the inequality above. As a consequence of the lemma above, we immediately obtain the Lipschitz continuity of FB function. Theorem 3.3 The FB function Φ F B (given by (.3)) is globally Lipschitz continuous everywhere in J J. 4 Lipschitz continuity of the derivatives of Ψ F B This section deals with Lipschitz continuity of the derivatives of the squared norm of FB C- function. The main result is stated below. Theorem 4. The derivatives of the squared norm of the Fischer-Burmeister function Ψ F B (given by (.6)) are Lipschitz continuous everywhere in J J. Our proof relies on four lemmas. First, we focus on L a (x + y) x where a (x + y ) in the subsequent analysis. Observe that a may have eigenvalues that are zero. For the sake of simplicity, we look at a smoothed counterpart a ε (x, y). Let S ε (x, y) : L (x + y) x, we have the following. Lemma 4. Let u, v J be given. Then for every x, y J and ε we have [ x S ε (x, y)] u L a ε (x,y)(x + y) u + L a ε (x,y) [ ] u L a ε (x,y)(x + y) L a ε (x,y) (x u) x, [ ] [ y S ε (x, y)] v L (x + y) v + L v L (x + y) L a (y v) ε(x,y) y. Proof. Fix u J. Set z : a ε (x + u, y) a ε (x, y) and w : x u + u. Noting that a ε (x + u, y) [(x + u) + y + ε e] [(x + y + ε e) + x u + u ],

13 we have z [a ε(x, y) + w] a ε (x, y). Note that J aε(x,y) J from (.). From Lemma 6.6() in [6], it follows that z L a ε (x,y) (x u + u ) + o( u ) L a ε (x,y)(x u) + o( u ). Thus z as u and z O( u ). Let η : L a ε (x,y)(x + y) and η + h : L a ε (x,y)+z(x + u + y). It is easy to see that a ε (x, y) η x + y and [a ε (x, y) + z] (η + h) x + u + y. So, a ε (x, y) h u z η z h, or h L (u z η) L (z h). Since z as u and z O( u ), h as u and h z o( z ) o( u ). We deduce Thus, direct calculation yields L a ε (x,y)(z h) o( u ) and h L a ε (x,y)(u z η) + o( u ). S ε (x + u, y) S ε (x, y) L a ε (x+u,y)(x + u + y) (x + u) L a ε (x,y)(x + y) x (η + h) (x + u) η x η u + h (x + u) L a ε (x,y)(x + y) u + L L a ε (x,y)(x + y) u + L a ε (x,y) a ε (x,y) L (x + y) u + L (u z η) (x + u) + o( u ) (x + u) [ ] u L a ε (x,y)(x + y) L a ε (x,y) (x u) (x + u) + o( u ) [ ] u L (x + y) L a (x u) ε(x,y) x + o( u ). This establishes the formula for [ x S ε (x, y)]u. The formula for [ y S ε (x, y)]v follows from the symmetry of x and y. Lemma 4.3 For every x, y, u and v J, [ x S ε (x, y)]u ρ u, [ y S ε (x, y)]v ρ v where ρ is only dependent on the rank of J, which can be taken as ρ r + 3r 4. Proof. Using Lemmas.7 and 4., we deduce [ ] [ x S ε (x, y)]u L a ε (x,y)(x + y) u + L a ε (x,y) u L a ε (x,y)(x + y) L a ε (x,y) (x u) x [ ] L L a ε (x,y) (x + y) u + a ε (x,y) u L a ε (x,y)(x + y) L a ε (x,y) (x u) x β u + β u L a ε (x,y)(x + y) L a ε (x,y) (x u) ( ) β u + β u + L a ε (x,y)(x + y) L a ε (x,y) (x u) ( ) β u + β u + 4β L a ε (x,y) (x u) β u + β( u + 4βγ u ), where β, γ are given as in Lemma.7. Therefore, by taking ρ : 3β + 4β γ, we obtain that [ x S ε (x, y)]u ρ u with ρ only dependent on r and ρ r + 3r 4 if β r 4 and γ 3r. As in the proof of the last lemma, [ y S ε (x, y)]v ρ v follows from symmetry. 3

14 Now we are in a position to prove the Lipschitz continuity of L a (x + y) x. Lemma 4.4 L a (x + y) x is globally Lipschitz continuous for all x, y J. Proof. We first show that S ε (x, y) L x, y J. For every u, v J, (x + y) x is globally Lipschitz continuous for all S ε (x + u, y + v) S ε (x, y) S ε (x + u, y + v) S ε (x, y + v) + S ε (x, y + v) S ε (x, y). By Lemma 4., x S ε (x, y) is continuous in x. Thus, it follows by the Mean Value Theorem that S ε (x + u, y + v) S ε (x, y + v) [ x S ε (x + tu, y + v)]udt. By Lemma 4.3, it follows that [ x S ε (x + tu, y + v)]u ρ u. Hence, S ε (x + u, y + v) S ε (x, y + v) [ x S ε (x + tu, y + v)]udt [ x S ε (x + tu, y + v)]u dt ρ u dt ρ u. That is, S ε (x + u, y + v) S ε (x, y + v) ρ u with ρ only dependent on r. Likewise, we have S ε (x, y + v) S ε (x, y) ρ v. We therefore obtain that S ε (x + u, y + v) S ε (x, y) ρ( u + v ), or L a ε (x+u,y+v)(x + u + y + v) (x + u) L a ε (x,y) (x + y) x ρ( u + v ). Note that L a ε (x,y)(x + y) x L a (x + y) x as ε by Proposition.6. Letting ε in the inequality above, we obtain the desired result. Before proving Theorem 4., we need to recall a lemma by Liu, Zhang and Wang [6]. Lemma 4.5 (Lemma 6.7, [6]) Ψ F B (x, y) is differentiable at every (x, y) J J, and if (x, y) (, ), then x Ψ F B (, ) y Ψ F B (, ) ; if (x, y) (, ), then where a (x + y ). Proof of Theorem 4. It is easy to see that x Ψ F B (x, y) L a (a x y) (x a), y Ψ F B (x, y) L a (a x y) (y a), Ψ F B (x, y) x + y, e + (x + y), e (x + y ), x + y. Let R(x, y) : (x + y ), x + y. Then R(x, y) x + y, e + (x + y), e Ψ F B (x, y). 4

15 Set a : (x + y ). By Lemma 4.5, it is straightforward to derive that x R(x, y) x + (x + y) x Ψ F B (x, y) x + y L a (a x y) x + L a (a x y) a x + y [ L a (a) L a (x + y) ] x + (a x y) L a (x + y) x + (x + y ), where the third equality holds by L a (a x y) a a x y, and the fourth by L a (a) x x. Combining Lemmas 3. and 4.4, we conclude that x R(x, y) is globally Lipschitz. By symmetry in x and y, y R(x, y) is also globally Lipschitz continuous. 5 Final Remarks In this article, we studied some properties of the Lyapunov operator, and using these properties we established Lipschitz continuity of FB function and the derivatives of squared norm of FB function. Sun and Sun [8] showed that the FB function is strongly semismooth everywhere in the cases of SDCP and SOCCP. However, it is not clear whether FB function Φ F B (given by (.3)) is strongly semismooth? We leave this question as a future research topic. Acknowledgments The authors thank Defeng Sun of National University of Singapore for very helpful discussions, which helped us eliminate a very important error in the first version of this paper. References [] J.M. Borwein and A.S. Lewis, Convex Analysis and Nonlinear Optimization: Theory and Examples, Springer-Verlag, NewYork,. [] J.-S. Chen, D. Sun and J. Sun, The SC property of the squared norm of the SOC Fischer-Burmeister function, Operations Research Letters to appear (7). [3] F. Facchinei and J.-S. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems, Volume I and II, Springer-Verlag, New York, 3. [4] J. Faraut and A. Korányi, Analysis on Symmetric Cones, Oxford University Press, New York, 994. [5] A. Fischer, A special Newton-type optimization method, Optimization 4 (99) [6] A. Fischer, A Newton-type method for positive semidefinite linear complementarity problems, Journal of Optimization Theory and Applications 86 (995) [7] A. Fischer, On the local superlinear convergence of a Newton-type method for LCP under weak conditions, Optimization Methods and Software 6 (995) [8] A. Fischer and H. Jiang, Merit Functions for Complementarity and Related Problems: A Survey, Computational Optimization and Applications 7 () [9] M. Fukushima, Z.Q. Luo and P. Tseng, Smoothing functions for second-order cone complementarity problems, SIAM J. Optim. ()

16 [] M.S. Gowda, R. Sznajder and J. Tao, Some P -properties for linear transformations on Euclidean Jordan algebras, Linear Algebra and Its Applications 393 (4) 3-3. [] M.S. Gowda and R. Sznajder, Automorphism invariance of P and GUS properties of linear transformations on Euclidean Jordan algebras, Math. Oper. Res. 3 (6) 9-3. [] M.S. Gowda and J. Tao, Z-transformation on proper and symmetric cone, Math. Program. to appear (6). [3] G. Isac, Topological Methods in Complementarity Theory, Kluwer Academic Publishers, Dordrecht,. [4] M. Koecher, The Minnesota Notes on Jordan Algebras and Their Applications, edited and annotated by A. Brieg and S. Walcher, Springer, Berlin, 999. [5] L. Kong and N. Xiu, New smooth C-functions for symmetric cone complementarity problems. Optimization Letters (7) [6] Y. Liu, L. Zhang and Y. Wang, Some properties of a class of merit functions for symmetric cone complementarity problems, Asia-Pacific Journal of Operational Research 3 (6) [7] C.-K. Sim, J. Sun and D. Ralph, A note on the Lipschitz continuity of the gradient of the squared norm of the matrix-valued Fischer-Burmeister function, Math. Program. 7 (6) [8] D. Sun and J. Sun, Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions, Math. Program. 3 (5) [9] D. Sun and J. Sun, Löwner s operator and spectral functions on Euclidean Jordan algebras, Math. Oper. Res. 33 (8). [] J. Tao and M.S. Gowda, Some P -properties for nonlinear transformations on Euclidean Jordan algebras, Math. Oper. Res. 3 (5) [] P. Tseng, Merit function for semi-definite complementarity problems, Math. Program. 83 (998) [] A. Yoshise, Interior point trajectories and a homogeneous model for nonlinear complementarity problems over symmetric cones, SIAM J. Optim. 7 (6)

Error bounds for symmetric cone complementarity problems

Error bounds for symmetric cone complementarity problems to appear in Numerical Algebra, Control and Optimization, 014 Error bounds for symmetric cone complementarity problems Xin-He Miao 1 Department of Mathematics School of Science Tianjin University Tianjin

More information

Clarke Generalized Jacobian of the Projection onto Symmetric Cones

Clarke Generalized Jacobian of the Projection onto Symmetric Cones Clarke Generalized Jacobian of the Projection onto Symmetric Cones Lingchen Kong 1, Levent Tunçel 2, and Naihua Xiu 3 June 26, 2008, revised April 14, 2009 Abstract In this paper, we give an exact expression

More information

Department of Social Systems and Management. Discussion Paper Series

Department of Social Systems and Management. Discussion Paper Series Department of Social Systems and Management Discussion Paper Series No. 1262 Complementarity Problems over Symmetric Cones: A Survey of Recent Developments in Several Aspects by Akiko YOSHISE July 2010

More information

Clarke Generalized Jacobian of the Projection onto Symmetric Cones and Its Applications

Clarke Generalized Jacobian of the Projection onto Symmetric Cones and Its Applications Clarke Generalized Jacobian of the Projection onto Symmetric Cones and Its Applications Lingchen Kong, Levent Tunçel 2, and Naihua Xiu 3 May 27, 2008 (revised: April 4, 2009) C & O Research Report CORR

More information

A Novel Inexact Smoothing Method for Second-Order Cone Complementarity Problems

A Novel Inexact Smoothing Method for Second-Order Cone Complementarity Problems A Novel Inexact Smoothing Method for Second-Order Cone Complementarity Problems Xiaoni Chi Guilin University of Electronic Technology School of Math & Comput Science Guilin Guangxi 541004 CHINA chixiaoni@126.com

More information

A class of Smoothing Method for Linear Second-Order Cone Programming

A class of Smoothing Method for Linear Second-Order Cone Programming Columbia International Publishing Journal of Advanced Computing (13) 1: 9-4 doi:1776/jac1313 Research Article A class of Smoothing Method for Linear Second-Order Cone Programming Zhuqing Gui *, Zhibin

More information

Xin-He Miao 2 Department of Mathematics Tianjin University, China Tianjin , China

Xin-He Miao 2 Department of Mathematics Tianjin University, China Tianjin , China Pacific Journal of Optimization, vol. 14, no. 3, pp. 399-419, 018 From symmetric cone optimization to nonsymmetric cone optimization: Spectral decomposition, nonsmooth analysis, and projections onto nonsymmetric

More information

A continuation method for nonlinear complementarity problems over symmetric cone

A continuation method for nonlinear complementarity problems over symmetric cone A continuation method for nonlinear complementarity problems over symmetric cone CHEK BENG CHUA AND PENG YI Abstract. In this paper, we introduce a new P -type condition for nonlinear functions defined

More information

Permutation invariant proper polyhedral cones and their Lyapunov rank

Permutation invariant proper polyhedral cones and their Lyapunov rank Permutation invariant proper polyhedral cones and their Lyapunov rank Juyoung Jeong Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland 21250, USA juyoung1@umbc.edu

More information

Sparse Recovery on Euclidean Jordan Algebras

Sparse Recovery on Euclidean Jordan Algebras Sparse Recovery on Euclidean Jordan Algebras Lingchen Kong, Jie Sun, Jiyuan Tao and Naihua Xiu February 3, 2013 Abstract We consider the sparse recovery problem on Euclidean Jordan algebra (SREJA), which

More information

20 J.-S. CHEN, C.-H. KO AND X.-R. WU. : R 2 R is given by. Recently, the generalized Fischer-Burmeister function ϕ p : R2 R, which includes

20 J.-S. CHEN, C.-H. KO AND X.-R. WU. : R 2 R is given by. Recently, the generalized Fischer-Burmeister function ϕ p : R2 R, which includes 016 0 J.-S. CHEN, C.-H. KO AND X.-R. WU whereas the natural residual function ϕ : R R is given by ϕ (a, b) = a (a b) + = min{a, b}. Recently, the generalized Fischer-Burmeister function ϕ p : R R, which

More information

Spectral gradient projection method for solving nonlinear monotone equations

Spectral gradient projection method for solving nonlinear monotone equations Journal of Computational and Applied Mathematics 196 (2006) 478 484 www.elsevier.com/locate/cam Spectral gradient projection method for solving nonlinear monotone equations Li Zhang, Weijun Zhou Department

More information

Key words. Complementarity set, Lyapunov rank, Bishop-Phelps cone, Irreducible cone

Key words. Complementarity set, Lyapunov rank, Bishop-Phelps cone, Irreducible cone ON THE IRREDUCIBILITY LYAPUNOV RANK AND AUTOMORPHISMS OF SPECIAL BISHOP-PHELPS CONES M. SEETHARAMA GOWDA AND D. TROTT Abstract. Motivated by optimization considerations we consider cones in R n to be called

More information

M. Seetharama Gowda. J. Tao. G. Ravindran

M. Seetharama Gowda. J. Tao. G. Ravindran Some complementarity properties of Z and Lyapunov-like transformations on symmetric cones M. Seetharama Gowda Department of Mathematics and Statistics, University of Maryland, Baltimore County, Baltimore,

More information

Complementarity properties of Peirce-diagonalizable linear transformations on Euclidean Jordan algebras

Complementarity properties of Peirce-diagonalizable linear transformations on Euclidean Jordan algebras Optimization Methods and Software Vol. 00, No. 00, January 2009, 1 14 Complementarity properties of Peirce-diagonalizable linear transformations on Euclidean Jordan algebras M. Seetharama Gowda a, J. Tao

More information

A PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE

A PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE Yugoslav Journal of Operations Research 24 (2014) Number 1, 35-51 DOI: 10.2298/YJOR120904016K A PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE BEHROUZ

More information

Journal of Mathematical Analysis and Applications. A one-parametric class of merit functions for the symmetric cone complementarity problem

Journal of Mathematical Analysis and Applications. A one-parametric class of merit functions for the symmetric cone complementarity problem J. Math. Anal. Appl. 355 009 195 15 Contents lists available at ScienceDirect Journal of Mathematical Analysis and Applications www.elsevier.com/locate/jmaa A one-parametric class of merit functions for

More information

Some characterizations of cone preserving Z-transformations

Some characterizations of cone preserving Z-transformations Annals of Operations Research manuscript No. (will be inserted by the editor) Some characterizations of cone preserving Z-transformations M. Seetharama Gowda Yoon J. Song K.C. Sivakumar This paper is dedicated,

More information

Applying a type of SOC-functions to solve a system of equalities and inequalities under the order induced by second-order cone

Applying a type of SOC-functions to solve a system of equalities and inequalities under the order induced by second-order cone Applying a type of SOC-functions to solve a system of equalities and inequalities under the order induced by second-order cone Xin-He Miao 1, Nuo Qi 2, B. Saheya 3 and Jein-Shan Chen 4 Abstract: In this

More information

Using Schur Complement Theorem to prove convexity of some SOC-functions

Using Schur Complement Theorem to prove convexity of some SOC-functions Journal of Nonlinear and Convex Analysis, vol. 13, no. 3, pp. 41-431, 01 Using Schur Complement Theorem to prove convexity of some SOC-functions Jein-Shan Chen 1 Department of Mathematics National Taiwan

More information

The Jordan Algebraic Structure of the Circular Cone

The Jordan Algebraic Structure of the Circular Cone The Jordan Algebraic Structure of the Circular Cone Baha Alzalg Department of Mathematics, The University of Jordan, Amman 1194, Jordan Abstract In this paper, we study and analyze the algebraic structure

More information

Polynomial complementarity problems

Polynomial complementarity problems Polynomial complementarity problems M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland 21250, USA gowda@umbc.edu December 2, 2016

More information

Löwner s Operator and Spectral Functions in Euclidean Jordan Algebras

Löwner s Operator and Spectral Functions in Euclidean Jordan Algebras MATHEMATICS OF OPERATIONS RESEARCH Vol. 33, No. 0, Xxxxxx 2008, pp. xxx xxx ISSN 0364-765X EISSN 1526-5471 08 3300 0xxx DOI 10.1287/moor.xxxx.xxxx c 2008 INFORMS Löwner s Operator and Spectral Functions

More information

Nonsmooth Matrix Valued Functions Defined by Singular Values

Nonsmooth Matrix Valued Functions Defined by Singular Values Nonsmooth Matrix Valued Functions Defined by Singular Values Defeng Sun 1 Department of Mathematics and Center for Industrial Mathematics National University of Singapore, Republic of Singapore Jie Sun

More information

We describe the generalization of Hazan s algorithm for symmetric programming

We describe the generalization of Hazan s algorithm for symmetric programming ON HAZAN S ALGORITHM FOR SYMMETRIC PROGRAMMING PROBLEMS L. FAYBUSOVICH Abstract. problems We describe the generalization of Hazan s algorithm for symmetric programming Key words. Symmetric programming,

More information

Research Article The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity Problem

Research Article The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity Problem Journal of Applied Mathematics Volume 2012, Article ID 219478, 15 pages doi:10.1155/2012/219478 Research Article The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity

More information

A smoothing Newton-type method for second-order cone programming problems based on a new smoothing Fischer-Burmeister function

A smoothing Newton-type method for second-order cone programming problems based on a new smoothing Fischer-Burmeister function Volume 30, N. 3, pp. 569 588, 2011 Copyright 2011 SBMAC ISSN 0101-8205 www.scielo.br/cam A smoothing Newton-type method for second-order cone programming problems based on a new smoothing Fischer-Burmeister

More information

Positive and doubly stochastic maps, and majorization in Euclidean Jordan algebras

Positive and doubly stochastic maps, and majorization in Euclidean Jordan algebras Positive and doubly stochastic maps, and majorization in Euclidean Jordan algebras M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland

More information

Newton-type Methods for Solving the Nonsmooth Equations with Finitely Many Maximum Functions

Newton-type Methods for Solving the Nonsmooth Equations with Finitely Many Maximum Functions 260 Journal of Advances in Applied Mathematics, Vol. 1, No. 4, October 2016 https://dx.doi.org/10.22606/jaam.2016.14006 Newton-type Methods for Solving the Nonsmooth Equations with Finitely Many Maximum

More information

L. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones. definition. spectral decomposition. quadratic representation. log-det barrier 18-1

L. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones. definition. spectral decomposition. quadratic representation. log-det barrier 18-1 L. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones definition spectral decomposition quadratic representation log-det barrier 18-1 Introduction This lecture: theoretical properties of the following

More information

Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method

Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method Bruno F. Lourenço Ellen H. Fukuda Masao Fukushima September 9, 017 Abstract In this work we are interested

More information

The eigenvalue map and spectral sets

The eigenvalue map and spectral sets The eigenvalue map and spectral sets p. 1/30 The eigenvalue map and spectral sets M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland

More information

GENERALIZED second-order cone complementarity

GENERALIZED second-order cone complementarity Stochastic Generalized Complementarity Problems in Second-Order Cone: Box-Constrained Minimization Reformulation and Solving Methods Mei-Ju Luo and Yan Zhang Abstract In this paper, we reformulate the

More information

SOME STABILITY RESULTS FOR THE SEMI-AFFINE VARIATIONAL INEQUALITY PROBLEM. 1. Introduction

SOME STABILITY RESULTS FOR THE SEMI-AFFINE VARIATIONAL INEQUALITY PROBLEM. 1. Introduction ACTA MATHEMATICA VIETNAMICA 271 Volume 29, Number 3, 2004, pp. 271-280 SOME STABILITY RESULTS FOR THE SEMI-AFFINE VARIATIONAL INEQUALITY PROBLEM NGUYEN NANG TAM Abstract. This paper establishes two theorems

More information

A Continuation Method for the Solution of Monotone Variational Inequality Problems

A Continuation Method for the Solution of Monotone Variational Inequality Problems A Continuation Method for the Solution of Monotone Variational Inequality Problems Christian Kanzow Institute of Applied Mathematics University of Hamburg Bundesstrasse 55 D 20146 Hamburg Germany e-mail:

More information

Strict diagonal dominance and a Geršgorin type theorem in Euclidean

Strict diagonal dominance and a Geršgorin type theorem in Euclidean Strict diagonal dominance and a Geršgorin type theorem in Euclidean Jordan algebras Melania Moldovan Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland

More information

ON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE. Sangho Kum and Gue Myung Lee. 1. Introduction

ON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE. Sangho Kum and Gue Myung Lee. 1. Introduction J. Korean Math. Soc. 38 (2001), No. 3, pp. 683 695 ON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE Sangho Kum and Gue Myung Lee Abstract. In this paper we are concerned with theoretical properties

More information

A smoothing-type algorithm for solving inequalities under the order induced by a symmetric cone

A smoothing-type algorithm for solving inequalities under the order induced by a symmetric cone RESEARCH Open Access A smoothing-type algorithm for solving inequalities under the order induced by a symmetric cone Nan Lu 1 and Ying Zhang 2* * Correspondence: yingzhang@tju. edu.cn 2 Department of Mathematics,

More information

A polynomial time interior point path following algorithm for LCP based on Chen Harker Kanzow smoothing techniques

A polynomial time interior point path following algorithm for LCP based on Chen Harker Kanzow smoothing techniques Math. Program. 86: 9 03 (999) Springer-Verlag 999 Digital Object Identifier (DOI) 0.007/s007990056a Song Xu James V. Burke A polynomial time interior point path following algorithm for LCP based on Chen

More information

Spectral sets and functions on Euclidean Jordan algebras

Spectral sets and functions on Euclidean Jordan algebras Spectral sets and functions on Euclidean Jordan algebras Juyoung Jeong Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland 21250, USA juyoung1@umbc.edu

More information

M. Seetharama Gowda a, J. Tao b & Roman Sznajder c a Department of Mathematics and Statistics, University of Maryland

M. Seetharama Gowda a, J. Tao b & Roman Sznajder c a Department of Mathematics and Statistics, University of Maryland This article was downloaded by: [University of Maryland Baltimore County] On: 03 April 2013, At: 09:11 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954

More information

Research Note. A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization

Research Note. A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization Iranian Journal of Operations Research Vol. 4, No. 1, 2013, pp. 88-107 Research Note A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization B. Kheirfam We

More information

Semismooth Newton methods for the cone spectrum of linear transformations relative to Lorentz cones

Semismooth Newton methods for the cone spectrum of linear transformations relative to Lorentz cones to appear in Linear and Nonlinear Analysis, 2014 Semismooth Newton methods for the cone spectrum of linear transformations relative to Lorentz cones Jein-Shan Chen 1 Department of Mathematics National

More information

An unconstrained smooth minimization reformulation of the second-order cone complementarity problem

An unconstrained smooth minimization reformulation of the second-order cone complementarity problem Math. Program., Ser. B 104, 93 37 005 Digital Object Identifier DOI 10.1007/s10107-005-0617-0 Jein-Shan Chen Paul Tseng An unconstrained smooth minimization reformulation of the second-order cone complementarity

More information

A derivative-free nonmonotone line search and its application to the spectral residual method

A derivative-free nonmonotone line search and its application to the spectral residual method IMA Journal of Numerical Analysis (2009) 29, 814 825 doi:10.1093/imanum/drn019 Advance Access publication on November 14, 2008 A derivative-free nonmonotone line search and its application to the spectral

More information

On the game-theoretic value of a linear transformation on a symmetric cone

On the game-theoretic value of a linear transformation on a symmetric cone On the game-theoretic value of a linear transformation ona symmetric cone p. 1/25 On the game-theoretic value of a linear transformation on a symmetric cone M. Seetharama Gowda Department of Mathematics

More information

2.1. Jordan algebras. In this subsection, we introduce Jordan algebras as well as some of their basic properties.

2.1. Jordan algebras. In this subsection, we introduce Jordan algebras as well as some of their basic properties. FULL NESTEROV-TODD STEP INTERIOR-POINT METHODS FOR SYMMETRIC OPTIMIZATION G. GU, M. ZANGIABADI, AND C. ROOS Abstract. Some Jordan algebras were proved more than a decade ago to be an indispensable tool

More information

The best generalised inverse of the linear operator in normed linear space

The best generalised inverse of the linear operator in normed linear space Linear Algebra and its Applications 420 (2007) 9 19 www.elsevier.com/locate/laa The best generalised inverse of the linear operator in normed linear space Ping Liu, Yu-wen Wang School of Mathematics and

More information

On the simplest expression of the perturbed Moore Penrose metric generalized inverse

On the simplest expression of the perturbed Moore Penrose metric generalized inverse Annals of the University of Bucharest (mathematical series) 4 (LXII) (2013), 433 446 On the simplest expression of the perturbed Moore Penrose metric generalized inverse Jianbing Cao and Yifeng Xue Communicated

More information

Largest dual ellipsoids inscribed in dual cones

Largest dual ellipsoids inscribed in dual cones Largest dual ellipsoids inscribed in dual cones M. J. Todd June 23, 2005 Abstract Suppose x and s lie in the interiors of a cone K and its dual K respectively. We seek dual ellipsoidal norms such that

More information

Weakly homogeneous variational inequalities and solvability of nonlinear equations over cones

Weakly homogeneous variational inequalities and solvability of nonlinear equations over cones Weakly homogeneous variational inequalities and solvability of nonlinear equations over cones M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore,

More information

THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR

THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR WEN LI AND MICHAEL K. NG Abstract. In this paper, we study the perturbation bound for the spectral radius of an m th - order n-dimensional

More information

A Simple Derivation of a Facial Reduction Algorithm and Extended Dual Systems

A Simple Derivation of a Facial Reduction Algorithm and Extended Dual Systems A Simple Derivation of a Facial Reduction Algorithm and Extended Dual Systems Gábor Pataki gabor@unc.edu Dept. of Statistics and OR University of North Carolina at Chapel Hill Abstract The Facial Reduction

More information

A double projection method for solving variational inequalities without monotonicity

A double projection method for solving variational inequalities without monotonicity A double projection method for solving variational inequalities without monotonicity Minglu Ye Yiran He Accepted by Computational Optimization and Applications, DOI: 10.1007/s10589-014-9659-7,Apr 05, 2014

More information

Some parametric inequalities on strongly regular graphs spectra

Some parametric inequalities on strongly regular graphs spectra INTERNATIONAL JOURNAL OF PURE MATHEMATICS Volume 3, 06 Some parametric inequalities on strongly regular graphs spectra Vasco Moço Mano and Luís de Almeida Vieira Email: vascomocomano@gmailcom Faculty of

More information

AN ASYMPTOTIC MINTY S TYPE VARIATIONAL INEQUALITY WITH PSEUDOMONOTONE OPERATORS. G. Isac

AN ASYMPTOTIC MINTY S TYPE VARIATIONAL INEQUALITY WITH PSEUDOMONOTONE OPERATORS. G. Isac Nonlinear Analysis Forum 8(1), pp. 55 64, 2003 AN ASYMPTOTIC MINTY S TYPE VARIATIONAL INEQUALITY WITH PSEUDOMONOTONE OPERATORS G. Isac Department of Mathematics Royal Military College of Canada P.O. Box

More information

Some inequalities involving determinants, eigenvalues, and Schur complements in Euclidean Jordan algebras

Some inequalities involving determinants, eigenvalues, and Schur complements in Euclidean Jordan algebras positivity manuscript No. (will be inserted by the editor) Some inequalities involving determinants, eigenvalues, and Schur complements in Euclidean Jordan algebras M. Seetharama Gowda Jiyuan Tao February

More information

SCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE

SCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE SCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE BABHRU JOSHI AND M. SEETHARAMA GOWDA Abstract. We consider the semidefinite cone K n consisting of all n n real symmetric positive semidefinite matrices.

More information

A Power Penalty Method for a Bounded Nonlinear Complementarity Problem

A Power Penalty Method for a Bounded Nonlinear Complementarity Problem A Power Penalty Method for a Bounded Nonlinear Complementarity Problem Song Wang 1 and Xiaoqi Yang 2 1 Department of Mathematics & Statistics Curtin University, GPO Box U1987, Perth WA 6845, Australia

More information

Uniqueness of the Solutions of Some Completion Problems

Uniqueness of the Solutions of Some Completion Problems Uniqueness of the Solutions of Some Completion Problems Chi-Kwong Li and Tom Milligan Abstract We determine the conditions for uniqueness of the solutions of several completion problems including the positive

More information

arxiv: v1 [math.na] 1 Sep 2018

arxiv: v1 [math.na] 1 Sep 2018 On the perturbation of an L -orthogonal projection Xuefeng Xu arxiv:18090000v1 [mathna] 1 Sep 018 September 5 018 Abstract The L -orthogonal projection is an important mathematical tool in scientific computing

More information

On the Coerciveness of Merit Functions for the Second-Order Cone Complementarity Problem

On the Coerciveness of Merit Functions for the Second-Order Cone Complementarity Problem On the Coerciveness of Merit Functions for the Second-Order Cone Complementarity Problem Guidance Professor Assistant Professor Masao Fukushima Nobuo Yamashita Shunsuke Hayashi 000 Graduate Course in Department

More information

Fixed point theorems of nondecreasing order-ćirić-lipschitz mappings in normed vector spaces without normalities of cones

Fixed point theorems of nondecreasing order-ćirić-lipschitz mappings in normed vector spaces without normalities of cones Available online at www.isr-publications.com/jnsa J. Nonlinear Sci. Appl., 10 (2017), 18 26 Research Article Journal Homepage: www.tjnsa.com - www.isr-publications.com/jnsa Fixed point theorems of nondecreasing

More information

Xiyou Cheng Zhitao Zhang. 1. Introduction

Xiyou Cheng Zhitao Zhang. 1. Introduction Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 34, 2009, 267 277 EXISTENCE OF POSITIVE SOLUTIONS TO SYSTEMS OF NONLINEAR INTEGRAL OR DIFFERENTIAL EQUATIONS Xiyou

More information

Tensor Complementarity Problem and Semi-positive Tensors

Tensor Complementarity Problem and Semi-positive Tensors DOI 10.1007/s10957-015-0800-2 Tensor Complementarity Problem and Semi-positive Tensors Yisheng Song 1 Liqun Qi 2 Received: 14 February 2015 / Accepted: 17 August 2015 Springer Science+Business Media New

More information

SOR- and Jacobi-type Iterative Methods for Solving l 1 -l 2 Problems by Way of Fenchel Duality 1

SOR- and Jacobi-type Iterative Methods for Solving l 1 -l 2 Problems by Way of Fenchel Duality 1 SOR- and Jacobi-type Iterative Methods for Solving l 1 -l 2 Problems by Way of Fenchel Duality 1 Masao Fukushima 2 July 17 2010; revised February 4 2011 Abstract We present an SOR-type algorithm and a

More information

arxiv: v1 [math.gr] 8 Nov 2008

arxiv: v1 [math.gr] 8 Nov 2008 SUBSPACES OF 7 7 SKEW-SYMMETRIC MATRICES RELATED TO THE GROUP G 2 arxiv:0811.1298v1 [math.gr] 8 Nov 2008 ROD GOW Abstract. Let K be a field of characteristic different from 2 and let C be an octonion algebra

More information

Absolute value equations

Absolute value equations Linear Algebra and its Applications 419 (2006) 359 367 www.elsevier.com/locate/laa Absolute value equations O.L. Mangasarian, R.R. Meyer Computer Sciences Department, University of Wisconsin, 1210 West

More information

1. Introduction The nonlinear complementarity problem (NCP) is to nd a point x 2 IR n such that hx; F (x)i = ; x 2 IR n + ; F (x) 2 IRn + ; where F is

1. Introduction The nonlinear complementarity problem (NCP) is to nd a point x 2 IR n such that hx; F (x)i = ; x 2 IR n + ; F (x) 2 IRn + ; where F is New NCP-Functions and Their Properties 3 by Christian Kanzow y, Nobuo Yamashita z and Masao Fukushima z y University of Hamburg, Institute of Applied Mathematics, Bundesstrasse 55, D-2146 Hamburg, Germany,

More information

Affine covariant Semi-smooth Newton in function space

Affine covariant Semi-smooth Newton in function space Affine covariant Semi-smooth Newton in function space Anton Schiela March 14, 2018 These are lecture notes of my talks given for the Winter School Modern Methods in Nonsmooth Optimization that was held

More information

Research Division. Computer and Automation Institute, Hungarian Academy of Sciences. H-1518 Budapest, P.O.Box 63. Ujvári, M. WP August, 2007

Research Division. Computer and Automation Institute, Hungarian Academy of Sciences. H-1518 Budapest, P.O.Box 63. Ujvári, M. WP August, 2007 Computer and Automation Institute, Hungarian Academy of Sciences Research Division H-1518 Budapest, P.O.Box 63. ON THE PROJECTION ONTO A FINITELY GENERATED CONE Ujvári, M. WP 2007-5 August, 2007 Laboratory

More information

A Smoothing Newton Method for Solving Absolute Value Equations

A Smoothing Newton Method for Solving Absolute Value Equations A Smoothing Newton Method for Solving Absolute Value Equations Xiaoqin Jiang Department of public basic, Wuhan Yangtze Business University, Wuhan 430065, P.R. China 392875220@qq.com Abstract: In this paper,

More information

Stationary Points of Bound Constrained Minimization Reformulations of Complementarity Problems1,2

Stationary Points of Bound Constrained Minimization Reformulations of Complementarity Problems1,2 JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS: Vol. 94, No. 2, pp. 449-467, AUGUST 1997 Stationary Points of Bound Constrained Minimization Reformulations of Complementarity Problems1,2 M. V. SOLODOV3

More information

WHEN ARE THE (UN)CONSTRAINED STATIONARY POINTS OF THE IMPLICIT LAGRANGIAN GLOBAL SOLUTIONS?

WHEN ARE THE (UN)CONSTRAINED STATIONARY POINTS OF THE IMPLICIT LAGRANGIAN GLOBAL SOLUTIONS? WHEN ARE THE (UN)CONSTRAINED STATIONARY POINTS OF THE IMPLICIT LAGRANGIAN GLOBAL SOLUTIONS? Francisco Facchinei a,1 and Christian Kanzow b a Università di Roma La Sapienza Dipartimento di Informatica e

More information

ON THE HÖLDER CONTINUITY OF MATRIX FUNCTIONS FOR NORMAL MATRICES

ON THE HÖLDER CONTINUITY OF MATRIX FUNCTIONS FOR NORMAL MATRICES Volume 10 (2009), Issue 4, Article 91, 5 pp. ON THE HÖLDER CONTINUITY O MATRIX UNCTIONS OR NORMAL MATRICES THOMAS P. WIHLER MATHEMATICS INSTITUTE UNIVERSITY O BERN SIDLERSTRASSE 5, CH-3012 BERN SWITZERLAND.

More information

MATH 581D FINAL EXAM Autumn December 12, 2016

MATH 581D FINAL EXAM Autumn December 12, 2016 MATH 58D FINAL EXAM Autumn 206 December 2, 206 NAME: SIGNATURE: Instructions: there are 6 problems on the final. Aim for solving 4 problems, but do as much as you can. Partial credit will be given on all

More information

An accelerated Newton method of high-order convergence for solving a class of weakly nonlinear complementarity problems

An accelerated Newton method of high-order convergence for solving a class of weakly nonlinear complementarity problems Available online at www.isr-publications.com/jnsa J. Nonlinear Sci. Appl., 0 (207), 4822 4833 Research Article Journal Homepage: www.tjnsa.com - www.isr-publications.com/jnsa An accelerated Newton method

More information

A PENALIZED FISCHER-BURMEISTER NCP-FUNCTION. September 1997 (revised May 1998 and March 1999)

A PENALIZED FISCHER-BURMEISTER NCP-FUNCTION. September 1997 (revised May 1998 and March 1999) A PENALIZED FISCHER-BURMEISTER NCP-FUNCTION Bintong Chen 1 Xiaojun Chen 2 Christian Kanzow 3 September 1997 revised May 1998 and March 1999 Abstract: We introduce a new NCP-function in order to reformulate

More information

Bulletin of the. Iranian Mathematical Society

Bulletin of the. Iranian Mathematical Society ISSN: 1017-060X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 41 (2015), No. 5, pp. 1259 1269. Title: A uniform approximation method to solve absolute value equation

More information

STRUCTURE AND DECOMPOSITIONS OF THE LINEAR SPAN OF GENERALIZED STOCHASTIC MATRICES

STRUCTURE AND DECOMPOSITIONS OF THE LINEAR SPAN OF GENERALIZED STOCHASTIC MATRICES Communications on Stochastic Analysis Vol 9, No 2 (2015) 239-250 Serials Publications wwwserialspublicationscom STRUCTURE AND DECOMPOSITIONS OF THE LINEAR SPAN OF GENERALIZED STOCHASTIC MATRICES ANDREAS

More information

Scalar Asymptotic Contractivity and Fixed Points for Nonexpansive Mappings on Unbounded Sets

Scalar Asymptotic Contractivity and Fixed Points for Nonexpansive Mappings on Unbounded Sets Scalar Asymptotic Contractivity and Fixed Points for Nonexpansive Mappings on Unbounded Sets George Isac Department of Mathematics Royal Military College of Canada, STN Forces Kingston, Ontario, Canada

More information

On the projection onto a finitely generated cone

On the projection onto a finitely generated cone Acta Cybernetica 00 (0000) 1 15. On the projection onto a finitely generated cone Miklós Ujvári Abstract In the paper we study the properties of the projection onto a finitely generated cone. We show for

More information

Linear-quadratic control problem with a linear term on semiinfinite interval: theory and applications

Linear-quadratic control problem with a linear term on semiinfinite interval: theory and applications Linear-quadratic control problem with a linear term on semiinfinite interval: theory and applications L. Faybusovich T. Mouktonglang Department of Mathematics, University of Notre Dame, Notre Dame, IN

More information

A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE

A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE Journal of Applied Analysis Vol. 6, No. 1 (2000), pp. 139 148 A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE A. W. A. TAHA Received

More information

POSITIVE MAP AS DIFFERENCE OF TWO COMPLETELY POSITIVE OR SUPER-POSITIVE MAPS

POSITIVE MAP AS DIFFERENCE OF TWO COMPLETELY POSITIVE OR SUPER-POSITIVE MAPS Adv. Oper. Theory 3 (2018), no. 1, 53 60 http://doi.org/10.22034/aot.1702-1129 ISSN: 2538-225X (electronic) http://aot-math.org POSITIVE MAP AS DIFFERENCE OF TWO COMPLETELY POSITIVE OR SUPER-POSITIVE MAPS

More information

Research Article Existence and Duality of Generalized ε-vector Equilibrium Problems

Research Article Existence and Duality of Generalized ε-vector Equilibrium Problems Applied Mathematics Volume 2012, Article ID 674512, 13 pages doi:10.1155/2012/674512 Research Article Existence and Duality of Generalized ε-vector Equilibrium Problems Hong-Yong Fu, Bin Dan, and Xiang-Yu

More information

An Even Order Symmetric B Tensor is Positive Definite

An Even Order Symmetric B Tensor is Positive Definite An Even Order Symmetric B Tensor is Positive Definite Liqun Qi, Yisheng Song arxiv:1404.0452v4 [math.sp] 14 May 2014 October 17, 2018 Abstract It is easily checkable if a given tensor is a B tensor, or

More information

EXAMPLES OF r-convex FUNCTIONS AND CHARACTERIZATIONS OF r-convex FUNCTIONS ASSOCIATED WITH SECOND-ORDER CONE

EXAMPLES OF r-convex FUNCTIONS AND CHARACTERIZATIONS OF r-convex FUNCTIONS ASSOCIATED WITH SECOND-ORDER CONE Linear and Nonlinear Analysis Volume 3, Number 3, 07, 367 384 EXAMPLES OF r-convex FUNCTIONS AND CHARACTERIZATIONS OF r-convex FUNCTIONS ASSOCIATED WITH SECOND-ORDER CONE CHIEN-HAO HUANG, HONG-LIN HUANG,

More information

Linear and Multilinear Algebra. Linear maps preserving rank of tensor products of matrices

Linear and Multilinear Algebra. Linear maps preserving rank of tensor products of matrices Linear maps preserving rank of tensor products of matrices Journal: Manuscript ID: GLMA-0-0 Manuscript Type: Original Article Date Submitted by the Author: -Aug-0 Complete List of Authors: Zheng, Baodong;

More information

On the Iteration Complexity of Some Projection Methods for Monotone Linear Variational Inequalities

On the Iteration Complexity of Some Projection Methods for Monotone Linear Variational Inequalities On the Iteration Complexity of Some Projection Methods for Monotone Linear Variational Inequalities Caihua Chen Xiaoling Fu Bingsheng He Xiaoming Yuan January 13, 2015 Abstract. Projection type methods

More information

Analysis-3 lecture schemes

Analysis-3 lecture schemes Analysis-3 lecture schemes (with Homeworks) 1 Csörgő István November, 2015 1 A jegyzet az ELTE Informatikai Kar 2015. évi Jegyzetpályázatának támogatásával készült Contents 1. Lesson 1 4 1.1. The Space

More information

Real Symmetric Matrices and Semidefinite Programming

Real Symmetric Matrices and Semidefinite Programming Real Symmetric Matrices and Semidefinite Programming Tatsiana Maskalevich Abstract Symmetric real matrices attain an important property stating that all their eigenvalues are real. This gives rise to many

More information

FIRST- AND SECOND-ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH VANISHING CONSTRAINTS 1. Tim Hoheisel and Christian Kanzow

FIRST- AND SECOND-ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH VANISHING CONSTRAINTS 1. Tim Hoheisel and Christian Kanzow FIRST- AND SECOND-ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH VANISHING CONSTRAINTS 1 Tim Hoheisel and Christian Kanzow Dedicated to Jiří Outrata on the occasion of his 60th birthday Preprint

More information

Singular Value Inequalities for Real and Imaginary Parts of Matrices

Singular Value Inequalities for Real and Imaginary Parts of Matrices Filomat 3:1 16, 63 69 DOI 1.98/FIL16163C Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Singular Value Inequalities for Real Imaginary

More information

A SIMPLY CONSTRAINED OPTIMIZATION REFORMULATION OF KKT SYSTEMS ARISING FROM VARIATIONAL INEQUALITIES

A SIMPLY CONSTRAINED OPTIMIZATION REFORMULATION OF KKT SYSTEMS ARISING FROM VARIATIONAL INEQUALITIES A SIMPLY CONSTRAINED OPTIMIZATION REFORMULATION OF KKT SYSTEMS ARISING FROM VARIATIONAL INEQUALITIES Francisco Facchinei 1, Andreas Fischer 2, Christian Kanzow 3, and Ji-Ming Peng 4 1 Università di Roma

More information

Properties of Solution Set of Tensor Complementarity Problem

Properties of Solution Set of Tensor Complementarity Problem Properties of Solution Set of Tensor Complementarity Problem arxiv:1508.00069v3 [math.oc] 14 Jan 2017 Yisheng Song Gaohang Yu Abstract The tensor complementarity problem is a specially structured nonlinear

More information

On the game-theoretic value of a linear transformation relative to a self-dual cone

On the game-theoretic value of a linear transformation relative to a self-dual cone On the game-theoretic value of a linear transformation relative to a self-dual cone M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland

More information

Abstract. 1. Introduction

Abstract. 1. Introduction Journal of Computational Mathematics Vol.28, No.2, 2010, 273 288. http://www.global-sci.org/jcm doi:10.4208/jcm.2009.10-m2870 UNIFORM SUPERCONVERGENCE OF GALERKIN METHODS FOR SINGULARLY PERTURBED PROBLEMS

More information

INERTIAL ACCELERATED ALGORITHMS FOR SOLVING SPLIT FEASIBILITY PROBLEMS. Yazheng Dang. Jie Sun. Honglei Xu

INERTIAL ACCELERATED ALGORITHMS FOR SOLVING SPLIT FEASIBILITY PROBLEMS. Yazheng Dang. Jie Sun. Honglei Xu Manuscript submitted to AIMS Journals Volume X, Number 0X, XX 200X doi:10.3934/xx.xx.xx.xx pp. X XX INERTIAL ACCELERATED ALGORITHMS FOR SOLVING SPLIT FEASIBILITY PROBLEMS Yazheng Dang School of Management

More information

Downloaded 12/13/16 to Redistribution subject to SIAM license or copyright; see

Downloaded 12/13/16 to Redistribution subject to SIAM license or copyright; see SIAM J. OPTIM. Vol. 11, No. 4, pp. 962 973 c 2001 Society for Industrial and Applied Mathematics MONOTONICITY OF FIXED POINT AND NORMAL MAPPINGS ASSOCIATED WITH VARIATIONAL INEQUALITY AND ITS APPLICATION

More information