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

Size: px
Start display at page:

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

Transcription

1 Linear and Nonlinear Analysis Volume 3, Number 3, 07, EXAMPLES OF r-convex FUNCTIONS AND CHARACTERIZATIONS OF r-convex FUNCTIONS ASSOCIATED WITH SECOND-ORDER CONE CHIEN-HAO HUANG, HONG-LIN HUANG, AND JEIN-SHAN CHEN Abstract. In this paper, we revisit the concept of r-convex functions which were studied in 970s. We present several novel examples of r-convex functions that are new to the existing literature. In particular, for any given r, we show examples which are r-convex functions. In addition, we extend the concepts of r-convexity and quasi-convexity to the setting associated with second-order cone. Characterizations about such new functions are established. These generalizations will be useful in dealing with optimization problems involved in second-order cones.. Introduction It is known that the concept of convexity plays a central role in many applications including mathematical economics, engineering, management science, and optimization theory. Moreover, much attention has been paid to its generalization, to the associated generalization of the results previously developed for the classical convexity, and to the discovery of necessary and/or sufficient conditions for a function to have generalized convexities. Some of the known extensions are quasiconvex functions, r-convex functions [, 4], and so-called SOC-convex functions [7, 8]. Other further extensions can be found in [9, 3]. For a single variable continuous, the midpoint-convex function on R is also a convex function. This result was generalized in [] by relaxing continuity to lower-semicontinuity and replacing the number with an arbitrary parameter α 0, ). An analogous consequence was obtained in [8, 3] for quasiconvex functions. To understand the main idea behind r-convex function, we recall some concepts that were independently defined by Martos [7] and Avriel [], and has been studied by the latter author. Indeed, this concept relies on the classical definition of convex functions and some well-known results from analysis dealing with weighted means of positive numbers. Let w = w,..., w m ) R m, q = q,..., q m ) R m be vectors 00 Mathematics Subject Classification. 6A7, 6B05, 90C33. Key words and phrases. r-convex function, monotone function, second-order cone, spectral decomposition. Corresponding author. The author s work is supported by Ministry of Science and Technology, Taiwan.

2 368 C.-H. HUANG, H.-L. HUANG, AND J.-S. CHEN whose components are positive and nonnegative numbers, respectively, such that m i= q i =. Given the vector of weights q, the weighted r-mean of the numbers w,..., w m is defined as below see [3]): m ) /r q i w i ) r if r 0,.) M r w; q) = M r w,..., w m ; q) := i= m w i ) q i if r = 0. It is well-known from [3] that for s > r, there holds.) M s w,..., w m ; q) M r w,..., w m ; q) for all q,..., q m 0 with m i= q i =. The r-convexity is built based on the aforementioned weighted r-mean. For a convex set S R n, a real-valued function f : S R n R is said to be r-convex if, for any x, y S, λ [0, ], q = λ, q = q, q = q, q ), there has { } fq x + q y) ln M r e fx), e fy) ; q). From.), it can be verified that the above inequality is equivalent to { ln[ λ)e.3) f λ)x + λy) rfx) + λe rfy) ] /r if r 0, λ)fx) + λfy) if r = 0. Similarly, f is said to be r-concave on S if the inequality.3) is reversed. It is clear from the above definition that a real-valued function is convex concave) if and only if it is 0-convex 0-concave). Besides, for r < 0 r > 0), an r-convex r-concave) function is called superconvex superconcave); while for r > 0 r < 0), it is called subconvex subconcave). In addition, it can be verified that the r-convexity of f on C with r > 0 r < 0) is equivalent to the convexity concavity) of e rf on S. A function f : S R n R is said to be quasiconvex on S if, for all x, y S, i= f λx + λ)y) max {fx), fy)}, 0 λ. Analogously, f is said to be quasiconcave on S if, for all x, y S, From [3], we know that f λx + λ)y) min {fx), fy)}, 0 λ. lim M rw,..., w m ; q) M w,..., w m ) = max{w,..., w m }, r + lim M rw,, w m ; q) M w,..., w m ) = min{w,, w m }. r Then, it follows from.) that M w,..., w m ) M r w,..., w m ; q) M w,..., w m ) for every real number r. Thus, if f is r-convex on S, it is also + )-convex, that is, fλx + λ)y) max{fx), fy)} for every x, y S and λ [0, ]. Similarly, if f is r-concave on S, it is also )-concave, i.e., fλx + λ)y) min{fx), fy)}.

3 SOC R-CONVEX FUNCTIONS 369 The following review some basic properties regarding r-convex function from [] that will be used in the subsequent analysis. Property.. Let f : S R n R. Then, the followings hold. a) If f is r-convex r-concave) on S, then f is also s-convex s-concave) on S for s > r s < r). b) Suppose that f is twice continuously differentiable on S. For any x, r) S R, we define ϕx, r) = fx) + r fx) fx) T. Then, f is r-convex on S if and only if ϕ is positive semidefinite for all x S. c) Every r-convex r-concave) function on a convex set S is also quasiconvex quasiconcave) on S. d) f is r-convex if and only if f) is r)-concave. e) Let f be r-convex r-concave), α R and k > 0. Then f + α is r-convex r-concave) and k f is r k )-convex r k )-concave). f) Let ϕ, ψ : S R n R be r-convex r-concave) and α, α > 0. Then, the function θ defined by { θx) = ln [ α e rϕx) + α e rψx)] /r if r 0, α ϕx) + α ψx) if r = 0, is also r-convex r-concave). g) Let ϕ : S R n R be r-convex r-concave) such that r 0 r 0) and let the real valued function ψ be nondecreasing s-convex s-concave) on R with s R. Then, the composite function θ = ψ ϕ is also s-convex s-concave). h) ϕ : S R n R is r-convex r-concave) if and only if, for every x, y S, the function ψ given by ψλ) = ϕ λ)x + λy) is an r-convex r-concave) function of λ for 0 λ. i) Let ϕ be a twice continuously differentiable real quasiconvex function on an open convex set S R n. If there exists a real number r satisfying.4) r z T ϕx)z = sup x S, z = [z T ϕx)] whenever z T ϕx) 0, then ϕ is r-convex for every r r. We obtain the r-concave analog of the above theorem by replacing supremum in.4) by infimum. In this paper, we will present new examples of r-convex functions in Section. Meanwhile, we extend the r-convexity and quasi-convexity concepts to the setting associated with second-order cone in Section 4 and Section 5. Applications of r- convexity to optimization theory can be found in [,, 5]. In general, r-convex functions can be viewed as the functions between convex functions and quasi-convex

