Clarke Generalized Jacobian of the Projection onto Symmetric Cones

Size: px
Start display at page:

Download "Clarke Generalized Jacobian of the Projection onto Symmetric Cones"

Transcription

1 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 for Clarke generalized Jacobian of the projection onto symmetric cones, which generalizes and unifies the existing related results on secondorder cones and the cones of symmetric positive semi-definite matrices over the reals Our characterization of the Clarke generalized Jacobian exposes a connection to rank-one matrices Keywords: Clarke generalized Jacobian; Projection; Symmetric cones; Euclidean Jordan algebra MSC2000 Subject Classification: primary: 49R50, 49J52, secondary: 26E25, 47A75 Abbreviated Title: Clarke Generalized Jacobian of the Projection 1 Introduction This paper focuses on Clarke generalized Jacobian of the projection onto symmetric cones First, we recall some basic concepts Let : Ω X Y be a locally Lipschitz function on an open set Ω, where X and Y are two finite dimensional inner product spaces over the field R Let x denote the derivative of at x if is differentiable at x The Clarke generalized Jacobian of at x is defined by x := conv{ B x}, where B x := {lim x x, x D x} is the B-subdifferential of at x, and D is the set of points of Ω where is differentiable We assume that the reader is familiar with the concepts of strong semismoothness, and refer to [4, 5, 14, 15, 16] for details It is well-known that the scalar-valued function g : R R + with gt = t + := max{0,t} is strongly semismooth and its Clarke generalized Jacobian is specified by t + /t if t 0 and the interval [0,1] if t = 0 Note that the projection onto an arbitrary closed convex set is Lipschitz continuous In the case of second-order cone, we know that the projection operator is strongly semismooth, see, eg, [2, 3, 8] In particular, Hayashi, Yamashita and Fukushima [8] gave an explicit representation for Clarke generalized Jacobian of the projection onto second-order 1 Lingchen Kong, Department of Applied Mathematics, Beijing Jiaotong University, Beijing , P R China; Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada konglchen@126com 2 Levent Tunçel, Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada ltuncel@mathuwaterlooca 3 Naihua Xiu, Department of Applied Mathematics, Beijing Jiaotong University, Beijing , P R China nhxiu@bjtueducn 1

2 cones Malick and Sendov [12] studied the differentiability properties of the projection onto cone of positive semi-definite matrices and worked out its Clarke generalized Jacobian Recently, Sun and Sun [19] showed that the projection onto symmetric cones, which include the nonnegative orthant, the cone of symmetric positive semi-definite matrices and the second-order cone as special cases, is strongly semismooth everywhere Kong, Sun and Xiu [11] studied the Clarke generalized Jacobian of the projection onto symmetric cones and gave its upper bound and lower bound Meng, Sun and Zhao [13] studied the Clarke generalized Jacobian of the projection onto nonempty closed convex sets and showed that any element V in its Clarke generalized Jacobian is self-adjoint and V V 2 see Proposition 1 of [13] for details One of the areas where projection operator is widely applied is the area of complementarity problems, see, eg, [5] Also, projection operator is a fundamental ingredient of many algorithms for solving convex optimization problems see for instance the survey by Bauschke and Borwein [1] and the references therein Our work is in the setting of symmetric cones which unifies and generalizes the special cases of second-order cones, cones of Hermitian positive semi-definite matrices over reals, complex numbers, quaternions as well as the direct sums of any subset of these cones Motivated by all of the work cited above, we aim to give the exact expression of the Clarke generalized Jacobian of the projection onto symmetric cones x + or Π K x, see Section 2 Our result generalizes corresponding results of [8] and [12] from second-order cones and positive semi-definite cones respectively to symmetric cones Interesting enough, the expression of the Clarke generalized Jacobian of x + is linked to rank-one matrices This allows us to obtain the formulae of operators x and x in a similar manner This paper is organized as follows In the next section, we establish the preliminaries and study the relationship among all the Jordan frames of an element We also introduce the matrix representation of the Jacobian operator of x + In Section 3, we present the exact expression of the Clarke generalized Jacobian of the projection operator x + by studying its B-subdifferential In Section 4, we investigate the relationships among B-subdifferentials of x +, x and x 2 Preliminaries 21 Euclidean Jordan algebras We give a brief introduction to Euclidean Jordan algebras More comprehensive introduction to the area can be found in Koecher s lecture notes [10] and in the monograph by Faraut and Korányi [6] A Euclidean Jordan algebra is a triple J,,, V for short, where J,, is a n- dimensional inner product space over R and x, y x y : J J J is a bilinear mapping which satisfies the following conditions: i x y = y x for all x,y J, ii x x 2 y = x 2 x y for all x,y J where x 2 := x x, iii x y,w = x,y w for all x,y,w J We call x y the Jordan product of x and y In general, x y w x y w for all x,y,w J We assume that there exists an element e called the identity element such that x e = e x = x for all x J Given a Euclidean Jordan algebra V, define the set of squares as K := {x 2 : x J } By Theorem III 21 in [6], K is the symmetric cone, ie, K is a closed, convex, homogeneous and self-dual cone For x J, the degree of x denoted by degx is the smallest positive 2

