Convex Analysis and Economic Theory AY Elementary properties of convex functions
|
|
- Stephanie Dennis
- 5 years ago
- Views:
Transcription
1 Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory AY Topic 6: Convex functions I 6.1 Elementary properties of convex functions We may occasionally want to rearrange the definition of convexity to read as follows: f ( x + λ(y x) ) f(x) + λ [ f(y) f(x) ]. Or letting v = y x, we may write f(x + λv) f(x) + λ [ f(x + v) f(x) ]. We start with the following simple, but fundamental, result for concave functions of one variable, cf. Fenchel [2, 2.16, p. 69], Phelps [4, Theorem 1.16, pp. 9 11], or Royden [7, Proposition 5.17, p. 113]. Its proof relies on the following trivial identity, but I shall put a box around it because I have trouble remembering it. x < y < z y = z y z x x+ y x z x z = (1 λ)x+λz where λ = y x z x > 0 and 1 λ = z y z x > 0. The next result is very simple, but is the key to identifying convex and concave functions Theorem (Monotonicity of slopes) Given a function f : I R on an interval in R, for x, y I with x < y define S(x, y) = f(y) f(x), y x the slope of the chord joining the points ( x, f(x) ) and ( y, f(y) ). Then statements (1) (5) are equivalent. 1. The function f is convex. 2. S(x, y) is nondecreasing in x and in y. That is, if x < y < z, then S(x, y) S(x, z) S(y, z). S(x, z) S(x, y) S(y, z) x y z Figure Slopes. KC Border: for Ec 181, src: ConvexFunctions1 v ::16.24
2 KC Border Convex functions I S(x, y) is nondecreasing in x. That is, if x < x < y, then S(x, y) S(x, y). 4. S(x, y) is nondecreasing in y. That is, if x < y < y, then S(x, y) S(x, y ). 5. If x < y < z, then S(x, y) S(y, z). In addition, statements (1 ) (5 ) are equivalent. 1. The function f is strictly convex. 2. S(x, y) is strictly increasing in x and in y. That is, if x < y < z, then S(x, y) < S(x, z) < S(y, z). 3. S(x, y) is strictly increasing in x. That is, if x < x < y, then S(x, y) < S(x, y). 4. S(x, y) is strictly increasing in y. That is, if x < y < y, then S(x, y) < S(x, y ). 5. If x < y < z, then S(x, y) < S(y, z) Exercise Prove Theorem Sample answer: (1) = (2) Let x < y < z belong to I. Then y is the convex combination z y z x x + y x z x z, so the convexity of f implies Subtract f(x) from both sides of (1) to get f(y) z y z x f(x) + y x f(z). (1) z x f(y) f(x) x y z x f(x) + y x z x f(z) and dividing by the positive quantity y x gives S(x, y) S(x, z). v ::16.24 src: ConvexFunctions1 KC Border: for Ec 181,
3 KC Border Convex functions I 6 3 Subtracting f(z) from both sides of (1) gives f(y) f(z) z y z x f(x) + y z z x f(z) and dividing by the negative quantity y z gives S(y, z) S(x, z). Combining everything gives S(x, y) S(x, z) S(y, z). Clearly (2) = (3) and (2) = (4). It is also clear that (3) = (5) and (4) = (5). I will now show that (5) = (1). (5) = (1) Let x, z I and let 0 < λ < 1. Without loss of generality we may take x < z. Let y = (1 λ)x + λy. Then λ = y x z y z x and 1 λ = z x. Clearly x < y < z, so by (5), That is, f is convex. S(x, y) S(y, z), f(y) f(x) y x f(z) f(y), z y (z y) [ f(y) f(x) ] (y x) [ f(z) f(y) ], (z x)f(y) (z y)f(x) + (y x)f(z), f(y) z y z x f(x) + y x z x f(z), f ( (1 λ)x + λz ) (1 λ)f(x) + λf(z). The case of strict convexity is similar. The next lemma is a key to proving results about the continuity of convex functions. It provides a bound on the change in a convex function f for changes in a given direction. Since the graph of f lies below the chord joining ( x, f(x) ) and ( x + v, f(x + v) ), it follows by similar triangles that f(x + δv) f(x) δ [ f(x + v) f(x) ]. Figure shows a nice example. But when f(x + δv) f(x) is negative, as in Figure 6.1.3, this does not help us get a bound on the absolute value of f(x + δv) f(x). But all is not lost. If f(x + δv) f(x) < 0, then we have f(x δv) f(x) 0. (Since x is a convex combination of x δv and x + δv and f is a convex function, the value f(x) cannot be greater than both f(x + δv) and f(x δv).) Then f(x δv) f(x) provides a bound on the absolute value of f(x + δv) f(x), and δ [ f(x v) f(x) ] bounds f(x δv) f(x). See Figure KC Border: for Ec 181, src: ConvexFunctions1 v ::16.24
4 KC Border Convex functions I 6 4 f(x + v) f(x) δ [ f(x + v) f(x) ] f(x + δv) f(x) x x + δv x + v f(x + δv) f(x) δ [ f(x + v) f(x) ] Figure f f(x + δv) f(x) x x + δv Figure x + v f f(x v) f(x) δ [ f(x v) f(x) ] f(x δv) f(x) f(x + δv) f(x) x x + δv x v x δv f(x + δv) f(x) x + v f Figure f(x + δv) f(x) δ max { f(x + v) f(x), f(x v) f(x) } v ::16.24 src: ConvexFunctions1 KC Border: for Ec 181,
5 KC Border Convex functions I Lemma Let C be a convex set of a vector space X and let f : C R be a convex function. Let x belong to C and suppose v satisfies [x v, x + v] C. Let δ [0, 1]. Then f(x + δv) f(x) δ max {f(x + v) f(x), f(x v) f(x)} and f(x δv) f(x) δ max {f(x + v) f(x), f(x v) f(x)}. Consequently, max {f(x + v) f(x), f(x v) f(x)} 0. Proof : Since f is convex, f(x + δv) (1 δ)f(x) + δf(x + v). Rearranging terms yields f(x + δv) f(x) δ [f(x + v) f(x)], (2) and replacing v by v gives f(x δv) f(x) δ [f(x v) f(x)]. (3) Also f(x) 1f(x + δv) + 1 f(x δv). Multiplying by two and rearranging terms 2 2 we obtain f(x) f(x + δv) f(x δv) f(x). (4) Combining (3) and (4) yields f(x) f(x + δv) δ [f(x v) f(x)]. This and (2) imply f(x + δv) f(x) δ max { f(x + v) f(x), f(x v) f(x) }. Reversing the roles of v and v completes the proof. The next result is an immediate consequence of the preceding Theorem For a convex function f : I R defined on a real interval: 1. The function f is continuous at every interior point of I. 2. The left and right derivatives exist and are finite at each interior point of I. Moreover, if f l and f r denote the left and right derivatives of f, respectively, and x < y are interior points of I, then f l(x) f r(x) f l(y) f r(y). In particular, the left and right derivatives are both nondecreasing on the interior of I. KC Border: for Ec 181, src: ConvexFunctions1 v ::16.24
6 KC Border Convex functions I The function f is differentiable everywhere on the interior of I except for at most countably many points. Proof : 1. Let x be an interior point of I and choose v small enough so that 0 < v 1 and [x v, x + v] I. Now let ε > 0 be given, and choose δ > 0 so that δ max f(x ± v) f(x) < ε. Then by Lemma 6.1.3, if y x < δv, then f(y) f(x) < ε. That is, f is continuous at x. 2. This follows from the Monotonicity of Slopes Theorem 6.1.1, and the definitions f l(x) = lim v 0 f(x v) f(x) v and f r(x) f(x + v) f(x) = lim. v 0 v 3. Given (2), the only way f can fail to be differentiable at x is if f l(x) < f r(x), in which case there exists some rational number q x satisfying f l(x) < q x < f r(x). It follows from (2) that if x < y are both points of nondifferentiability, then q x < q y. The conclusion follows from the countability of the rational numbers. There are some practical corollaries that allow us to use derivatives to identify concave and convex functions Corollary A differentiable function f : I R on a real interval is concave if and only if its derivative is nonincreasing. It is convex if and only if its derivative is nondecreasing. A twice differentiable function f : I R on a real interval is concave if and only if its second derivative is everywhere nonpositive. It is convex if and only if its second derivative is everywhere nonnegative. Another characterization of differentiable concave and convex functions is in terms of the subgradient inequality, which we shall deal with in more depth in Section Theorem (Concave/convex functions lie below/above tangent lines) Let I be an interval of reals, let f : I R, let x be an interior point of I, and assume that f is differentiable at x. If f is convex, then for every y in I, ( ) x, f(x) f(x) + f (x) (y x) f(y). If f is strictly convex, then for every y in I, f(x) + f (x) (y x) < f(y) for y x. f f(x) + f (x) (y x) v ::16.24 src: ConvexFunctions1 KC Border: for Ec 181,
7 KC Border Convex functions I 6 7 If f is concave, then for every y in I, f(x) + f (x) (y x) f(y). If f is strictly concave, then for every y in I, f(x) + f (x) (y x) > f(y) for y x. Proof for the concave case: By the definition of concavity and rearranging gives f ( x + λ(y x) ) f(x) + λ ( f(y) f(x) ), f ( x + λ(y x) ) f(x) λ ( f(y) f(x) ). Dividing both sides by λ > 0 and multiplying the left-hand side by (y x)/(y x) yields f ( x + λ(y x) ) f(x) (y x) f(y) f(x). λ(y x) Letting λ 0, the left hand side converges to f (x) (y x). For the case that f is strictly concave, we need a strict inequality, but the argument above just gives us a weak one. But the Monotonicity of Slopes Theorem supplies us with what we need. Let y x and assume first that y > x, and let z be midway between x and y. Then f(z) f(x) z x f (x) by the above, but f(y) f(x) < f(z) f(x). Multiplying by y x > 0 implies f(y) f(x) < f (x)(y x), y x z x as desired. The case y < x is similar: The argument for the concave case now shows that f(z) f(x) z x f (x), since z x < 0, and monotonicity of slopes gives f(y) f(x) y x > f(z) f(x) z x, but y x < 0, so we reverse the inequality by multiplication and again get f(y) f(x) < f (x)(y x). The converse is true as the following clever argument shows Theorem Let I be an open interval of reals, let f : I R, and assume that f is differentiable at every point in I. If f(x) + f (x) (y x) f(y), for all x, y I, then f is concave. If f(x) + f (x) (y x) f(y), for all x, y I, then f is convex. Proof : We prove this only the case for where f is concave. For each x I, define the function h x by h x (y) = f(x) + f (x) (y x). Each h x is affine (and hence concave), f h x for each x, and f(x) = h x (x). Thus so by Exercise 1.3.3(5), f is concave. f = inf x U h x, KC Border: for Ec 181, src: ConvexFunctions1 v ::16.24
8 KC Border Convex functions I Exercise (Convexity and classical inequalities) Theorem can Collect more of these. Check be used to derive a number of well-known inequalities, including: 1. For all x R, 1 e x x e x 1, with strict inequalities for x 0. Hint: Apply Theorem to the case x = For all x > 0, x 1 ln x. Hint: Apply Theorem to the case x = 1. By refining the argument use to prove Theorem 6.1.6, you should be able to prove the following Proposition Let I be an interval of reals, let f : I R be convex, let x be an interior point of I. Let c satisfy Then for every y in I, f l(x) c f r(x). f(x) + c (y x) f(y). If f is strictly convex, then for every y in I, f(x) + c (y x) < f(y) for y x Exercise Prove Proposition Find the analogous result for concave functions. What can you say if x is on the boundary of the interval I? out [3]. Add Jensen s Inequality here? 6.2 Extrema of convex and concave functions A useful corollary of Theorem is the following result on extrema Theorem (First order conditions are necessary and sufficient) Let I be an interval of reals, let f : I R, let x be an interior point of I, and assume that f is differentiable at x. If f is concave, then f (x) = 0 if and only if x maximizes f over I. If f is convex, then f (x) = 0 if and only if x minimizes f over I. Proof : If f is concave, then by Theorem 6.1.6, we have f(x)+f (x) (y x) f(y) for all I. Thus f (x) = 0 implies f(x) f(y) for all y I. For the converse, we may invoke the usual first order condition for a maximum. The convex case is similar. v ::16.24 src: ConvexFunctions1 KC Border: for Ec 181,
9 KC Border Convex functions I Theorem (Local extrema are global) Let C be a nonempty convex subset of a topological vector space. If f : C R is concave, then every local maximizer of f is a global maximizer of f over C. If f : C R is convex, then every local minimizer of f is a global minimizer of f over C. Proof : We prove the result for the case where f is concave and x is a local maximizer. That is, there is a neighborhood V of zero such that for all v V we have f(x ) f(x + v). Now pick any x belonging to C. By continuity of scalar multiplication, there is some δ > 0 such that for all 0 λ δ we have λ(x x ) V, so By the definition of concavity, f(x ) f ( x + λ(x x ) ). f ( x + λ(x x ) ) f(x ) + λ [ f(x) f(x ) ] for all 0 λ 1, so combining these gives for 0 < λ δ, which implies f(x ) f(x ) + λ [ f(x) f(x ) ], f(x) f(x ) 0. Since x was an arbitrary point in C, we see that x maximizes f over C Corollary If f is strictly concave, a local maximum is a strict global maximum. 6.3 Continuity of convex functions If we adopt the convex analyst s approach that a concave function assumes the value outside its effective domain, then we are likely to have discontinuities at the boundary of the effective domain. Thus continuity is too much to expect as a global property of concave or convex functions. However, we shall see below that proper convex and concave functions are Lipschitz continuous on the relative interiors of their effective domains. However, a concave or convex function can be very badly behaved on the boundary of its domain Example (Bad behavior, Rockafellar [6, p. 53]) Let D be the open unit disk in R 2, and let S be the unit circle. Define f to be zero on the disk D, and let f assume any values in [0, ] on S. Then f is convex. Note that f can have both types of discontinuities along S, so convexity or concavity places virtually no restrictions on the boundary behavior. In fact, by taking f to be the indicator of a non-borel subset of S, convexity by itself does not even guarantee measurability. KC Border: for Ec 181, src: ConvexFunctions1 v ::16.24
10 KC Border Convex functions I Lemma (Local continuity of convex functions) Let f : X R be a convex function on a topological vector space. If f is bounded above on a neighborhood of an interior point of dom f, then f is continuous at that point. Proof : Assume that x dom f and that there is a neighborhood U of x such that y U = f(y) < f(x) + µ. I need to do something about this argument. Without loss of generality we may assume that U is of the form x + V where V is a circled 1 neighborhood of zero. Fix ε > 0 and choose 0 < δ 1 so that δµ < ε. I claim that for every y x + δv we have f(y) f(x) < ε. So let y x + δv, and pick v V such that y = x + δv. Since V is circled, the line segment [x v, x + v] is included in x + δv. Lemma we have f(y) f(x) < δ max{f(x + v) f(x), f(x v) f(x)} < δµ < ε. By This shows that f is continuous at x. Amazingly, continuity at a single interior point implies global continuity for convex functions Theorem (Global continuity of convex functions) Let f : X R be a convex function on a topological vector space, and let The following statements are equivalent. 1. f is continuous on C. 2. f is upper semicontinuous on C. C = int dom f. 3. f is bounded above on a neighborhood of each point in C. 4. f is bounded above on a neighborhood of some point in C. 5. f is continuous at some point in C. 1 Recall (Definition A.11.2) that a set A is circled if for any point x A, the line segment joining x and x is included A. In any tvs, a neighborhood of zero includes a circled open neighborhood. In R m every Euclidean ball centered at zero is circled. v ::16.24 src: ConvexFunctions1 KC Border: for Ec 181,
11 KC Border Convex functions I 6 11 Proof : (1) = (2) Obvious. (2) = (3) Assume that f is upper semicontinuous and x C. Then the set {y C : f(y) < f(x) + 1} is an open neighborhood of x on which f is bounded. (3) = (4) This is trivial. (4) = (5) This is Lemma (5) = (1) Suppose f is continuous at the point x, and let y be any other point in C. Since scalar multiplication is continuous and C is open, since y = x + 1(y x) C, there is some α > 1 so that z = x + α(y x) C. Then y = (1 λ)z + λx = z + λ(x z) where λ = (α 1)/α. Also, since f is continuous at x, there is a circled neighborhood V of zero such that x + V C and f is bounded above on x + V, say by µ. I claim that f is bounded above on y + λv. y + λv z x + v x x + V y = z + λ(x z) y + λv To see this, let v V. Then y + λv = λ(x + v) + (1 λ)z C. The convexity of f thus implies f(y + λv) λf(x + v) + (1 λ)f(z) λµ + (1 λ)f(z). That is, f is bounded above by λµ + (1 λ)f(z) on y + λv. So by Lemma 6.3.2, f is continuous at y Theorem In a finite dimensional topological vector space, every convex function is continuous on the interior of its domain. Proof : Without loss of generality, we may assume x + εe 2 we are dealing with R m. Let f : C R be a convex function defined on a convex subset C of R m. V Let x be an interior point of C. Let {e 1,..., e m } x εe 1 be the standard basis, and pick ε > 0 such that x ± εe i C for each i = 1,..., m. Let V be the x x + εe 1 x εe 2 KC Border: for Ec 181, src: ConvexFunctions1 v ::16.24
12 KC Border Convex functions I 6 12 convex hull of {x±εe i }. Then x belongs to the interior of V. Moreover, since C is convex, V C. Let µ = max{f(x ± εe i )}. Now any point y V may be written as a convex combination m m y = α i (x + εe i ) + β i (x εe i ). Since f is convex, f(y) i i=1 α i f(x + e i ) + i i=1 β i f(x e i ) µ. This shows that f is bounded above on the neighborhood V of x. By Lemma the function f is continuous at x Corollary In a finite dimensional topological vector space, every convex function is continuous on the relative interior of its domain. A convex function on a convex subset of an infinite dimensional topological vector space need not be continuous on the interior of its domain. For instance, a discontinuous linear functional on an infinite dimensional topological vector space is convex. (Recall Example ) If the topology of a tvs is generated by a norm, continuity of a convex function at an interior point implies local Lipschitz continuity. The proof of the next result is adapted from Roberts and Varberg [5] Theorem Let f : X R be a convex function on a normed tvs. If f is continuous at the interior point x of dom f, then f is Lipschitz continuous on a neighborhood of x. That is, there exists δ > 0 and µ > 0, such that B δ (x) dom f and for y, z B δ (x), we have f(y) f(z) µ y z. Proof : Since f is continuous at x, there exists δ > 0 such that B 2δ (x) dom f and w, z B 2δ (x) implies f(w) f(z) < 1. Given distinct y and z in B δ (x), let α = y z and let w = y + δ (y z), so w y = δ y z = δ. Then w α α belongs to B 2δ (x) and we may write y as the convex combination y = α w+ δ z. α+δ α+δ Therefore f(y) α α + δ f(w) + Subtracting f(z) from each side gives f(y) f(z) α α + δ δ α + δ f(z). [ f(w) f(z) ] < α α + δ. Switching the roles of y and z allows us to conclude f(y) f(z) < α α + δ < α δ = 1 y z, δ so µ = 1/δ is the desired Lipschitz constant. w 2δ δ y x z v ::16.24 src: ConvexFunctions1 KC Border: for Ec 181,
13 KC Border Convex functions I 6 13 It turns out that strictly convex functions on infinite dimensional spaces are quite special. In order for a continuous function to be strictly convex on a compact convex set, the relative topology of the set must be metrizable. See Choquet [1, p. II-139]. References [1] G. Choquet Lectures on analysis, volume 1. Reading, Massachusetts: Benjamin. [2] W. Fenchel Convex cones, sets, and functions. Lecture notes, Princeton University, Department of Mathematics. From notes taken by D. W. Blackett, Spring [3] G. H. Hardy, J. E. Littlewood, and G. Pólya Inequalities, 2d. ed. Cambridge: Cambridge University Press. [4] R. R. Phelps Convex functions, monotone operators and differentiability, 2d. ed. Number 1364 in Lecture Notes in Mathematics. Berlin: Springer Verlag. [5] A. W. Roberts and D. E. Varberg Another proof that convex functions are locally Lipschitz. American Mathematical Monthly 81: [6] R. T. Rockafellar Convex analysis. Number 28 in Princeton Mathematical Series. Princeton: Princeton University Press. [7] H. L. Royden Real analysis, 3d. ed. New York: Macmillan. KC Border: for Ec 181, src: ConvexFunctions1 v ::16.24
14
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 informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 7: Quasiconvex Functions I 7.1 Level sets of functions For an extended real-valued
More informationRockefellar s Closed Functions
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Fall 2018 Winter 2019 Topic 21: Rockefellar s Closed Functions 21.1 Closed convex functions Convex analysts
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 0: Vector spaces 0.1 Basic notation Here are some of the fundamental sets and spaces
More informationConvex Analysis and Economic Theory Fall 2018 Winter 2019
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Fall 2018 Winter 2019 Topic 18: Differentiability 18.1 Differentiable functions In this section I want
More informationConvex 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 informationLocal 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 informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationCHAPTER 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 informationOptimality Conditions for Nonsmooth Convex Optimization
Optimality Conditions for Nonsmooth Convex Optimization Sangkyun Lee Oct 22, 2014 Let us consider a convex function f : R n R, where R is the extended real field, R := R {, + }, which is proper (f never
More informationTechnical Results on Regular Preferences and Demand
Division of the Humanities and Social Sciences Technical Results on Regular Preferences and Demand KC Border Revised Fall 2011; Winter 2017 Preferences For the purposes of this note, a preference relation
More information(convex combination!). Use convexity of f and multiply by the common denominator to get. Interchanging the role of x and y, we obtain that f is ( 2M ε
1. Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional
More informationConvex 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 informationOptimization 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 informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Supplement A: Mathematical background A.1 Extended real numbers The extended real number
More informationContinuity of convex functions in normed spaces
Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional
More informationConvex 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 informationConvexity in R n. The following lemma will be needed in a while. Lemma 1 Let x E, u R n. If τ I(x, u), τ 0, define. f(x + τu) f(x). τ.
Convexity in R n Let E be a convex subset of R n. A function f : E (, ] is convex iff f(tx + (1 t)y) (1 t)f(x) + tf(y) x, y E, t [0, 1]. A similar definition holds in any vector space. A topology is needed
More informationCalculus and Maximization I
Division of the Humanities and Social Sciences Calculus and Maximization I KC Border Fall 2000 1 Maxima and Minima A function f : X R attains a global maximum or absolute maximum over X at x X if f(x )
More information2019 Spring MATH2060A Mathematical Analysis II 1
2019 Spring MATH2060A Mathematical Analysis II 1 Notes 1. CONVEX FUNCTIONS First we define what a convex function is. Let f be a function on an interval I. For x < y in I, the straight line connecting
More informationSummary 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 informationChapter 2 Convex Analysis
Chapter 2 Convex Analysis The theory of nonsmooth analysis is based on convex analysis. Thus, we start this chapter by giving basic concepts and results of convexity (for further readings see also [202,
More informationBASICS 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 informationPreliminary draft only: please check for final version
ARE211, Fall2012 CALCULUS4: THU, OCT 11, 2012 PRINTED: AUGUST 22, 2012 (LEC# 15) Contents 3. Univariate and Multivariate Differentiation (cont) 1 3.6. Taylor s Theorem (cont) 2 3.7. Applying Taylor theory:
More informationConstrained maxima and Lagrangean saddlepoints
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 10: Constrained maxima and Lagrangean saddlepoints 10.1 An alternative As an application
More informationWeek 3: Faces of convex sets
Week 3: Faces of convex sets Conic Optimisation MATH515 Semester 018 Vera Roshchina School of Mathematics and Statistics, UNSW August 9, 018 Contents 1. Faces of convex sets 1. Minkowski theorem 3 3. Minimal
More informationSemicontinuous functions and convexity
Semicontinuous functions and convexity Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto April 3, 2014 1 Lattices If (A, ) is a partially ordered set and S is a subset
More informationExtreme points of compact convex sets
Extreme points of compact convex sets In this chapter, we are going to show that compact convex sets are determined by a proper subset, the set of its extreme points. Let us start with the main definition.
More informationWhat to remember about metric spaces
Division of the Humanities and Social Sciences What to remember about metric spaces KC Border These notes are (I hope) a gentle introduction to the topological concepts used in economic theory. If the
More informationLECTURE 15: COMPLETENESS AND CONVEXITY
LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other
More information1 Overview. 2 A Characterization of Convex Functions. 2.1 First-order Taylor approximation. AM 221: Advanced Optimization Spring 2016
AM 221: Advanced Optimization Spring 2016 Prof. Yaron Singer Lecture 8 February 22nd 1 Overview In the previous lecture we saw characterizations of optimality in linear optimization, and we reviewed the
More informationExtreme Abridgment of Boyd and Vandenberghe s Convex Optimization
Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Compiled by David Rosenberg Abstract Boyd and Vandenberghe s Convex Optimization book is very well-written and a pleasure to read. The
More informationAliprantis, Border: Infinite-dimensional Analysis A Hitchhiker s Guide
aliprantis.tex May 10, 2011 Aliprantis, Border: Infinite-dimensional Analysis A Hitchhiker s Guide Notes from [AB2]. 1 Odds and Ends 2 Topology 2.1 Topological spaces Example. (2.2) A semimetric = triangle
More informationConvex Analysis and Optimization Chapter 2 Solutions
Convex Analysis and Optimization Chapter 2 Solutions Dimitri P. Bertsekas with Angelia Nedić and Asuman E. Ozdaglar Massachusetts Institute of Technology Athena Scientific, Belmont, Massachusetts http://www.athenasc.com
More information6.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 informationTHE 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(c) For each α R \ {0}, the mapping x αx is a homeomorphism of X.
A short account of topological vector spaces Normed spaces, and especially Banach spaces, are basic ambient spaces in Infinite- Dimensional Analysis. However, there are situations in which it is necessary
More informationHelly'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 informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationConvex Optimization and an Introduction to Congestion Control. Lecture Notes. Fabian Wirth
Convex Optimization and an Introduction to Congestion Control Lecture Notes Fabian Wirth August 29, 2012 ii Contents 1 Convex Sets and Convex Functions 3 1.1 Convex Sets....................................
More informationh(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote
Real Variables, Fall 4 Problem set 4 Solution suggestions Exercise. Let f be of bounded variation on [a, b]. Show that for each c (a, b), lim x c f(x) and lim x c f(x) exist. Prove that a monotone function
More informationWhen are Sums Closed?
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Fall 2018 Winter 2019 Topic 20: When are Sums Closed? 20.1 Is a sum of closed sets closed? Example 0.2.2
More informationLecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University
Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................
More informationThe 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 informationAppendix B Convex analysis
This version: 28/02/2014 Appendix B Convex analysis In this appendix we review a few basic notions of convexity and related notions that will be important for us at various times. B.1 The Hausdorff distance
More informationOn 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 informationA SET OF LECTURE NOTES ON CONVEX OPTIMIZATION WITH SOME APPLICATIONS TO PROBABILITY THEORY INCOMPLETE DRAFT. MAY 06
A SET OF LECTURE NOTES ON CONVEX OPTIMIZATION WITH SOME APPLICATIONS TO PROBABILITY THEORY INCOMPLETE DRAFT. MAY 06 CHRISTIAN LÉONARD Contents Preliminaries 1 1. Convexity without topology 1 2. Convexity
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationMath 341: Convex Geometry. Xi Chen
Math 341: Convex Geometry Xi Chen 479 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca CHAPTER 1 Basics 1. Euclidean Geometry
More informationConvex Analysis Background
Convex Analysis Background John C. Duchi Stanford University Park City Mathematics Institute 206 Abstract In this set of notes, we will outline several standard facts from convex analysis, the study of
More informationDifferentiating an Integral: Leibniz Rule
Division of the Humanities and Social Sciences Differentiating an Integral: Leibniz Rule KC Border Spring 22 Revised December 216 Both Theorems 1 and 2 below have been described to me as Leibniz Rule.
More informationDiscussion Paper Series
Discussion Paper Series 2004 27 Department of Economics Royal Holloway College University of London Egham TW20 0EX 2004 Andrés Carvajal. Short sections of text, not to exceed two paragraphs, may be quoted
More informationEC9A0: 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 informationSubdifferential 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 informationJensen s inequality for multivariate medians
Jensen s inequality for multivariate medians Milan Merkle University of Belgrade, Serbia emerkle@etf.rs Given a probability measure µ on Borel sigma-field of R d, and a function f : R d R, the main issue
More informationConvex Optimization Theory. Chapter 5 Exercises and Solutions: Extended Version
Convex Optimization Theory Chapter 5 Exercises and Solutions: Extended Version Dimitri P. Bertsekas Massachusetts Institute of Technology Athena Scientific, Belmont, Massachusetts http://www.athenasc.com
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More informationMiscellaneous Notes on Optimization Theory and Related Topics or A Dessert Course in Optimization *
Division of the Humanities and Social Sciences Miscellaneous Notes on Optimization Theory and Related Topics or A Dessert Course in Optimization * KC Border Continually under revision. Last Seriously Revised:
More informationSWFR ENG 4TE3 (6TE3) COMP SCI 4TE3 (6TE3) Continuous Optimization Algorithm. Convex Optimization. Computing and Software McMaster University
SWFR ENG 4TE3 (6TE3) COMP SCI 4TE3 (6TE3) Continuous Optimization Algorithm Convex Optimization Computing and Software McMaster University General NLO problem (NLO : Non Linear Optimization) (N LO) min
More informationA Brøndsted-Rockafellar Theorem for Diagonal Subdifferential Operators
A Brøndsted-Rockafellar Theorem for Diagonal Subdifferential Operators Radu Ioan Boţ Ernö Robert Csetnek April 23, 2012 Dedicated to Jon Borwein on the occasion of his 60th birthday Abstract. In this note
More informationIntegral Jensen inequality
Integral Jensen inequality Let us consider a convex set R d, and a convex function f : (, + ]. For any x,..., x n and λ,..., λ n with n λ i =, we have () f( n λ ix i ) n λ if(x i ). For a R d, let δ a
More informationBest approximations in normed vector spaces
Best approximations in normed vector spaces Mike de Vries 5699703 a thesis submitted to the Department of Mathematics at Utrecht University in partial fulfillment of the requirements for the degree of
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Conve Analysis and Economic Theory Winter 2018 Toic 16: Fenchel conjugates 16.1 Conjugate functions Recall from Proosition 14.1.1 that is
More informationL p Spaces and Convexity
L p Spaces and Convexity These notes largely follow the treatments in Royden, Real Analysis, and Rudin, Real & Complex Analysis. 1. Convex functions Let I R be an interval. For I open, we say a function
More informationJournal 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 informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationConvex Analysis and Optimization Chapter 4 Solutions
Convex Analysis and Optimization Chapter 4 Solutions Dimitri P. Bertsekas with Angelia Nedić and Asuman E. Ozdaglar Massachusetts Institute of Technology Athena Scientific, Belmont, Massachusetts http://www.athenasc.com
More informationImmerse Metric Space Homework
Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps
More informationMA651 Topology. Lecture 10. Metric Spaces.
MA65 Topology. Lecture 0. Metric Spaces. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Linear Algebra and Analysis by Marc Zamansky
More informationContents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3
Analysis Math Notes Study Guide Real Analysis Contents Ordered Fields 2 Ordered sets and fields 2 Construction of the Reals 1: Dedekind Cuts 2 Metric Spaces 3 Metric Spaces 3 Definitions 4 Separability
More informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More information3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
More informationDivision of the Humanities and Social Sciences. Sums of sets, etc.
Division of the Humanities and Social Sciences Sums of sets, etc. KC Border September 2002 Rev. November 2012 Rev. September 2013 If E and F are subsets of R m, define the sum E + F = {x + y : x E; y F
More informationUNDERGROUND 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 informationAn introduction to some aspects of functional analysis
An introduction to some aspects of functional analysis Stephen Semmes Rice University Abstract These informal notes deal with some very basic objects in functional analysis, including norms and seminorms
More informationChapter 2 Metric Spaces
Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics
More informationIntroduction to Convex Analysis Microeconomics II - Tutoring Class
Introduction to Convex Analysis Microeconomics II - Tutoring Class Professor: V. Filipe Martins-da-Rocha TA: Cinthia Konichi April 2010 1 Basic Concepts and Results This is a first glance on basic convex
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets
FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES CHRISTOPHER HEIL 1. Compact Sets Definition 1.1 (Compact and Totally Bounded Sets). Let X be a metric space, and let E X be
More information3.1 Convexity notions for functions and basic properties
3.1 Convexity notions for functions and basic properties We start the chapter with the basic definition of a convex function. Definition 3.1.1 (Convex function) A function f : E R is said to be convex
More informationSome 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 informationSOLUTIONS TO ADDITIONAL EXERCISES FOR II.1 AND II.2
SOLUTIONS TO ADDITIONAL EXERCISES FOR II.1 AND II.2 Here are the solutions to the additional exercises in betsepexercises.pdf. B1. Let y and z be distinct points of L; we claim that x, y and z are not
More informationThe small ball property in Banach spaces (quantitative results)
The small ball property in Banach spaces (quantitative results) Ehrhard Behrends Abstract A metric space (M, d) is said to have the small ball property (sbp) if for every ε 0 > 0 there exists a sequence
More informationLecture 2: Convex Sets and Functions
Lecture 2: Convex Sets and Functions Hyang-Won Lee Dept. of Internet & Multimedia Eng. Konkuk University Lecture 2 Network Optimization, Fall 2015 1 / 22 Optimization Problems Optimization problems are
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More informationTheorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers
Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower
More informationDedicated to Michel Théra in honor of his 70th birthday
VARIATIONAL GEOMETRIC APPROACH TO GENERALIZED DIFFERENTIAL AND CONJUGATE CALCULI IN CONVEX ANALYSIS B. S. MORDUKHOVICH 1, N. M. NAM 2, R. B. RECTOR 3 and T. TRAN 4. Dedicated to Michel Théra in honor of
More informationNotions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy
Banach Spaces These notes provide an introduction to Banach spaces, which are complete normed vector spaces. For the purposes of these notes, all vector spaces are assumed to be over the real numbers.
More informationMORE EXERCISES FOR SECTIONS II.1 AND II.2. There are drawings on the next two pages to accompany the starred ( ) exercises.
Math 133 Winter 2013 MORE EXERCISES FOR SECTIONS II.1 AND II.2 There are drawings on the next two pages to accompany the starred ( ) exercises. B1. Let L be a line in R 3, and let x be a point which does
More informationEpiconvergence and ε-subgradients of Convex Functions
Journal of Convex Analysis Volume 1 (1994), No.1, 87 100 Epiconvergence and ε-subgradients of Convex Functions Andrei Verona Department of Mathematics, California State University Los Angeles, CA 90032,
More informationOn 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 informationSubdifferentiability and the Duality Gap
Subdifferentiability and the Duality Gap Neil E. Gretsky (neg@math.ucr.edu) Department of Mathematics, University of California, Riverside Joseph M. Ostroy (ostroy@econ.ucla.edu) Department of Economics,
More informationThe sum of two maximal monotone operator is of type FPV
CJMS. 5(1)(2016), 17-21 Caspian Journal of Mathematical Sciences (CJMS) University of Mazandaran, Iran http://cjms.journals.umz.ac.ir ISSN: 1735-0611 The sum of two maximal monotone operator is of type
More informationChapter 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 informationLegendre-Fenchel transforms in a nutshell
1 2 3 Legendre-Fenchel transforms in a nutshell Hugo Touchette School of Mathematical Sciences, Queen Mary, University of London, London E1 4NS, UK Started: July 11, 2005; last compiled: August 14, 2007
More informationLecture 4: Optimization. Maximizing a function of a single variable
Lecture 4: Optimization Maximizing or Minimizing a Function of a Single Variable Maximizing or Minimizing a Function of Many Variables Constrained Optimization Maximizing a function of a single variable
More informationIntroduction to Correspondences
Division of the Humanities and Social Sciences Introduction to Correspondences KC Border September 2010 Revised November 2013 In these particular notes, all spaces are metric spaces. The set of extended
More informationA LITTLE REAL ANALYSIS AND TOPOLOGY
A LITTLE REAL ANALYSIS AND TOPOLOGY 1. NOTATION Before we begin some notational definitions are useful. (1) Z = {, 3, 2, 1, 0, 1, 2, 3, }is the set of integers. (2) Q = { a b : aεz, bεz {0}} is the set
More informationDesign and Analysis of Algorithms Lecture Notes on Convex Optimization CS 6820, Fall Nov 2 Dec 2016
Design and Analysis of Algorithms Lecture Notes on Convex Optimization CS 6820, Fall 206 2 Nov 2 Dec 206 Let D be a convex subset of R n. A function f : D R is convex if it satisfies f(tx + ( t)y) tf(x)
More informationLecture 1: Convex Sets January 23
IE 521: Convex Optimization Instructor: Niao He Lecture 1: Convex Sets January 23 Spring 2017, UIUC Scribe: Niao He Courtesy warning: These notes do not necessarily cover everything discussed in the class.
More information