4 370 C.-H. HUANG, H.-L. HUANG, AND J.-S. CHEN functions. We believe that the aforementioned extensions will be beneficial for dealing optimization problems involved second-order constraints. We point out that extending the concepts of r-convex and quasi-convex functions to the setting associated with second-order cone, which belongs to symmetric cones, is not easy and obvious since any two vectors in the Euclidean Jordan algebra cannot be compared under the partial order K n, see [8]. Nonetheless, using the projection onto secondorder cone pave a way to do such extensions, more details will be seen in Sections 4 and 5. To close this section, we recall some background materials regarding second-order cone. The second-order cone SOC for short) in R n, also called the Lorentz cone, is defined by K n = { x = x, x ) R R n x x }. For n =, K n denotes the set of nonnegative real number R +. For any x, y in R n, we write x K n y if x y K n and write x K n y if x y intk n ). In other words, we have x K n 0 if and only if x K n and x K n 0 if and only if x intk n ). The relation K n is a partial ordering but not a linear ordering in K n, i.e., there exist x, y K n such that neither x K n y nor y K n x. To see this, for n =, let x =, ) and y =, 0), we have x y = 0, ) / K n, y x = 0, ) / K n. For dealing with second-order cone programs SOCP) and second-order cone complementarity problems SOCCP), we need spectral decomposition associated with SOC [9]. More specifically, for any x = x, x ) R R n, the vector x can be decomposed as x = λ u ) x + λ u ) x, where λ, λ and u ) x, u ) x are the spectral values and the associated spectral vectors of x, respectively, given by λ i = x + ) i x, { u i) x =, )i x x ) if x 0,, )i w) if x = 0. for i =, with w being any vector in R n satisfying w =. If x 0, the decomposition is unique. For any function f : R R, the following vector-valued function associated with K n n ) was considered in [7, 8]:.5) f soc x) = fλ )u ) x + fλ )u ) x, x = x, x ) R R n. If f is defined only on a subset of R, then f soc is defined on the corresponding subset of R n. The definition.5) is unambiguous whether x 0 or x = 0. The cases of f soc x) = x /, x, expx) are discussed in [0]. In fact, the above definition.5) is analogous to the one associated with positive semidefinite cone S n + [0, ].

5 SOC R-CONVEX FUNCTIONS 37 Throughout this paper, R n denotes the space of n-dimensional real column vectors, C denotes a convex subset of R, S denotes a convex subset of R n, and, means the Euclidean inner product, whereas is the Euclidean norm. The notation := means define. For any f : R n R, fx) denotes the gradient of f at x. C i) J) denotes the family of functions which are defined on J R n to R and have the i-th continuous derivative, while T means transpose.. Examples of r-functions In this section, we try to discover some new r-convex functions which is verified by applying Property.. With these examples, we have a more complete picture about characterizations of r-convex functions. Moreover, for any given r, we also provide examples which are r-convex functions. Example.. For any real number p, let f : 0, ) R be defined by ft) = t p. a) If p > 0, then f is convex for p, and + )-convex for 0 < p <. b) If p < 0, then f is convex. To see this, we first note that f t) = pt p, f t) = pp )t p and s f t) s p)t p sup s f t) 0, s = [s f t)] = sup p 0 p Then, applying Property. yields the desired result. Example.. Suppose that f is defined on π, π ). a) The function ft) = sin t is -convex. b) The function ft) = tan t is -convex. c) The function ft) = lnsec t) is )-convex. d) The function ft) = ln sec t + tan t is -convex. To see a), we note that f t) = cos t, f t) = sin t, and s f t) s sup, s = [s f t)] = sup = { if 0 < p <, 0 if p > or p < 0. sin t cos t =. Hence ft) = sin t is -convex. To see b), we note that f t) = sec t, f t) = sec t tan t, and sup f t) [f t)] = sup sec t tan t sec 4 t This says that ft) = tan t is -convex. To see c), we note that f t) = tan t, f t) = sec t, and sup f t) [f t)] = sup k sec t tan t Then, it is clear to see that ft) = lnsec t) is )-convex. = sup sin t) =. = sup csc t) =.

6 37 C.-H. HUANG, H.-L. HUANG, AND J.-S. CHEN To see d), we note that f t) = sec t, f t) = sec t tan t, and sup f t) [f t)] = sup Thus, ft) = ln sec t + tan t is -convex. sec t tan t sec t = sup sin t) =. Figure. Graphs of r-convex functions with various values of r. In light of Example.b)-c) and Property.e), the next example indicates that for any given r R no matter positive or negative), we can always construct an r-convex function accordingly. The graphs of various r-convex functions are depicted in Figure. Example.3. For any r 0, let f be defined on π, π ). a) The function ft) = tan t is r -convex. r lnsec t) b) The function ft) = is r)-convex. r a) First, we compute that f t) = sec t, f t) = sec t tan t, and r r sup f t) [f t)] = sup r sin t) = r. This says that ft) = tan t is r -convex. r b) Similarly, from f t) = tan t r, f t) = sec t, and r sup f t) [f t)] = sup r csc t) = r.

7 SOC R-CONVEX FUNCTIONS 373 Then, it is easy to see that ft) = lnsec t) r is r)-convex. Example.4. The function fx) = ln x + ) defined on R is -convex. For x = s, t) R, and any real number r 0, we consider the function ϕx, r) = fx) + r fx) fx) T [ t = s ] [ ] + st r s st x + ) st s t + + x + ) st t [ r )s = + t ] + r )st x + ) r )st s + r )t. + Applying Property.b), we know that f is r-convex if and only if ϕ is positive semidefinite, which is equivalent to.).) r )s + t + 0 r )s + t + r )st r )st s + r )t + 0. It is easy to verify the inequality.) holds for all x R if and only if r. Moreover, we note that r )s + t + r )st r )st s + r )t + 0 s t + s + t + + r ) s t + r )s 4 + s + t 4 + t ) r ) s t 0 s + t + + r )s t + r )s 4 + s + t 4 + t ) 0, and hence the inequality.) holds for all x R whenever r. conclude by Property.b) that f is -convex on R. Thus, we Figure. Graphs of -convex functions fx) = ln x + ).

8 374 C.-H. HUANG, H.-L. HUANG, AND J.-S. CHEN 3. Properties of SOC-functions As mentioned in Section, another contribution of this paper is extending the concept of r-convexity to the setting associated with second-order cone. To this end, we recall what SOC-convex function means. For any x = x, x ) R R n and y = y, y ) R R n, we define their Jordan product as x y = x T y, y x + x y ). We write x to mean x x and write x + y to mean the usual componentwise addition of vectors. Then,, +, together with e =, 0,..., 0) T R n and for any x, y, z R n, the following basic properties [0, ] hold: ) e x = x, ) x y = y x, 3) x x y) = x x y), 4) x + y) z = x z + y z. Notice that the Jordan product is not associative in general. However, it is power associative, i.e., x x x) = x x) x for all x R n. Thus, we may, without loss of ambiguity, write x m for the product of m copies of x and x m+n = x m x n for all positive integers m and n. Here, we set x 0 = e. Besides, K n is not closed under Jordan product. For any x K n, it is known that there exists a unique vector in K n denoted by x / such that x / ) = x / x / = x. Indeed, x / = s, x ) ), where s = x + x s x. In the above formula, the term x /s is defined to be the zero vector if x = 0 and s = 0, i.e., x = 0. For any x R n, we always have x K n, i.e., x K n 0. Hence, there exists a unique vector x ) / K n denoted by x. It is easy to verify that x K n 0 and x = x for any x R n. It is also known that x K n x. For any x R n, we define [x] + to be the nearest point projection of x onto K n, which is the same definition as in R n +. In other words, [x] + is the optimal solution of the parametric SOCP: [x] + = arg min{ x y y K n }. In addition, it can be verified that [x] + = x + x )/; see [0, ]. Property 3. [, Proposition 3.3]). For any x = x, x ) R R n, we have a) x = x ) / = λ u ) x + λ u ) x. b) [x] + = [λ ] + u ) x + [λ ] + u ) x x + x ). = Next, we review the concepts of SOC-monotone and SOC-convex functions which are introduced in [7]. Definition 3.. For a real valued function f : R R, a) f is said to be SOC-monotone of order n if its corresponding vector-valued function f soc defined as in.5) satisfies x K n y = f soc x) K n f soc y). The function f is said to be SOC-monotone if f is SOC-monotone of all order n.