3 integer k such that the set {e,x,x 2,,x k } is linearly dependent The rank of V is defined as max{degx : x J } In this paper, r will denote the rank of the underlying Euclidean Jordan algebra An element c J is an idempotent if c 2 = c 0, which 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 1,c 2,,c k } of idempotents where c i c j = 0 for all i j, and c 1 + c c k = e A Jordan frame is a complete system of orthogonal primitive idempotents in V We now review two spectral decomposition theorems for the elements in a Euclidean Jordan algebra Theorem 21 Spectral Decomposition Type I Theorem III11, [6] Let V be a Euclidean Jordan algebra Then for x J there exist unique real numbers µ 1 x,µ 2 x,,µ r x, all distinct, and a unique complete system of orthogonal idempotents {b 1,b 2,,b r } such that x = µ 1 xb µ r xb r Theorem 22 Spectral Decomposition Type II Theorem III12, [6] Let V be a Euclidean Jordan algebra with rank r Then for x J there exist a Jordan frame {c 1,c 2,,c r } and real numbers λ 1 x,λ 2 x,,λ r x such that x = λ 1 xc 1 + λ 2 xc λ r xc r 21 The numbers λ i x i = 1,2,,r are the eigenvalues of x We call 21 the spectral decomposition or the spectral expansion of x Note that the above {b 1,b 2,,b r } and {c 1,c 2,,c r } depend on x We do not write this dependence explicitly for the sake of simplicity in notation Let Cx be the set consisting of all Jordan frames in the spectral decomposition of x Let the spectrum σx be the set of all eigenvalues of x Then σx = {µ 1 x,µ 2 x,,µ r x} and for each µ i x σx, denoting N i x := {j : λ j x = µ i x} we have b i = j N i x c j Let g : R R be a real-valued function Define the vector-valued function G : J J as Gx := r gλ j xc j x = gλ 1 xc 1 x + gλ 2 xc 2 x + + gλ r xc r x, 22 j=1 which is a Löwner operator In particular, letting t + := max{0,t}, t := min{0,t} and noting t = t + t t R, respectively, we define Π K x := x + := r λ i x + c i x, x := i=1 r r λ i x c i x and x := λ i x c i x i=1 i=1 Note that z K z intk if and only if λ i z 0 λ i z > 0 i {1,2,,r}, where intk denotes the interior of K It is easy to verify that x + K, x = x + + x, and x = x + x In other words, x + is the projection of x onto K For each x J, we define the Lyapunov transformation Lx : J J by Lxy = x y for all y J, which is a symmetric self-adjoint operator in the sense that Lxy,w = y, Lxw for all y,w J The operator Qx := 2L 2 x Lx 2 is called the quadratic representation of 3