9 SOC R-CONVEX FUNCTIONS 375 b) f is said to be SOC-convex of order n if its corresponding vector-valued function f soc defined as in.5) satisfies 3.) f soc λ)x + λy) K n λ)f soc x) + λf soc y) for all x, y R n and 0 λ. Similarly, f is said to be SOC-concave of order n on C if the inequality 3.) is reversed. The function f is said to be SOC-convex respectively, SOC-concave) if f is SOC-convex of all order n respectively, SOC-concave of all order n). The concepts of SOC-monotone and SOC-convex functions are analogous to matrix monotone and matrix convex functions [5,4], and are special cases of operator monotone and operator convex functions [3,6,6]. Examples of SOC-monotone and SOC-convex functions are given in [7]. It is clear that the set of SOC-monotone functions and the set of SOC-convex functions are both closed under linear combinations and under pointwise limits. Property 3.3 [8, Theorem 3.]). Let f C ) J) with J being an open interval and domf soc ) R n. Then, the following hold. a) f is SOC-monotone of order if and only if f τ) 0 for any τ J; b) f is SOC-monotone of order n 3 if and only if the matrix f ) ft ) ft ) t ) t t ft ) ft ) O for all t, t J and t t. f ) t ) t t Property 3.4 [8, Theorem 4.]). Let f C ) J) with J being an open interval in R and domf soc ) R n. Then, the following hold. 3.) a) f is SOC-convex of order if and only if f is convex; b) f is SOC-convex of order n 3 if and only if f is convex and the inequality f ) t 0 ) [ft 0) ft) f ) t)t 0 t)] t 0 t) [ft) ft 0) f ) t 0 )t t 0 )] t 0 t) 4 holds for any t 0, t J and t 0 t. Property 3.5 [4, Theorem 3.3.7]). Let f : S R where S is a nonempty open convex set in R n. Suppose f C S). Then, f is convex if and only if fx) O, for all x S. Property 3.6 [7, Proposition 4.]). Let f : [0, ] [0, ] be continuous. If f is SOC-concave, then f is SOC-monotone. Property 3.7 [, Proposition 3.]). Suppose that ft) = e t and gt) = ln t. Then, the corresponding SOC-functions of e t and ln t are given as below. a) For any x = x, x ) R R n, { ) f soc x) = e x e = x cosh x ), sinh x ) x x if x 0, e x, 0) if x = 0, where coshα) = e α + e α )/ and sinhα) = e α e α )/ for α R.

10 376 C.-H. HUANG, H.-L. HUANG, AND J.-S. CHEN b) For any x = x, x ) intk n ), ln x is well-defined and { ) ) g soc x) = ln x = lnx x ), ln x + x x x x x if x 0, ln x, 0) if x = 0. With these, we have the following technical lemmas that will be used in the subsequent analysis. Lemma 3.8. Let f : R R be ft) = e t and x = x, x ) R R n, y = y, y ) R R n. Then, the following hold. a) f is SOC-monotone of order on R. b) f is not SOC-monotone of order n 3 on R. c) If x y x + y, then e x K n e y. In particular, if x K n, then e x K n e 0,0). Proof. a) By applying Property 3.3a), it is clear that f is SOC-monotone of order since f τ) = e τ 0 for all τ R. b) Take x =,.,.6), y =, 0, 4), then we have x y = 3,.,.4) K n 0. But, we compute that ) ) e x e y = e.,.6) cosh), sinh) e 0, 4) cosh4), sinh4) 4 = [ e 4 +,.6e 4 ),.8e 4 )) e 3 + e 5, 0, e 3 + e 5 ) ] = 7.759, ,.3999) K n 0. The last inequality is because ,.3999) = > We also present an alternative argument for partb) here. First, we observe that 3.3) det [ ft ) ft ) t t f ) t ) ft ) ft ) t t f ) t ) ] = e t +t e t e t ) 0 t t ) e t t )/ e t t )/ if and only if. Denote s := t t )/, then the above t t inequality holds if and only if sinhs)/s). In light of Taylor Theorem, we know sinhs)/s = + s /6 + s 4 /0 + > for s 0. Hence, 3.3) does not hold. Then, applying Property 3.3b) says f is not SOC-monotone of order n 3 on R.

11 SOC R-CONVEX FUNCTIONS 377 c) The desired result follows by the following implication: e x K n e y e x cosh x ) e y cosh y ) ex sinh x ) x x ey sinh y ) y y [e x cosh x ) e y cosh y )] ex sinh x ) x x ey sinh y ) y y = e x + e y [ e x +y cosh x ) cosh y ) sinh x ) sinh y ) x ], y x y 0 = e x + e y e x +y cosh x + y ) 0 cosh x + y ) ex + e y x y x + y. e x +y = ex y + e y x = coshx y ) Lemma 3.9. Let ft) = e t be defined on R, then f is SOC-convex of order. However, f is not SOC-convex of order n 3. Proof. a) By applying Property 3.4 a), it is clear that f is SOC-convex since exponential function is a convex function on R. b) As below, it is a counterexample which shows ft) = e t is not SOC-convex of order n 3. To see this, we compute that and e [,0, )+6, 4, 3)]/ = e 4,, ) = e 4 cosh ), sinh ), )/ ) ) , 35.45, 35.45) e,0, ) + e 6, 4, 3)) = [ e cosh), 0, sinh)) + e 6 cosh5), sinh5) 4, 3)/5) ] = 4975, 974, 8985). We see that = 45.5, but 974, 8985) , ) = 455 > 45.5 which is a contradiction.

12 378 C.-H. HUANG, H.-L. HUANG, AND J.-S. CHEN Lemma 3.0 [8, Proposition 5.]). The function gt) = ln t is SOC-monotone of order n on 0, ). In general, to verify the SOC-convexity of e t as shown in Proposition 3.), we observe that the following fact 0 K n e rf soc λx+ λ)y) K n w = rf soc λx + λ)y) K n lnw) is important and often needed. Note for x 0, we also have some observations as below. a) e x K n 0 cosh x ) sinh x ) e x > 0. b) 0 K n lnx) lnx x ) > ln x + x x x ) lnx x ) > 0 x x >. Hence, 0) K n x implies 0 K n lnx). c) ln, 0) = 0, 0) and e 0,0) =, 0). 4. SOC-r-convex functions In this section, we define the so-called SOC-r-convex functions which is viewed as the natural extension of r-convex functions to the setting associated with secondorder cone. Definition 4.. Suppose that r R and f : C R R where C is a convex subset of R. Let f soc : S R n R n be its corresponding SOC-function defined as in.5). The function f is said to be SOC-r-convex of order n on C if, for x, y S and λ [0, ], there holds { r ln λe rf soc x) + λ)e rf soc y) ) r 0, 4.) f soc λx + λ)y) K n λf soc x) + λ)f soc y) r = 0. Similarly, f is said to be SOC-r-concave of order n on C if the inequality 4.) is reversed. We say f is SOC-r-convex respectively, SOC-r-concave) on C if f is SOC-r-convex of all order n respectively, SOC-r-concave of all order n) on C. It is clear from the above definition that a real function is SOC-convex SOCconcave) if and only if it is SOC-0-convex SOC-0-concave). In addition, a function f is SOC-r-convex if and only if f is SOC- r)-concave. From [, Theorem 4.], it is shown that ϕ : R R is r-convex with r 0 if and only if e rϕ is convex whenever r > 0 and concave whenever r < 0. However, we observe that the exponential function e t is not SOC-convex for n 3 by Lemma 3.9. This is a hurdle to build parallel result for general n in the setting of SOC case. As seen in Proposition 4.5, the parallel result is true only for n =. Indeed, for n 3, only one direction holds which can be viewed as a weaker version of [, Theorem 4.]. Proposition 4.. Let f : [0, ) [0, ) be continuous. If f is SOC-r-concave with r 0, then f is SOC-monotone.

13 SOC R-CONVEX FUNCTIONS 379 Proof. For any 0 < λ <, we can write λx = λy + λ)λ λ) x y). If r = 0, then f is SOC-concave and SOC-monotone by Property 3.6. If r > 0, then f soc λx) K n r ln λe rf soc y) + λ)e rf soc λ x y))) λ K n r ln λe r0,0) + λ)e r0,0)) = ln λ, 0) + λ), 0)) r = 0, where the second inequality is due to x y K n 0 and Lemmas Letting λ, we obtain that f soc x) K n f soc y), which says that f is SOC-monotone. In fact, in light of Lemma , we have the following Lemma which is useful for subsequent analysis. Lemma 4.3. Let z R n and w intk n ). Then, the following hold. a) For n = and r > 0, z K n lnw)/r rz K n lnw) e rz K n w. b) For n = and r > 0, z K n lnw)/r rz K n lnw) e rz K n w. c) For n, if e rz K n w, then rz K n lnw). Proposition 4.4. For n = and let f : R R. Then, the following hold. a) The function ft) = t is SOC-r-convex SOC-r-concave) on R for r > 0 r < 0). b) If f is SOC-convex, then f is SOC-r-convex SOC-r-concave) for r > 0 r < 0). Proof. a) For r > 0, x, y R n and λ [0, ], we note that the corresponding vector-valued SOC-function of ft) = t is f soc x) = x. Therefore, to prove the desired result, we need to verify that f soc ) λx + λ)y) K n r ln λe rf soc x) + λ)e rf soc y). To this end, we see that λx + λ)y K n r ln λerx + λ)e ry ) λrx + λ)ry K n ln λe rx + λ)e ry ) e λrx+ λ)ry K n λe rx + λ)e ry, where the first is true due to Lemma 4.3, whereas the second holds because e t and ln t are SOC-monotone of order by Lemma 3.8 and Lemma 3.0. Then, using the fact that e t is SOC-convex of order gives the desired result. b) For any x, y R n and 0 λ, it can be verified that f soc λx + λ)y) K n λf soc x) + λ)f soc y) K n r ln λe rf soc x) + λ)e rf soc y),

14 380 C.-H. HUANG, H.-L. HUANG, AND J.-S. CHEN where the second inequality holds according to the proof of a). Thus, the desired result follows. Proposition 4.5. Let f : R R. Then f is SOC-r-convex if e rf is SOC-convex SOC-concave) for n and r > 0 r < 0). For n =, we can replace if by if and only if. Proof. Suppose that e rf is SOC-convex. For any x, y R n and 0 λ, using that fact that ln t is SOC-monotone Lemma 3.0) yields e rf soc λx+ λ)y) K n λe rf soc x) + λ)e rf soc y) = rf soc λx + λ)y) K n ln λe ) rf soc x) + λ)e rf soc y) f soc ) λx + λ)y) K n r ln λe rf soc x) + λ)e rf soc y). When n =, e t is SOC-monotone as well, which implies that the = can be replaced by. Thus, the proof is complete. Combining with Property 3.4, we can characterize the SOC-r-convexity as follows. Proposition 4.6. Let f C ) J) with J being an open interval in R and domf soc ) R n. Then, for r > 0, the followings hold. a) f is SOC-r-convex of order if and only if e rf is convex; b) f is SOC-r-convex of order n 3 if e rf is convex and satisfies the inequality 3.). Next, we present several examples of SOC-r-convex and SOC-r-concave functions of order. For examples of SOC-r-convex and SOC-r-concave functions of order n), we are still unable to discover them. Example 4.7. For n =, the following hold. a) The function ft) = t is SOC-r-convex on R for r 0. b) The function ft) = t 3 is SOC-r-convex on [0, ) for r > 0, while it is SOC-r-concave on, 0] for r < 0. c) The function ft) = /t is SOC-r-convex on [ r/, 0) or 0, ) for r > 0, while it is SOC-r-concave on, 0) or 0, r/] for r < 0. d) The function ft) = t is SOC-r-convex on [/r, ) for r > 0, while it is SOC-r-concave on [0, ) for r < 0. e) The function ft) = ln t is SOC-r-convex SOC-r-concave) on 0, ) for r > 0 r < 0). Proof. a) First, we denote ht) := e rt. Then, we have h t) = rte rt and h t) = + rt )re rt. From Property 3.5, we know h is convex if and only if h t) 0. Thus, the desired result holds by applying Property 3.4 and Proposition 4.5. The arguments for other cases are similar and we omit them.

15 SOC R-CONVEX FUNCTIONS SOC-quasiconvex functions In this section, we define the so-called SOC-quasiconvex functions which is a natural extension of quasiconvex functions to the setting associated with secondorder cone. Recall that a function f : S R n R is said to be quasiconvex on S if, for any x, y S and 0 λ, there has fλx + λ)y) max {fx), fy)}. We point out that the relation K n is not a linear ordering. Hence, it is not possible to compare any two vectors elements) via K n. Nonetheless, we note that max{a, b} = b + [a b] + = a + b + a b ), for any a, b R. This motivates us to define SOC-quasiconvex functions in the setting of second-order cone. Definition 5.. Let f : C R R and 0 λ. The function f is said to be SOC-quasiconvex of order n on C if, for any x, y R n, there has where f soc λx + λ)y) K n f soc y) + [f soc x) f soc y)] + f soc y) + [f soc x) f soc y)] + = f soc x) if f soc x) K n f soc y), f soc y) if f soc x) K n f soc y), f soc x) + f soc y) + f soc x) f soc y) ) if f soc x) f soc y) / K n K n ). Similarly, f is said to be SOC-quasiconcave of order n if f soc λx + λ)y) K n f soc x) [f soc x) f soc y)] +. The function f is called SOC-quasiconvex SOC-quasiconcave) if it is SOC-quasiconvex of all order n SOC-quasiconcave of all order n). Proposition 5.. Let f : R R be ft) = t. Then, f is SOC-quasiconvex on R. Proof. First, for any x = x, x ) R R n, y = y, y ) R R n, and 0 λ, we have f soc y) K n f soc x) λ)f soc y) K n λ)f soc x) λf soc x) + λ)f soc y) K n f soc x). Recall that the corresponding SOC-function of ft) = t is f soc x) = x. Thus, for all x R n, this implies f soc λx+ λ)y) = λf soc x)+ λ)f soc y) K n f soc x) under this case: f soc y) K n f soc x). The argument is similar to the case of f soc x) K n f soc y). Hence, it remains to consider the case of f soc x) f soc y) / K n K n ), i.e., it suffices to show that λf soc x) + λ)f soc y) K n f soc x) + f soc y) + f soc x) f soc y) ).