4 x We say two elements x, y J operator commute if LxLy = LyLx By Lemma X22 in [6], two elements x,y operator commute if and only if they share a common Jordan frame Next, we recall the Peirce decomposition on the space J Let c J be a nonzero idempotent Then J is the orthogonal direct sum of Jc,0,Jc, 1 2 and Jc,1, where Jc,ε := {z J : c z = εz}, ε {0, 12 },1 This is called the Peirce decomposition of J with respect to the nonzero idempotent c Fix a Jordan frame {c 1,c 2,,c r } Defining the following subspaces for i,j {1,2,,r}, { J ii := {x J : x c i = x} and J ij := x J : x c i = 1 } 2 x = x c j, i j, we have J ii = J c i,1 and J ij = J c i,1/2 J c j,1/2 = J ji We state the Peirce decomposition theorem as follows For more detail, see [6] Theorem 23 Theorem IV21, [6] Let {c 1,c 2,,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 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 = {0}, if {i,j} {k,l} = Ø In a n-dimensional Euclidean Jordan algebra V of rank r, by Corollary IV26 of [6], we have dimj ij = dimj kl =: n for i,j,k,l {1,2,,r} such that i j,k l Then n = r + n rr For a given Jordan frame {c 1,c 2,,c r } and i,j {1,2,,r}, let C ij x be the orthogonal projection operator onto subspace J ij Then, by Theorem 23, we have C jj x = Qc j and C ij x = 4Lc i Lc j = 4Lc j Lc i = C ji x, i,j {1,2,,r}, 24 and the orthogonal projection operators {C ij x : i,j {1,2,,r}} satisfy and C ij x = C ijx, C ij x 2 = C ij x, C ij xc kl x = 0 if {i,j} {k,l},i,j,k,l {1,2,,r} 1 i j r C ij x = I, where C ij x is the adjoint operator of C ijx and I is the identity operator Furthermore, we have the following spectral decomposition theorem for Lx, Lx 2 and Qx For a more detailed exposition, see [10, 19] Theorem 24 Theorem 31, [19] Let x J and r j=1 λ jxc j x denote its spectral decomposition with λ 1 x λ 2 x λ r x Then, the symmetric operators Lx, Lx 2 and 4

5 Qx have the spectral decompositions: Lx = Lx 2 = Qx = r λ j xc jj x + j=1 r λ 2 j xc jjx + j=1 r λ 2 jxc jj x + j=1 1 j<l r 1 j<l r 1 j<l r 1 2 λ jx + λ l xc jl x, 1 2 λ2 j x + λ2 l xc jlx, λ j xλ l xc jl x Moreover, the spectra σlx, σlx 2 and σqx, respectively, consist of all distinct numbers 1 2 λ jx + λ l x, 1 2 λ2 j x + λ2 l x, and λ jxλ l x for all j,l {1,2,,r} In the end of this subsection, we characterize a cone K I see 25 below with respect to x, which plays a key role in establishing the connection between B Π K x and B Π KI 0 see Theorem 33 Let x = r j=1 λ jxc j = r i=1 µ ixb i with λ 1 x λ 2 x λ r x and µ 1 x > µ 2 x > > µ r x In what follows, let ℵx := {i : λ i x < 0}, Ix := {i : λ i x = 0} and x := {i : λ i x > 0} For the sake of simplicity, let ℵ := ℵx, I := Ix and := x Thus ℵ I = {1,2,,r} Set b I := j Ic j By Theorem 21 and the argument after Theorem 22, b I = b i where the subscript i is specified by µ i x = 0 It follows that b I is uniquely defined by x In other words, for any Jordan frame { c 1,, c r } Cx, j I c j = b I Therefore, we can define a subspace By Lemma 20 in [7], it follows that J I := Jb I,1 := {w J : w b I = w} J I = span { c +1,c +2,,c + I } + +1 j<k + I Then we can verify by direct calculation that J I is also a Euclidean Jordan algebra with its identity element b I Observe that b I := j I c j and {c j : j I} is a complete system of orthogonal idempotents Thus, {c j : j I} forms a Jordan frame in J I and the rank of J I is I This leads us to define the cone of its squares as J jk K I := {w 2 : w J I } 25 Therefore, it is well-defined that Π KI : J I J I is the projection onto the symmetric cone K I We can also define a cone by the finite set {c j : j I} Thus, we arrive at another cone associated with x, denoted by Kx,0 := Cone{c j : j I} 26 {c 1,,c r} Cx An interesting question occurs: what is the difference between the cones K I and Kx,0? Clearly, when x = 0, K I = K0,0= K The following proposition states that they are always equal to each other 5

6 Proposition 25 Let x = r j=1 λ jxc j with λ 1 x λ 2 x λ r x and b I = j I c j Let K I and Kx,0 be defined by 25 and 26, respectively Then we have K I = Kx,0 = Cone{c j : j I} 27 {c 1,,c r} Cx and b I is the identity element in the above symmetric cone Proof It is clear that Kx,0 K I and b I is the identity element in K I We now prove K I Kx,0 Let y K I Then, by the argument before 25, there exists a Jordan frame in J I, say, {e 1,e 2,,e I }, such that y = y 1 e 1 +y 2 e 2 + +y I e I with y i 0 Clearly, elements e 1,e 2,,e I belong to K and their sum is b I We next show that, for any Jordan frame {c i : i {1,,r}} Cx, we can replace {c +1,,c + I } by {e 1,,e I } to get an element in Cx; Ie, In fact, by the above definitions, we have {c 1,,c,e 1,,e I,c + I +1,,c r } Cx 28 c k b I = 0, for all k {1,,, + I + 1,,r} Then c k,b I = 0 By b I = e e I, it follows that c k,b I = I i=1 c k,e i = 0 Since c k,e i K, c k,e i 0 It then follows c k,e i = 0 By Proposition 6 in [7], we have c k e i = 0, for all k {1,,, + I + 1,,r}, i {1,, I } This proves 28 Then Cone{e j : j {1,, I }} Kx,0, and therefore y Kx,0 The above proof yields the following interesting fact which is a decomposition result on Jordan frames determined by x Proposition 26 Let x = r j=1 λ jxc j = r i=1 µ ixb i Then for any Jordan frame {c 1,,c r } in Cx, the set {c j : λ j x = µ i x} is a Jordan frame in Jb i,1, and a Jordan frame in each Jb i,1 i {1,, r}, say, C bi, is a subset of some Jordan frame in Cx Moreover, the union of C b1,,c b r forms a Jordan frame in Cx 22 Matrix Representation of Gx Let Gx be given by 22 Suppose that g is differentiable at τ i,i {1,2,,r} Define the first divided difference g [1] of g at τ := τ 1,τ 2,,τ r T R r as the r r symmetric matrix with the ij-th entry g [1] τ ij i,j {1,2,,r} given by [τ i,τ j ] g := gτ i gτ j τ i τ j if τ i τ j, g τ i if τ i = τ j Based on Theorem 32 of [19], Kong, Sun and Xiu [11] introduced the following Jacobian properties of the Löwner operator G Theorem 27 Theorem 28 of [11] Let x = r j=1 λ jxc j = r i=1 µ ixb i x Then, G is continuously differentiable at x if and only if for each j {1,2,,r}, g is continuously differentiable at λ j x In this case, the Jacobian Gx is given by Gx = 2 r [λ i x,λ j x] g Lc i Lc j i,j=1 6 r g λ i xlc i, 29 i=1

7 or equivalently Gx = 2 r i j,i,j=1 [µ i x,µ j x] g Lb i xlb j x + Furthermore, Gx is a symmetric linear operator from J into itself r i=1 g µ i xqb i x 210 Suppose that Löwner operator G is continuously differentiable at x = r j=1 λ jxc j with λ 1 x λ 2 x λ r x For a given Jordan frame {c 1,c 2,,c r }, let L := Lc 1 Lc r be an operator vector with respect to {c 1,c 2,,c r } Denote L := L c 1,, L c r, where L c i is the adjoint operator of Lc i Since Lc i is self-adjoint, we have L = L c 1,, L c r = Lc 1,, Lc r For the real r r matrix Λx := [λ i x,λ j x] g r r, we define L ΛxL := r [λ i x,λ j x] g Lc i Lc j i,j=1 Similarly, for the r-vector dx = g λ 1 x,,g λ r x T, define d xl := r g λ i xlc i Thus, by 29, we can give a matrix representation of the Jacobian Gx as follows: i=1 Gx = 2L ΛxL d xl 211 In particular, consider the metric projection Π K at x = r j=1 λ jxc j Note that t = 0 is the unique point where g = t + is not smooth but strongly semismooth Thus if I = Ø, ie, x is nonsingular, Π K is continuously differentiable at x In this case, from 211, we write Π K x as Π K x = 2L ΛxL d xl where Λx is a symmetric matrix of the form E Γ Λx = Γ T 0 ℵ ℵ with E being the all ones matrix, the ℵ matrix Γ = and the vector dx = matrix λ i x λ i x λ j x 212 ℵ, 1 T,0T ℵ T Throughout this paper, En1 n 2 denotes the n 1 n 2 all ones 7

8 3 Clarke Generalized Jacobian of Π K This section deals with the Clarke generalized Jacobian of Π K This is influenced by the recent work [8, 9, 12] in the special settings of second-order cones and positive semi-definite cones, where Kanzow, Ferenczi and Fukushima [9] gave an expression for the B-subdifferential of the projection onto second-order cones, Hayashi, Yamashita and Fukushima [8] gave an explicit representation for Clarke generalized Jacobian of the projection onto second-order cones; Malick and Sendov [12] worked out the Clarke generalized Jacobian of the projection onto the cone of symmetric positive semi-definite matrices We generalize the above results to symmetric cones For this purpose, we mainly look at the B-subdifferential of Π K First, we establish our notation For a given Jordan frame {c 1,c 2,,c r }, we define { {c 1,,c r} B Π K x := lim Π K x + h : h span{c 1,c 2,,c r }, lim Π K x + h exists h 0,x+h D ΠK h 0 For a given integer t {0,1,, I } we define a r-vector d t x by 1 d t x := 1 t 0 I t = 1 +t, 31 0 r t 0 ℵ } and a set of r r matrices Λ t x by E E I Γ ℵ Λ t x := E I Λ 0 0 I ℵ E Λ00 : Λ 0 = Γ T Λ ℵ 0 ℵ I 0 T 00 0 ℵ ℵ,Λ 00 Λt, I, 32 λ where Γ ℵ is a given matrix by the ij-entry Γ ij = i x λ i x λ j x i,j ℵ, and Λt, I is a set of t I t matrices θ ij t I t the rows are indexed by + 1, + 2,, + t, and the columns by + t + 1, + t + 2,, + I specified by { } Λt, I := θ ij t I t [0,1] t I t : θ ij satisfy a and b below a θ i, +t+1 θ i, +t+2 θ i, + I i { + 1, + 2,, + t}, θ +1,j θ +2,j θ +t,j j { + t + 1, + t + 2,, + I }; b 1 θ ij 1 is a matrix of rank at most one t I t Clearly, when x = 0, we have a r-vector and a set of r r matrices Λ t 0 := Λ t := d t 0 := d t := 1t 0 r t, 33 { } Et t Λ t r t Λ T : Λ t r t 0 t r t Λt,r, 34 r t r t where Λt,r is a set of t r t matrices θ ij t r t the rows are indexed by 1,2,,t, and the columns by t + 1,t + 2,,r specified by { } Λt,r := θ ij t r t [0,1] t r t : θ ij satisfy a and b below 8

9 a θ i,t+1 θ i,t+2 θ i,r i {1,2,,t}, θ 1j θ 2j θ tj j {t + 1,t + 2,,r}; b 1 θ ij 1 is a matrix of rank at most one t r t We are now ready to give the formula for the Clarke generalized Jacobian of Π K x by its B-subdifferential Our next result generalizes Lemma 26 of [9] for B-subdifferential, Theorem 37 of [12] and Proposition 48 of [8] for Clarke generalized Jacobian Theorem 31 The B-subdifferential of Π K at x is given by B Π K x = I {c 1,,c r} Cx t=0 {2L Λ t xl d t xl} where d t x and Λ t x are specified by 31 and 32, respectively Furthermore, the Clarke generalized Jacobian of Π K at x is I Π K x = conv { B Π K x} = conv {2L Λ t xl d txl} {c 1,,c r} Cx t=0 Proof First we prove B Π K x I {c 1,,c r} Cx t=0 {2L Λ t xl d txl} Without loss of generality, fix a Jordan frame {c 1,,c r } Cx For any arbitrary but given integer t {0,1,, I }, set V := 2L A t xl d txl where A t x Λ t x and d t x is given by 31 We need only to show that V B Π K x For this purpose, it suffices to demonstrate that there exists a vector h = r i=1 λ ihc i such that V = lim Π K x + h h 0,x+h D ΠK Let A t x = θ ij r r We define ς ij := 1 θ ij 1 for i { + 1,, + t} and j { + t + 1,, + I }, then B t I t := ς ij t I t can be written as B t I t = π +1 π +t π +t+1,,π + I, where π i [0,+ ], π +1 π +2 π +t and π +t+1 π +t+2 π + I Taking 0 if 1 i, ρ if π i = 0, < i + t, 1 π i ρ 2 if π i 0,+, < i + t, ρ 3 if π i = +, < i + t, λ i h = ρ 3 if π i = 0, + t < i + I, π i ρ 2 ρ if π i 0,+, + t < i + I, if π i = +, + t < i + I, 0 if + I < i r, 9

10 we have x + h = r i=1 λ ix + hc i = r i=1 [λ ix + λ i h]c i and for sufficiently small ρ 0,1, λ 1 x + h λ +t x + h > 0 > λ +t+1 x + h λ r x + h It is easy to verify that x + h D ΠK and Hence V B Π K x lim Π Kx + h = 2L A t xl d t xl h 0 We next prove that B Π K x r {c 1,,c r} Cx t=0 {2L Λ t xl d txl} Let W B Π K x Then there is a vector h := hw J such that W = lim h 0,x+h DΠK Π K x + h For the above h J, let x + h =: r j=1 λ jx + hc j x + h with λ 1 x + h λ 2 x + h λ r x + h In the sense of set convergence see [17], we have lim sup {c 1 x + h,,c r x + h} Cx h 0,x+h D Πk Let us pick {c 1,,c r } lim sup{c 1 x + h,,c r x + h} Clearly, lim h 0,x+h D Πk λx + h = λx, where λx + h := λ 1 x + h,,λ r x + h T and none of λ i x + h is zero Suppose that T ℵx + h, x + h are given and t := x + h Then d t x = 1 T +t r t,0t Set Λ t x + h := E E I Γ ℵ h E I Λ 0 I ℵ Γ T ℵ h 0 ℵ I 0 ℵ ℵ with Λ Et t Λ12 := Λ T, 12 0 ℵ t ℵ t λ where Γ ℵ h = i x+h λ i x+h λ j x+h i,j ℵ and Λ 12 = Λ ij with Λ ij = ℵ t I t λ i x+h λ i x+h λ j x+h i { + 1,, + t}, j { + t + 1,, + I } If lim h 0 Λ 12 exists, then direct calculation yields Θ t x := lim h 0 Λ t x+h = E E I Γ ℵ E I Λ 0 I ℵ Γ T ℵ 0 ℵ I 0 ℵ ℵ Et t Λ with Λ = 12 Λ T 12 0 ℵ t ℵ t where Λ := lim h 0 Λ and λ Λ12 := lim h 0 Λ12 = θ ij t I t with θ ij = lim i x+h h 0 λ i x+h λ j x+h i { + 1,, + t}, j { + t + 1,, + I } Observing that and λ +1 h λ +2 h λ +t h > 0 0 < λ +t+1 h λ +t+2 h λ + I h, we easily show θ ij [0,1] and a In order to prove b, let ς ij := lim h 0 λ j x + h λ i x + h, 10

11 for i { + 1,, + t}, j { + t + 1,, + I } Then, θ ij = ς ij or equivalently ς ij = 1 θ ij 1 35 Note that θ ij [0,1] implies ς ij [0,+ ] and θ ij = 0 ς ij =, θ ij = 1 ς ij = 0 Define B := ς ij t I t Then, it is easy to see that B = lim h 0 1 λ +1 h 1 λ +t h λ +t+1 h,, λ + I h This establishes b, and hence Θ t x Λ t x The existence of lim h 0,x+h DΠK Π K x + h means that lim h 0 Λ12 h exists This proves W = 2L Θ t xl d t xl {2L Λ t xl d t xl}, as desired From the above proof, we also obtain that for a given Jordan frame {c 1,c 2,,c r } Cx {c 1,,c r} B Π K x = I {2L Λ t xl d txl} t=0 Note that when x = 0 the above result becomes the following, which provides a formula for B-subdifferential of the projection onto symmetric cone Π K at the origin Corollary 32 The B-subdifferential of Π K at 0 is B Π K 0 = {c 1,,c r} C0 t=0 r {2L Λ t L d t L}, where d t and Λ t are given by 33 and 34, respectively Furthermore, the Clarke generalized Jacobian of Π K at 0 is r Π K 0 = conv B Π K 0 = conv {2L Λ t L d t L} In general, B Π K 0 Π K 0 {c 1,,c r} C0 t=0 Proof We only need show that B Π K 0 Π K 0 in general For this purpose, we look at an example in the case of the second-order cone Λ n + := {x 1,x T 2 T : x 1 x 2,x 1 R,x 2 R n 1 } n 2 Let {c 1,c 2 } be a Jordan frame given by c i = i 1 ω, for i {1,2}, with ω being any vector in R n 1 satisfying ω = 1 By direct calculation, we can derive that B Π Λ n + 0 = {0, I, T } and Π Λ n + 0 = conv{0, I, T } where T satisfies T = 4[0,1]Lc 1 Lc 2 + Qc Qc 2 This means that B Π K 0 Π K 0 in general 11

12 Applying Proposition 25, Theorem 31 and Corollary 32, we immediately obtain the following result, which states the interesting connection between B Π K xrespectively, Π K x and B Π KI 0respectively, Π KI 0 In the case of S n, it reduces to Proposition 22 in [18] Theorem 33 Let x = r i=1 λ ixc i with λ 1 x λ 2 x λ r x Then V B Π K x respectively, V Π K x if and only if there exists a V I B Π KI 0 respectively, V I Π KI 0 such that V = W + V I, where W is independent on the Jordan frame {c 1,,c r } and specified by W = Q c i + 4L c i L c i + 4 λ i x λ i i i x λ j x Lc ilc j i I i,j ℵ Proof Let x = r i=1 λ ixc i = r i=1 µ ixb i with λ 1 x λ 2 x λ r x and µ 1 x > µ 2 x > > µ r x, and set {c 1,,c r } =: {c,c I,c ℵ } with c := { } { } c 1,,c, ci := c +1,,c + I and cℵ := { } c + I +1,,c r By Proposition 25, any Jordan frame in JI is a subset of a Jordan frame in Cx, and the part c I of a Jordan frame {c,,c r } in Cx is a Jordan frame in J I Let L L = L I L ℵ, where L := Lc 1 Lc, L I := Lc +1 Lc + I, L ℵ := Lc + I +1 Lc r It therefore follows immediately from Theorem 31 and Corollary 32 that V B Π K x if and only if there exists a V I B Π KI 0 such that V = 2L A t xl d t xl, V I = 2L I At, I L I d t L I, where r r matrix A t x Λ t x and I I matrix At, I Λt, I satisfy and r-vector d t x and I -vector d t satisfy E E I Γ ℵ A t x = E I At, I 0 I ℵ ; Γ T ℵ 0 ℵ I 0 ℵ ℵ d t x = 1 T,dT t,0 ℵ T By the symmetry of Lx and A t x, direct calculation yields V = 2L A t xl d txl = 2L E L + 4L E I L I + 4L Γ ℵ L ℵ + 2L I At, I L I d txl = 2L E L 1 T L + 4L E I L I + 4L Γ ℵ L ℵ 12

13 = + 2L I At, I d t L I 2 Lc i + 4 Lc i Lc j i,j i i,j I +4 λ i x λ i x λ j x Lc ilc j + V I i,j ℵ = Q c i + 4L c i L c i + 4 i i i I Lc i Lc j i,j ℵ λ i x λ i x λ j x Lc ilc j + V I This implies that V B Π K x if and only if there is a V I B Π KI 0 such that where W is given as W := Q i c i + 4L i c i V = W + V I, L c i + 4 i I i,j ℵ λ i x λ i x λ j x Lc ilc j Observe the following equations c i = b i, i i {i:µ i >0} c i = b i, i I i {i:µ i =0} and i,j ℵ λ i x λ i x λ j x Lc ilc j = i {i:µ i >0},j {i:µ i <0} µ i x µ i x µ j x Lb ilb j From the fact above and the uniqueness of b i by Theorem 21, we obtain that W is unique and independent on the Jordan frame {c 1,,c r } By the definition of Clarke generalized Jacobian, it holds that V Π K x if and only if there is a V I Π KI 0 such that V = W + V I We complete the proof 4 B-subdifferentials of x and x Employing the same technique as in the proof of Theorem 31, we give below the formulae for the B-subdifferentials of x and x Theorem 41 Let ē be the all ones vector of appropriate size The B-subdifferential of x is given by I B x = {2L E r r Λ t xl ē d t x L}, {c 1,,c r} Cx t=0 where d t x and Λ t x are specified by 31 and 32, respectively Furthermore, B x = I B Π K x 13

14 Proof Note that for any pair of scalars τ i,τ j, τ i τ j τ i τ j + τ i + τ j + τ i τ j = 1 or τ i τ j τ i τ j = 1 τ i + τ j + τ i τ j In a similar way as in Theorem 31, we obtain the formula for the B-subdifferential of x Before studying the B-subdifferential of at x, we need the following notation For a given integer t {0,1,, I } we define a r-vector t x by 1 t x := 1 t 1 I t = 1 +t, 41 1 r t 1 ℵ and a set of r r matrices Å t x by Å t x := E E I Υ ℵ E I Υ 0 E I ℵ Υ T ℵ E ℵ I E ℵ ℵ : Υ 0 = E1 Υ 00 Υ T 00 E 2,Υ 00 Υt, I, 42 where E 1 = E t t,e 2 = E I t I t, Υ ℵ is a given matrix with the ij-entry Υ ij = λ i x+λ j x λ i x λ j x i,j ℵ, and Υt, I is a set of t I t matrices ξ ij t I t the rows are indexed by +1, +2,, +t, and the columns by +t+1, +t+2,, + I specified by Υt, I := { } ξ ij t I t [ 1,1] t I t : ξ ij satisfy c and d below, c ξ i, +t+1 ξ i, +t+2 ξ i, + I i = + 1, + 2,, + t, ξ +1,j ξ +2,j ξ +t,j j = + t + 1, + t + 2,, + I ; 1 ξij d 1+ξ ij is a matrix of rank at most one t I t We are in a position to give a formula for the B-subdifferential of x Theorem 42 The B-subdifferential of x is given by B x = I {c 1,,c r} Cx t=0 {2L Å t xl t xl}, where t x and Å t x are specified by 41 and 42, respectively Proof Note that for any pair of scalars τ i > τ j, τ i τ j τ i τ j = In the case of τ i > 0 > τ j, set ξ ij := τ i+τ j τ i τ j Then 1 if τ i > τ j 0, τ i +τ j τ i τ j if τ i > 0 > τ j, 1 if τ i 0 > τ j ξ ij = 1 τ j τ i 1 + τ, or equivalently τ j j τ τ i i 14 = 1 ξ ij 1 + ξ ij

15 This implies that τ j [0,+ ] ξ ij [ 1,1] τ i Based on the above fact and a similar argument as in the proof of Theorem 31, we deduce the claimed identity Note that B x B x + + B x and B x B x + B x, although x = x + + x and x = x + x, respectively For instance, in the case of J = R, it is easy to derive B x + = B x = {0,1}, B x = 1 and B x = { 1,1} However, B x + + B x = {0,1,2} and B x + B x = { 1,0,1} Acknowledgments The work was partly supported by a Discovery Grant from NSERC, and the National Natural Science Foundation of China , References [1] Bauschke, HH, Borwein, JM: On projection algorithms for solving convex feasibility problems SIAM Rev 38, [2] Chen, J-S, Chen, X, Tseng, P: Analysis of nonsmooth vector-valued functions associated with second-order cones Math Program 101, [3] Chen, XD, Sun, D, Sun, J: Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems Comput Optim Appl 25, [4] Clarke, FH: Optimization and Nonsmooth Analysis Wiley, New York 1983 [5] Facchinei, F, Pang, J-S: Finite-Dimensional Variational Inequalities and Complementarity Problems, Volume I and II Springer-Verlag, New York 2003 [6] Faraut, J, Korányi, A: Analysis on Symmetric Cones Oxford University Press, New York 1994 [7] Gowda, MS, Sznajder, R, Tao, J: Some P-properties for linear transformations on Euclidean Jordan algebras Linear Algebra Appl 393, [8] Hayashi, S, Yamashita, N, Fukushima, M: A combined smoothing and regularization method for monotone second-order cone complementarity problems SIAM J Optim 15, [9] Kanzow, C, Ferenczi, I, Fukushima, M: Semismooth Methods for Linear and Nonlinear Second-Order Cone Programs Preprint 264, Institute of Mathematics, University of Würzburg, Würzburg, April 2006 revised January 10, 2007 [10] Koecher, M: The Minnesota Notes on Jordan Algebras and Their Applications, edited and annotated by A Brieg and S Walcher, Springer, Berlin, 1999 [11] Kong, LC, Sun, J, Xiu, NH: A regularized smoothing Newton method for symmetric cone complementarity problems SIAM J Optim 19,

16 [12] Malick, J, Sendov, HS: Clarke generalized Jacobian of the projection onto the cone of positive semidefinite matrices Set-Valued Analysis 14, [13] Meng, F, Sun, D, Zhao, G: Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization Math Program 104, [14] Mifflin, R: Semismooth and semiconvex functions in constrained optimization SIAM J Cont Optim 15, [15] Pang, J-S, Qi, L: Nonsmooth equations: motivation and algorithms SIAM J Optim 3, [16] Qi, L, Sun, J: A nonsmooth version of Newton s method Math Program 58, [17] Rockafellar, RT, Wets, RJ-B: Variational Analysis Springer, Second Version 2004 [18] Sun, D: The strong second order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications Math Oper Res 31, [19] Sun, D, Sun, J: Löwner s operator and spectral functions on Euclidean Jordan algebras Math Oper Res 33,

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

Fischer-Burmeister Complementarity Function on Euclidean Jordan Algebras

Fischer-Burmeister Complementarity Function on Euclidean Jordan Algebras 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

More information

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

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

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

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

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

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

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

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

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

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

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

ON A CLASS OF NONSMOOTH COMPOSITE FUNCTIONS

ON A CLASS OF NONSMOOTH COMPOSITE FUNCTIONS MATHEMATICS OF OPERATIONS RESEARCH Vol. 28, No. 4, November 2003, pp. 677 692 Printed in U.S.A. ON A CLASS OF NONSMOOTH COMPOSITE FUNCTIONS ALEXANDER SHAPIRO We discuss in this paper a class of nonsmooth

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

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

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

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

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

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

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

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

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

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

The Q Method for Symmetric Cone Programming

The Q Method for Symmetric Cone Programming The Q Method for Symmetric Cone Programming Farid Alizadeh Yu Xia October 5, 010 Communicated by F. Potra Abstract The Q method of semidefinite programming, developed by Alizadeh, Haeberly and Overton,

More information

Mathematics Department Stanford University Math 61CM/DM Inner products

Mathematics Department Stanford University Math 61CM/DM Inner products Mathematics Department Stanford University Math 61CM/DM Inner products Recall the definition of an inner product space; see Appendix A.8 of the textbook. Definition 1 An inner product space V is a vector

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

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

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

Convex Feasibility Problems

Convex Feasibility Problems Laureate Prof. Jonathan Borwein with Matthew Tam http://carma.newcastle.edu.au/drmethods/paseky.html Spring School on Variational Analysis VI Paseky nad Jizerou, April 19 25, 2015 Last Revised: May 6,

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

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 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

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

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

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

Some characterizations for SOC-monotone and SOC-convex functions

Some characterizations for SOC-monotone and SOC-convex functions J Glob Optim 009 45:59 79 DOI 0.007/s0898-008-9373-z Some characterizations for SOC-monotone and SOC-convex functions Jein-Shan Chen Xin Chen Shaohua Pan Jiawei Zhang Received: 9 June 007 / Accepted: October

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

Elementary linear algebra

Elementary linear algebra Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The

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

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

Identifying Active Constraints via Partial Smoothness and Prox-Regularity

Identifying Active Constraints via Partial Smoothness and Prox-Regularity Journal of Convex Analysis Volume 11 (2004), No. 2, 251 266 Identifying Active Constraints via Partial Smoothness and Prox-Regularity W. L. Hare Department of Mathematics, Simon Fraser University, Burnaby,

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

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

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

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

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

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

CHAPTER 3 Further properties of splines and B-splines

CHAPTER 3 Further properties of splines and B-splines CHAPTER 3 Further properties of splines and B-splines In Chapter 2 we established some of the most elementary properties of B-splines. In this chapter our focus is on the question What kind of functions

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

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

Some Properties of the Augmented Lagrangian in Cone Constrained Optimization

Some Properties of the Augmented Lagrangian in Cone Constrained Optimization MATHEMATICS OF OPERATIONS RESEARCH Vol. 29, No. 3, August 2004, pp. 479 491 issn 0364-765X eissn 1526-5471 04 2903 0479 informs doi 10.1287/moor.1040.0103 2004 INFORMS Some Properties of the Augmented

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

Chapter 1. Preliminaries

Chapter 1. Preliminaries Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between

More information

A convergence result for an Outer Approximation Scheme

A convergence result for an Outer Approximation Scheme A convergence result for an Outer Approximation Scheme R. S. Burachik Engenharia de Sistemas e Computação, COPPE-UFRJ, CP 68511, Rio de Janeiro, RJ, CEP 21941-972, Brazil regi@cos.ufrj.br J. O. Lopes Departamento

More information

Linear Algebra Massoud Malek

Linear Algebra Massoud Malek CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product

More information

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra. DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1

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

AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES

AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim

More information

A Primal-Dual Second-Order Cone Approximations Algorithm For Symmetric Cone Programming

A Primal-Dual Second-Order Cone Approximations Algorithm For Symmetric Cone Programming A Primal-Dual Second-Order Cone Approximations Algorithm For Symmetric Cone Programming Chek Beng Chua Abstract This paper presents the new concept of second-order cone approximations for convex conic

More information

Optimality, identifiability, and sensitivity

Optimality, identifiability, and sensitivity Noname manuscript No. (will be inserted by the editor) Optimality, identifiability, and sensitivity D. Drusvyatskiy A. S. Lewis Received: date / Accepted: date Abstract Around a solution of an optimization

More information

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces. Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,

More information

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator

More information

A Regularized Directional Derivative-Based Newton Method for Inverse Singular Value Problems

A Regularized Directional Derivative-Based Newton Method for Inverse Singular Value Problems A Regularized Directional Derivative-Based Newton Method for Inverse Singular Value Problems Wei Ma Zheng-Jian Bai September 18, 2012 Abstract In this paper, we give a regularized directional derivative-based

More information

Finite Convergence for Feasible Solution Sequence of Variational Inequality Problems

Finite Convergence for Feasible Solution Sequence of Variational Inequality Problems Mathematical and Computational Applications Article Finite Convergence for Feasible Solution Sequence of Variational Inequality Problems Wenling Zhao *, Ruyu Wang and Hongxiang Zhang School of Science,

More information

Optimization and Optimal Control in Banach Spaces

Optimization and Optimal Control in Banach Spaces Optimization and Optimal Control in Banach Spaces Bernhard Schmitzer October 19, 2017 1 Convex non-smooth optimization with proximal operators Remark 1.1 (Motivation). Convex optimization: easier to solve,

More information

Subdifferential representation of convex functions: refinements and applications

Subdifferential representation of convex functions: refinements and applications Subdifferential representation of convex functions: refinements and applications Joël Benoist & Aris Daniilidis Abstract Every lower semicontinuous convex function can be represented through its subdifferential

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

AN EQUIVALENCY CONDITION OF NONSINGULARITY IN NONLINEAR SEMIDEFINITE PROGRAMMING

AN EQUIVALENCY CONDITION OF NONSINGULARITY IN NONLINEAR SEMIDEFINITE PROGRAMMING J Syst Sci Complex (2010) 23: 822 829 AN EQUVALENCY CONDTON OF NONSNGULARTY N NONLNEAR SEMDEFNTE PROGRAMMNG Chengjin L Wenyu SUN Raimundo J. B. de SAMPAO DO: 10.1007/s11424-010-8057-1 Received: 2 February

More information

Lecture Notes 1: Vector spaces

Lecture Notes 1: Vector spaces Optimization-based data analysis Fall 2017 Lecture Notes 1: Vector spaces In this chapter we review certain basic concepts of linear algebra, highlighting their application to signal processing. 1 Vector

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

ENTANGLED STATES ARISING FROM INDECOMPOSABLE POSITIVE LINEAR MAPS. 1. Introduction

ENTANGLED STATES ARISING FROM INDECOMPOSABLE POSITIVE LINEAR MAPS. 1. Introduction Trends in Mathematics Information Center for Mathematical Sciences Volume 6, Number 2, December, 2003, Pages 83 91 ENTANGLED STATES ARISING FROM INDECOMPOSABLE POSITIVE LINEAR MAPS SEUNG-HYEOK KYE Abstract.

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

First-order optimality conditions for mathematical programs with second-order cone complementarity constraints

First-order optimality conditions for mathematical programs with second-order cone complementarity constraints First-order optimality conditions for mathematical programs with second-order cone complementarity constraints Jane J. Ye Jinchuan Zhou Abstract In this paper we consider a mathematical program with second-order

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

Energy method for wave equations

Energy method for wave equations Energy method for wave equations Willie Wong Based on commit 5dfb7e5 of 2017-11-06 13:29 Abstract We give an elementary discussion of the energy method (and particularly the vector field method) in the

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

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation

More information

McMaster University. Advanced Optimization Laboratory. Title: A Proximal Method for Identifying Active Manifolds. Authors: Warren L.

McMaster University. Advanced Optimization Laboratory. Title: A Proximal Method for Identifying Active Manifolds. Authors: Warren L. McMaster University Advanced Optimization Laboratory Title: A Proximal Method for Identifying Active Manifolds Authors: Warren L. Hare AdvOl-Report No. 2006/07 April 2006, Hamilton, Ontario, Canada A Proximal

More information

On Second-order Properties of the Moreau-Yosida Regularization for Constrained Nonsmooth Convex Programs

On Second-order Properties of the Moreau-Yosida Regularization for Constrained Nonsmooth Convex Programs On Second-order Properties of the Moreau-Yosida Regularization for Constrained Nonsmooth Convex Programs Fanwen Meng,2 ; Gongyun Zhao Department of Mathematics National University of Singapore 2 Science

More information

October 25, 2013 INNER PRODUCT SPACES

October 25, 2013 INNER PRODUCT SPACES October 25, 2013 INNER PRODUCT SPACES RODICA D. COSTIN Contents 1. Inner product 2 1.1. Inner product 2 1.2. Inner product spaces 4 2. Orthogonal bases 5 2.1. Existence of an orthogonal basis 7 2.2. Orthogonal

More information

The following definition is fundamental.

The following definition is fundamental. 1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic

More information

Local strong convexity and local Lipschitz continuity of the gradient of convex functions

Local strong convexity and local Lipschitz continuity of the gradient of convex functions Local strong convexity and local Lipschitz continuity of the gradient of convex functions R. Goebel and R.T. Rockafellar May 23, 2007 Abstract. Given a pair of convex conjugate functions f and f, we investigate

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

c 2000 Society for Industrial and Applied Mathematics

c 2000 Society for Industrial and Applied Mathematics SIAM J. OPIM. Vol. 10, No. 3, pp. 750 778 c 2000 Society for Industrial and Applied Mathematics CONES OF MARICES AND SUCCESSIVE CONVEX RELAXAIONS OF NONCONVEX SES MASAKAZU KOJIMA AND LEVEN UNÇEL Abstract.

More information

On the convexity of piecewise-defined functions

On the convexity of piecewise-defined functions On the convexity of piecewise-defined functions arxiv:1408.3771v1 [math.ca] 16 Aug 2014 Heinz H. Bauschke, Yves Lucet, and Hung M. Phan August 16, 2014 Abstract Functions that are piecewise defined are

More information

ON REGULARITY CONDITIONS FOR COMPLEMENTARITY PROBLEMS

ON REGULARITY CONDITIONS FOR COMPLEMENTARITY PROBLEMS ON REGULARITY CONDITIONS FOR COMPLEMENTARITY PROBLEMS A. F. Izmailov and A. S. Kurennoy December 011 ABSTRACT In the context of mixed complementarity problems various concepts of solution regularity are

More information

Monotone operators and bigger conjugate functions

Monotone operators and bigger conjugate functions Monotone operators and bigger conjugate functions Heinz H. Bauschke, Jonathan M. Borwein, Xianfu Wang, and Liangjin Yao August 12, 2011 Abstract We study a question posed by Stephen Simons in his 2008

More information

GROUP THEORY PRIMER. New terms: so(2n), so(2n+1), symplectic algebra sp(2n)

GROUP THEORY PRIMER. New terms: so(2n), so(2n+1), symplectic algebra sp(2n) GROUP THEORY PRIMER New terms: so(2n), so(2n+1), symplectic algebra sp(2n) 1. Some examples of semi-simple Lie algebras In the previous chapter, we developed the idea of understanding semi-simple Lie algebras

More information

Mathematical Optimisation, Chpt 2: Linear Equations and inequalities

Mathematical Optimisation, Chpt 2: Linear Equations and inequalities Mathematical Optimisation, Chpt 2: Linear Equations and inequalities Peter J.C. Dickinson p.j.c.dickinson@utwente.nl http://dickinson.website version: 12/02/18 Monday 5th February 2018 Peter J.C. Dickinson

More information

Math Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88

Math Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88 Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant

More information

Journal of Inequalities in Pure and Applied Mathematics

Journal of Inequalities in Pure and Applied Mathematics Journal of Inequalities in Pure and Applied Mathematics MONOTONE TRAJECTORIES OF DYNAMICAL SYSTEMS AND CLARKE S GENERALIZED JACOBIAN GIOVANNI P. CRESPI AND MATTEO ROCCA Université de la Vallée d Aoste

More information

LINEAR ALGEBRA REVIEW

LINEAR ALGEBRA REVIEW LINEAR ALGEBRA REVIEW JC Stuff you should know for the exam. 1. Basics on vector spaces (1) F n is the set of all n-tuples (a 1,... a n ) with a i F. It forms a VS with the operations of + and scalar multiplication

More information

Iterative Solution of a Matrix Riccati Equation Arising in Stochastic Control

Iterative Solution of a Matrix Riccati Equation Arising in Stochastic Control Iterative Solution of a Matrix Riccati Equation Arising in Stochastic Control Chun-Hua Guo Dedicated to Peter Lancaster on the occasion of his 70th birthday We consider iterative methods for finding the

More information

ECS130 Scientific Computing. Lecture 1: Introduction. Monday, January 7, 10:00 10:50 am

ECS130 Scientific Computing. Lecture 1: Introduction. Monday, January 7, 10:00 10:50 am ECS130 Scientific Computing Lecture 1: Introduction Monday, January 7, 10:00 10:50 am About Course: ECS130 Scientific Computing Professor: Zhaojun Bai Webpage: http://web.cs.ucdavis.edu/~bai/ecs130/ Today

More information

A Proximal Method for Identifying Active Manifolds

A Proximal Method for Identifying Active Manifolds A Proximal Method for Identifying Active Manifolds W.L. Hare April 18, 2006 Abstract The minimization of an objective function over a constraint set can often be simplified if the active manifold of the

More information

Lecture 7 Monotonicity. September 21, 2008

Lecture 7 Monotonicity. September 21, 2008 Lecture 7 Monotonicity September 21, 2008 Outline Introduce several monotonicity properties of vector functions Are satisfied immediately by gradient maps of convex functions In a sense, role of monotonicity

More information

SOS TENSOR DECOMPOSITION: THEORY AND APPLICATIONS

SOS TENSOR DECOMPOSITION: THEORY AND APPLICATIONS SOS TENSOR DECOMPOSITION: THEORY AND APPLICATIONS HAIBIN CHEN, GUOYIN LI, AND LIQUN QI Abstract. In this paper, we examine structured tensors which have sum-of-squares (SOS) tensor decomposition, and study

More information