16 38 C.-H. HUANG, H.-L. HUANG, AND J.-S. CHEN To this end, we note that f soc x) f soc y) K n f soc x) f soc y) and f soc x) f soc y) K n f soc y) f soc x), which respectively implies 5.) f soc x) + f soc y) + f soc x) f soc y) ) K n x, 5.) f soc x) + f soc y) + f soc x) f soc y) ) K n y. Then, adding up 5.) λ and 5.) λ) yields the desired result. Proposition 5.3. If f : C R R is SOC-convex on C, then f is also SOCquasiconvex on C. Proof. For any x, y R n and 0 λ, it can be verified that f soc λx+ λ)y) K n λf soc x)+ λ)f soc y) K n f soc y)+[f soc x) f soc y)] +, where the second inequality holds according to the proof of Proposition 5.. Thus, the desired result follows. From Proposition 5.3, we can easily construct examples of SOC-quasiconvex functions. More specifically, all the SOC-convex functions which were verified in [7] are SOC-quasiconvex functions, for instances, t on R, and t 3, t, t/ on 0, ). 6. Final remarks In this paper, we revisit the concept of r-convex functions and provide a way to construct r-convex functions for any given r R. We also extend such concept to the setting associated with SOC which will be helpful in dealing with optimization problems involved in second-order cones. In particular, we obtain some characterizations for SOC-r-convexity and SOC-quasiconvexity. Indeed, this is just the first step and there still have many things to clarify. For example, in Section 4, we conclude that SOC-convexity implies SOC-r-convexity for n = only. The key role therein relies particularly on the SOC-convexity and SOCmonotonicity of e t. However, for n >, the expressions of e x and lnx) associated with second-order cone are very complicated so that it is hard to compare any two elements. In other words, when n =, the SOC-convexity and SOC-monotonicity of e t make things much easier than the general case n 3. To conquer this difficulty, we believe that we have to derive more properties of e x. In particular, Does SOCr-convex function have similar results as shown in Property.? is an important future direction. Manuscript received revised

17 SOC R-CONVEX FUNCTIONS 383 References [] M. Avriel, r-convex functions, Math. Program. 97), [] M. Avriel, Solution of certain nonlinear programs involving r-convex functions J. Optim. Theory Appl. 973), [3] J. S. Aujla and H. L. Vasudeva, Convex and monotone operator functions, Annal. Polonici Math ),. [4] M. S. Bazaraa, H. D. Sherali and C. M. Shetty, Nonlinear Programming, John Wiley and Sons, 3rd edition, 006. [5] R. Bhatia, Matrix Analysis, Springer-Verlag, New York, 997. [6] P. Bhatia and K. P. Parthasarathy, Positive definite functions and operator inequalities, Bull. London Math. Soc ), 4 8. [7] J.-S. Chen, The convex and monotone functions associated with second-order cone, Optim ), [8] J.-S. Chen, X. Chen, S.-H. Pan and J. Zhang, Some characterizations for SOC-monotone and SOC-convex functions, J. Global Optim ), [9] J.-S. Chen, X. Chen and P. Tseng, Analysis of nonsmooth vector-valued functions associated with second-order cones, Math. Program ), [0] J. Faraut and A. Korányi, Analysis on Symmetric Cones, Oxford Mathematical Monographs, Oxford University Press, New York, 994. [] M. Fukushima, Z.-Q. Luo, and P. Tseng, Smoothing functions for second-order-cone complementarity problems, SIAM J. Optim. 00), [] E. Galewska and M. Galewski, r-convex transformability in nonlinear programming problems, Comment. Math. Univ. Carol ), [3] G. H. Hardy, J. E. Littlewood and G. Polya, Inequalities, Cambridge University Press, 967. [4] R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, 985. [5] A. Klinger and O.L. Mangasarian, Logarithmic convexity and geometric programming, J. Math. Anal. Appl ), [6] A. Korányi, Monotone functions on formally real Jordan algebras, Math. Annal ), [7] B. Martos, The Power of Nonlinear Programming Methods In Hungarian). MTA Közgazdaságtudományi Intézetének Közleményei, No. 0, Budapest, Hungary, 966. [8] R. N. Mukherjee and L. V. Keddy, Semicontinuity and quasiconvex functions, J. Optim. Theory Appl ), [9] J. Ponstein, Seven kinds of convexity, SIAM Review 9 967), 5 9. [0] D. Sun and J. Sun, Semismooth matrix valued functions, Math. Oper. Res. 7 00), [] P. Tseng, Merit function for semidefinite complementarity problems, Math. Program ), [] X. M. Yang, Convexity of semicontinuous functions, Oper. Res. Soc. India 3 994), [3] Y. M. Yang and S. Y. Liu, Three kinds of generalized convexity, J. Optim. Theory Appl ), [4] Y. X. Zhao, S. Y. Wang and U. L. Coladas, Characterizations of r-convex functions, J. Optim. Theory Appl ), Manuscript received revised

18 384 C.-H. HUANG, H.-L. HUANG, AND J.-S. CHEN Chien-Hao Huang Department of Mathematics, National Taiwan Normal University, Taipei 677, Taiwan address: Hong-Lin Huang Department of Mathematics, National Taiwan Normal University, Taipei 677, Taiwan address: Jein-Shan Chen Department of Mathematics, National Taiwan Normal University, Taipei 677, Taiwan address:

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 to appear in Linear and Nonlinear Analysis, 07 Examples of r-convex functions and characterizations of r-convex functions associated with second-order cone Chien-Hao Huang Department of Mathematics National

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

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

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

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

A proximal-like algorithm for a class of nonconvex programming

A proximal-like algorithm for a class of nonconvex programming Pacific Journal of Optimization, vol. 4, pp. 319-333, 2008 A proximal-like algorithm for a class of nonconvex programming Jein-Shan Chen 1 Department of Mathematics National Taiwan Normal University Taipei,

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

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

SECOND-ORDER CHARACTERIZATIONS OF CONVEX AND PSEUDOCONVEX FUNCTIONS

SECOND-ORDER CHARACTERIZATIONS OF CONVEX AND PSEUDOCONVEX FUNCTIONS Journal of Applied Analysis Vol. 9, No. 2 (2003), pp. 261 273 SECOND-ORDER CHARACTERIZATIONS OF CONVEX AND PSEUDOCONVEX FUNCTIONS I. GINCHEV and V. I. IVANOV Received June 16, 2002 and, in revised form,

More information

A Note on Discrete Convexity and Local Optimality

A Note on Discrete Convexity and Local Optimality A Note on Discrete Convexity and Local Optimality Takashi Ui Faculty of Economics Yokohama National University oui@ynu.ac.jp May 2005 Abstract One of the most important properties of a convex function

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

Stability of efficient solutions for semi-infinite vector optimization problems

Stability of efficient solutions for semi-infinite vector optimization problems Stability of efficient solutions for semi-infinite vector optimization problems Z. Y. Peng, J. T. Zhou February 6, 2016 Abstract This paper is devoted to the study of the stability of efficient solutions

More information

Convex Functions. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST)

Convex Functions. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST) Convex Functions Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture Definition convex function Examples

More information

Convex Analysis and Economic Theory AY Elementary properties of convex functions

Convex Analysis and Economic Theory AY Elementary properties of convex functions Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory AY 2018 2019 Topic 6: Convex functions I 6.1 Elementary properties of convex functions We may occasionally

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

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

Characterizations of the solution set for non-essentially quasiconvex programming

Characterizations of the solution set for non-essentially quasiconvex programming Optimization Letters manuscript No. (will be inserted by the editor) Characterizations of the solution set for non-essentially quasiconvex programming Satoshi Suzuki Daishi Kuroiwa Received: date / Accepted:

More information

Yuqing Chen, Yeol Je Cho, and Li Yang

Yuqing Chen, Yeol Je Cho, and Li Yang Bull. Korean Math. Soc. 39 (2002), No. 4, pp. 535 541 NOTE ON THE RESULTS WITH LOWER SEMI-CONTINUITY Yuqing Chen, Yeol Je Cho, and Li Yang Abstract. In this paper, we introduce the concept of lower semicontinuous

More information

The general programming problem is the nonlinear programming problem where a given function is maximized subject to a set of inequality constraints.

The general programming problem is the nonlinear programming problem where a given function is maximized subject to a set of inequality constraints. 1 Optimization Mathematical programming refers to the basic mathematical problem of finding a maximum to a function, f, subject to some constraints. 1 In other words, the objective is to find a point,

More information

On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q)

On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q) On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q) Andreas Löhne May 2, 2005 (last update: November 22, 2005) Abstract We investigate two types of semicontinuity for set-valued

More information

Convex Functions and Optimization

Convex Functions and Optimization Chapter 5 Convex Functions and Optimization 5.1 Convex Functions Our next topic is that of convex functions. Again, we will concentrate on the context of a map f : R n R although the situation can be generalized

More information

A Unified Analysis of Nonconvex Optimization Duality and Penalty Methods with General Augmenting Functions

A Unified Analysis of Nonconvex Optimization Duality and Penalty Methods with General Augmenting Functions A Unified Analysis of Nonconvex Optimization Duality and Penalty Methods with General Augmenting Functions Angelia Nedić and Asuman Ozdaglar April 16, 2006 Abstract In this paper, we study a unifying framework

More information

BASICS OF CONVEX ANALYSIS

BASICS OF CONVEX ANALYSIS BASICS OF CONVEX ANALYSIS MARKUS GRASMAIR 1. Main Definitions We start with providing the central definitions of convex functions and convex sets. Definition 1. A function f : R n R + } is called convex,

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

WEAK CONVERGENCE THEOREMS FOR EQUILIBRIUM PROBLEMS WITH NONLINEAR OPERATORS IN HILBERT SPACES

WEAK CONVERGENCE THEOREMS FOR EQUILIBRIUM PROBLEMS WITH NONLINEAR OPERATORS IN HILBERT SPACES Fixed Point Theory, 12(2011), No. 2, 309-320 http://www.math.ubbcluj.ro/ nodeacj/sfptcj.html WEAK CONVERGENCE THEOREMS FOR EQUILIBRIUM PROBLEMS WITH NONLINEAR OPERATORS IN HILBERT SPACES S. DHOMPONGSA,

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

UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems

UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems Robert M. Freund February 2016 c 2016 Massachusetts Institute of Technology. All rights reserved. 1 1 Introduction

More information

Division of the Humanities and Social Sciences. Supergradients. KC Border Fall 2001 v ::15.45

Division of the Humanities and Social Sciences. Supergradients. KC Border Fall 2001 v ::15.45 Division of the Humanities and Social Sciences Supergradients KC Border Fall 2001 1 The supergradient of a concave function There is a useful way to characterize the concavity of differentiable functions.

More information

On intermediate value theorem in ordered Banach spaces for noncompact and discontinuous mappings

On intermediate value theorem in ordered Banach spaces for noncompact and discontinuous mappings Int. J. Nonlinear Anal. Appl. 7 (2016) No. 1, 295-300 ISSN: 2008-6822 (electronic) http://dx.doi.org/10.22075/ijnaa.2015.341 On intermediate value theorem in ordered Banach spaces for noncompact and discontinuous

More information

On a Class of Multidimensional Optimal Transportation Problems

On a Class of Multidimensional Optimal Transportation Problems Journal of Convex Analysis Volume 10 (2003), No. 2, 517 529 On a Class of Multidimensional Optimal Transportation Problems G. Carlier Université Bordeaux 1, MAB, UMR CNRS 5466, France and Université Bordeaux

More information

NEW MAXIMUM THEOREMS WITH STRICT QUASI-CONCAVITY. Won Kyu Kim and Ju Han Yoon. 1. Introduction

NEW MAXIMUM THEOREMS WITH STRICT QUASI-CONCAVITY. Won Kyu Kim and Ju Han Yoon. 1. Introduction Bull. Korean Math. Soc. 38 (2001), No. 3, pp. 565 573 NEW MAXIMUM THEOREMS WITH STRICT QUASI-CONCAVITY Won Kyu Kim and Ju Han Yoon Abstract. In this paper, we first prove the strict quasi-concavity of

More information

A Geometric Framework for Nonconvex Optimization Duality using Augmented Lagrangian Functions

A Geometric Framework for Nonconvex Optimization Duality using Augmented Lagrangian Functions A Geometric Framework for Nonconvex Optimization Duality using Augmented Lagrangian Functions Angelia Nedić and Asuman Ozdaglar April 15, 2006 Abstract We provide a unifying geometric framework for the

More information

SCALARIZATION APPROACHES FOR GENERALIZED VECTOR VARIATIONAL INEQUALITIES

SCALARIZATION APPROACHES FOR GENERALIZED VECTOR VARIATIONAL INEQUALITIES Nonlinear Analysis Forum 12(1), pp. 119 124, 2007 SCALARIZATION APPROACHES FOR GENERALIZED VECTOR VARIATIONAL INEQUALITIES Zhi-bin Liu, Nan-jing Huang and Byung-Soo Lee Department of Applied Mathematics

More information

Things you should have learned in Calculus II

Things you should have learned in Calculus II Things you should have learned in Calculus II 1 Vectors Given vectors v = v 1, v 2, v 3, u = u 1, u 2, u 3 1.1 Common Operations Operations Notation How is it calculated Other Notation Dot Product v u

More information

Viscosity approximation methods for the implicit midpoint rule of asymptotically nonexpansive mappings in Hilbert spaces

Viscosity approximation methods for the implicit midpoint rule of asymptotically nonexpansive mappings in Hilbert spaces Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 9 016, 4478 4488 Research Article Viscosity approximation methods for the implicit midpoint rule of asymptotically nonexpansive mappings in Hilbert

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

PARALLEL SUBGRADIENT METHOD FOR NONSMOOTH CONVEX OPTIMIZATION WITH A SIMPLE CONSTRAINT

PARALLEL SUBGRADIENT METHOD FOR NONSMOOTH CONVEX OPTIMIZATION WITH A SIMPLE CONSTRAINT Linear and Nonlinear Analysis Volume 1, Number 1, 2015, 1 PARALLEL SUBGRADIENT METHOD FOR NONSMOOTH CONVEX OPTIMIZATION WITH A SIMPLE CONSTRAINT KAZUHIRO HISHINUMA AND HIDEAKI IIDUKA Abstract. In this

More information

GEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, Dedicated to Franco Giannessi and Diethard Pallaschke with great respect

GEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, Dedicated to Franco Giannessi and Diethard Pallaschke with great respect GEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, 2018 BORIS S. MORDUKHOVICH 1 and NGUYEN MAU NAM 2 Dedicated to Franco Giannessi and Diethard Pallaschke with great respect Abstract. In

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

The Split Hierarchical Monotone Variational Inclusions Problems and Fixed Point Problems for Nonexpansive Semigroup

The Split Hierarchical Monotone Variational Inclusions Problems and Fixed Point Problems for Nonexpansive Semigroup International Mathematical Forum, Vol. 11, 2016, no. 8, 395-408 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2016.6220 The Split Hierarchical Monotone Variational Inclusions Problems and

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

Convex Optimization Notes

Convex Optimization Notes Convex Optimization Notes Jonathan Siegel January 2017 1 Convex Analysis This section is devoted to the study of convex functions f : B R {+ } and convex sets U B, for B a Banach space. The case of B =

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

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

Chapter 3a Topics in differentiation. Problems in differentiation. Problems in differentiation. LC Abueg: mathematical economics

Chapter 3a Topics in differentiation. Problems in differentiation. Problems in differentiation. LC Abueg: mathematical economics Chapter 3a Topics in differentiation Lectures in Mathematical Economics L Cagandahan Abueg De La Salle University School of Economics Problems in differentiation Problems in differentiation Problem 1.

More information

Problem 3. Give an example of a sequence of continuous functions on a compact domain converging pointwise but not uniformly to a continuous function

Problem 3. Give an example of a sequence of continuous functions on a compact domain converging pointwise but not uniformly to a continuous function Problem 3. Give an example of a sequence of continuous functions on a compact domain converging pointwise but not uniformly to a continuous function Solution. If we does not need the pointwise limit of

More information

PROXIMAL POINT ALGORITHMS INVOLVING FIXED POINT OF NONSPREADING-TYPE MULTIVALUED MAPPINGS IN HILBERT SPACES

PROXIMAL POINT ALGORITHMS INVOLVING FIXED POINT OF NONSPREADING-TYPE MULTIVALUED MAPPINGS IN HILBERT SPACES PROXIMAL POINT ALGORITHMS INVOLVING FIXED POINT OF NONSPREADING-TYPE MULTIVALUED MAPPINGS IN HILBERT SPACES Shih-sen Chang 1, Ding Ping Wu 2, Lin Wang 3,, Gang Wang 3 1 Center for General Educatin, China

More information

Convex analysis and profit/cost/support functions

Convex analysis and profit/cost/support functions Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m Convex analysts may give one of two

More information

On Gap Functions for Equilibrium Problems via Fenchel Duality

On Gap Functions for Equilibrium Problems via Fenchel Duality On Gap Functions for Equilibrium Problems via Fenchel Duality Lkhamsuren Altangerel 1 Radu Ioan Boţ 2 Gert Wanka 3 Abstract: In this paper we deal with the construction of gap functions for equilibrium

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

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

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

CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.

CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008. 1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function

More information

Constructive Proof of the Fan-Glicksberg Fixed Point Theorem for Sequentially Locally Non-constant Multi-functions in a Locally Convex Space

Constructive Proof of the Fan-Glicksberg Fixed Point Theorem for Sequentially Locally Non-constant Multi-functions in a Locally Convex Space Constructive Proof of the Fan-Glicksberg Fixed Point Theorem for Sequentially Locally Non-constant Multi-functions in a Locally Convex Space Yasuhito Tanaka, Member, IAENG, Abstract In this paper we constructively

More information

THE UNIQUE MINIMAL DUAL REPRESENTATION OF A CONVEX FUNCTION

THE UNIQUE MINIMAL DUAL REPRESENTATION OF A CONVEX FUNCTION THE UNIQUE MINIMAL DUAL REPRESENTATION OF A CONVEX FUNCTION HALUK ERGIN AND TODD SARVER Abstract. Suppose (i) X is a separable Banach space, (ii) C is a convex subset of X that is a Baire space (when endowed

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

The Generalized Viscosity Implicit Rules of Asymptotically Nonexpansive Mappings in Hilbert Spaces

The Generalized Viscosity Implicit Rules of Asymptotically Nonexpansive Mappings in Hilbert Spaces Applied Mathematical Sciences, Vol. 11, 2017, no. 12, 549-560 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.718 The Generalized Viscosity Implicit Rules of Asymptotically Nonexpansive

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 http://jipam.vu.edu.au/ Volume 4, Issue 4, Article 67, 2003 ON GENERALIZED MONOTONE MULTIFUNCTIONS WITH APPLICATIONS TO OPTIMALITY CONDITIONS IN

More information

Helly's Theorem and its Equivalences via Convex Analysis

Helly's Theorem and its Equivalences via Convex Analysis Portland State University PDXScholar University Honors Theses University Honors College 2014 Helly's Theorem and its Equivalences via Convex Analysis Adam Robinson Portland State University Let us know

More information

Lecture 8 Plus properties, merit functions and gap functions. September 28, 2008

Lecture 8 Plus properties, merit functions and gap functions. September 28, 2008 Lecture 8 Plus properties, merit functions and gap functions September 28, 2008 Outline Plus-properties and F-uniqueness Equation reformulations of VI/CPs Merit functions Gap merit functions FP-I book:

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

Convex envelopes, cardinality constrained optimization and LASSO. An application in supervised learning: support vector machines (SVMs)

Convex envelopes, cardinality constrained optimization and LASSO. An application in supervised learning: support vector machines (SVMs) ORF 523 Lecture 8 Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Any typos should be emailed to a a a@princeton.edu. 1 Outline Convexity-preserving operations Convex envelopes, cardinality

More information

Mathematical Programming Involving (α, ρ)-right upper-dini-derivative Functions

Mathematical Programming Involving (α, ρ)-right upper-dini-derivative Functions Filomat 27:5 (2013), 899 908 DOI 10.2298/FIL1305899Y Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Mathematical Programming Involving

More information

CHARACTERIZATION OF (QUASI)CONVEX SET-VALUED MAPS

CHARACTERIZATION OF (QUASI)CONVEX SET-VALUED MAPS CHARACTERIZATION OF (QUASI)CONVEX SET-VALUED MAPS Abstract. The aim of this paper is to characterize in terms of classical (quasi)convexity of extended real-valued functions the set-valued maps which are

More information

Mathematics II, course

Mathematics II, course Mathematics II, course 2013-2014 Juan Pablo Rincón Zapatero October 24, 2013 Summary: The course has four parts that we describe below. (I) Topology in Rn is a brief review of the main concepts and properties

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

Some Background Math Notes on Limsups, Sets, and Convexity

Some Background Math Notes on Limsups, Sets, and Convexity EE599 STOCHASTIC NETWORK OPTIMIZATION, MICHAEL J. NEELY, FALL 2008 1 Some Background Math Notes on Limsups, Sets, and Convexity I. LIMITS Let f(t) be a real valued function of time. Suppose f(t) converges

More information

Functions of several variables of finite variation and their differentiability

Functions of several variables of finite variation and their differentiability ANNALES POLONICI MATHEMATICI LX.1 (1994) Functions of several variables of finite variation and their differentiability by Dariusz Idczak ( Lódź) Abstract. Some differentiability properties of functions

More information

Convexity and constructive infima

Convexity and constructive infima Convexity and constructive infima Josef Berger and Gregor Svindland May 13, 2016 Abstract We show constructively that every quasi-convex uniformly continuous function f : C R + has positive infimum, where

More information

NUMERICAL RADIUS OF A HOLOMORPHIC MAPPING

NUMERICAL RADIUS OF A HOLOMORPHIC MAPPING Geometric Complex Analysis edited by Junjiro Noguchi et al. World Scientific, Singapore, 1995 pp.1 7 NUMERICAL RADIUS OF A HOLOMORPHIC MAPPING YUN SUNG CHOI Department of Mathematics Pohang University

More information

Norm inequalities related to the matrix geometric mean

Norm inequalities related to the matrix geometric mean isid/ms/2012/07 April 20, 2012 http://www.isid.ac.in/ statmath/eprints Norm inequalities related to the matrix geometric mean RAJENDRA BHATIA PRIYANKA GROVER Indian Statistical Institute, Delhi Centre

More information

Chapter 1 Preliminaries

Chapter 1 Preliminaries Chapter 1 Preliminaries 1.1 Conventions and Notations Throughout the book we use the following notations for standard sets of numbers: N the set {1, 2,...} of natural numbers Z the set of integers Q the

More information

SPACES ENDOWED WITH A GRAPH AND APPLICATIONS. Mina Dinarvand. 1. Introduction

SPACES ENDOWED WITH A GRAPH AND APPLICATIONS. Mina Dinarvand. 1. Introduction MATEMATIČKI VESNIK MATEMATIQKI VESNIK 69, 1 (2017), 23 38 March 2017 research paper originalni nauqni rad FIXED POINT RESULTS FOR (ϕ, ψ)-contractions IN METRIC SPACES ENDOWED WITH A GRAPH AND APPLICATIONS

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

EC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1

EC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1 EC9A0: Pre-sessional Advanced Mathematics Course Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1 1 Infimum and Supremum Definition 1. Fix a set Y R. A number α R is an upper bound of Y if

More information

6.254 : Game Theory with Engineering Applications Lecture 7: Supermodular Games

6.254 : Game Theory with Engineering Applications Lecture 7: Supermodular Games 6.254 : Game Theory with Engineering Applications Lecture 7: Asu Ozdaglar MIT February 25, 2010 1 Introduction Outline Uniqueness of a Pure Nash Equilibrium for Continuous Games Reading: Rosen J.B., Existence

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

A NOTE ON RATIONAL OPERATOR MONOTONE FUNCTIONS. Masaru Nagisa. Received May 19, 2014 ; revised April 10, (Ax, x) 0 for all x C n.

A NOTE ON RATIONAL OPERATOR MONOTONE FUNCTIONS. Masaru Nagisa. Received May 19, 2014 ; revised April 10, (Ax, x) 0 for all x C n. Scientiae Mathematicae Japonicae Online, e-014, 145 15 145 A NOTE ON RATIONAL OPERATOR MONOTONE FUNCTIONS Masaru Nagisa Received May 19, 014 ; revised April 10, 014 Abstract. Let f be oeprator monotone

More information

NONDIFFERENTIABLE SECOND-ORDER MINIMAX MIXED INTEGER SYMMETRIC DUALITY

NONDIFFERENTIABLE SECOND-ORDER MINIMAX MIXED INTEGER SYMMETRIC DUALITY J. Korean Math. Soc. 48 (011), No. 1, pp. 13 1 DOI 10.4134/JKMS.011.48.1.013 NONDIFFERENTIABLE SECOND-ORDER MINIMAX MIXED INTEGER SYMMETRIC DUALITY Tilak Raj Gulati and Shiv Kumar Gupta Abstract. In this

More information

Merit functions and error bounds for generalized variational inequalities

Merit functions and error bounds for generalized variational inequalities J. Math. Anal. Appl. 287 2003) 405 414 www.elsevier.com/locate/jmaa Merit functions and error bounds for generalized variational inequalities M.V. Solodov 1 Instituto de Matemática Pura e Aplicada, Estrada

More information

arxiv: v1 [math.ra] 8 Apr 2016

arxiv: v1 [math.ra] 8 Apr 2016 ON A DETERMINANTAL INEQUALITY ARISING FROM DIFFUSION TENSOR IMAGING MINGHUA LIN arxiv:1604.04141v1 [math.ra] 8 Apr 2016 Abstract. In comparing geodesics induced by different metrics, Audenaert formulated

More information

Lecture 4: Convex Functions, Part I February 1

Lecture 4: Convex Functions, Part I February 1 IE 521: Convex Optimization Instructor: Niao He Lecture 4: Convex Functions, Part I February 1 Spring 2017, UIUC Scribe: Shuanglong Wang Courtesy warning: These notes do not necessarily cover everything

More information

Summary Notes on Maximization

Summary Notes on Maximization Division of the Humanities and Social Sciences Summary Notes on Maximization KC Border Fall 2005 1 Classical Lagrange Multiplier Theorem 1 Definition A point x is a constrained local maximizer of f subject

More information

Convergence to Common Fixed Point for Two Asymptotically Quasi-nonexpansive Mappings in the Intermediate Sense in Banach Spaces

Convergence to Common Fixed Point for Two Asymptotically Quasi-nonexpansive Mappings in the Intermediate Sense in Banach Spaces Mathematica Moravica Vol. 19-1 2015, 33 48 Convergence to Common Fixed Point for Two Asymptotically Quasi-nonexpansive Mappings in the Intermediate Sense in Banach Spaces Gurucharan Singh Saluja Abstract.

More information

On Optimality Conditions for Pseudoconvex Programming in Terms of Dini Subdifferentials

On Optimality Conditions for Pseudoconvex Programming in Terms of Dini Subdifferentials Int. Journal of Math. Analysis, Vol. 7, 2013, no. 18, 891-898 HIKARI Ltd, www.m-hikari.com On Optimality Conditions for Pseudoconvex Programming in Terms of Dini Subdifferentials Jaddar Abdessamad Mohamed

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 THE EXTENSION OF MAJORIZATION INEQUALITIES WITHIN THE FRAMEWORK OF RELATIVE CONVEXITY CONSTANTIN P. NICULESCU AND FLORIN POPOVICI University of Craiova

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

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

CONVERGENCE OF APPROXIMATING FIXED POINTS FOR MULTIVALUED NONSELF-MAPPINGS IN BANACH SPACES. Jong Soo Jung. 1. Introduction

CONVERGENCE OF APPROXIMATING FIXED POINTS FOR MULTIVALUED NONSELF-MAPPINGS IN BANACH SPACES. Jong Soo Jung. 1. Introduction Korean J. Math. 16 (2008), No. 2, pp. 215 231 CONVERGENCE OF APPROXIMATING FIXED POINTS FOR MULTIVALUED NONSELF-MAPPINGS IN BANACH SPACES Jong Soo Jung Abstract. Let E be a uniformly convex Banach space

More information

Chapter 1. Optimality Conditions: Unconstrained Optimization. 1.1 Differentiable Problems

Chapter 1. Optimality Conditions: Unconstrained Optimization. 1.1 Differentiable Problems Chapter 1 Optimality Conditions: Unconstrained Optimization 1.1 Differentiable Problems Consider the problem of minimizing the function f : R n R where f is twice continuously differentiable on R n : P

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

1 Introduction and preliminaries

1 Introduction and preliminaries Proximal Methods for a Class of Relaxed Nonlinear Variational Inclusions Abdellatif Moudafi Université des Antilles et de la Guyane, Grimaag B.P. 7209, 97275 Schoelcher, Martinique abdellatif.moudafi@martinique.univ-ag.fr

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

Two-dimensional examples of rank-one convex functions that are not quasiconvex

Two-dimensional examples of rank-one convex functions that are not quasiconvex ANNALES POLONICI MATHEMATICI LXXIII.3(2) Two-dimensional examples of rank-one convex functions that are not quasiconvex bym.k.benaouda (Lille) andj.j.telega (Warszawa) Abstract. The aim of this note is

More information

Iowa State University. Instructor: Alex Roitershtein Summer Homework #1. Solutions

Iowa State University. Instructor: Alex Roitershtein Summer Homework #1. Solutions Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 EXERCISES FROM CHAPTER 1 Homework #1 Solutions The following version of the

More information

Fourth Week: Lectures 10-12

Fourth Week: Lectures 10-12 Fourth Week: Lectures 10-12 Lecture 10 The fact that a power series p of positive radius of convergence defines a function inside its disc of convergence via substitution is something that we cannot ignore

More information

The Journal of Nonlinear Science and Applications

The Journal of Nonlinear Science and Applications J. Nonlinear Sci. Appl. 2 (2009), no. 2, 78 91 The Journal of Nonlinear Science and Applications http://www.tjnsa.com STRONG CONVERGENCE THEOREMS FOR EQUILIBRIUM PROBLEMS AND FIXED POINT PROBLEMS OF STRICT

More information