Asymptotic at infinity. g(x) g(x) Tangential at finite point. slope y. slope y
|
|
- Chester Andrews
- 6 years ago
- Views:
Transcription
1 Conjugate Transformations Since sup x2c [yx g(x)] = inf [g(x) yx] it is geometrically clear that y 2Diff there is a number t such that the graph of the linear equation : t + yx "supports" g : C, in that it is "under and comes "arbitrarily close" to (epi g), as shown in the following two examples.refer Figure x2c Asymptotic at infinity g(x) Tangential at finite point g(x) t t slope y x slope y x Asymptotic Support Tangential Support Figure : Asymptotic and Tangential supports It is also clear that such a y 2 D gives rise to the conjugate transform value h(y) = t. In essence, h : D comes form the "envelope" of g : C, namely, all "linear supports" (y; t) of g : C. If there are no such supports, D = f;g and g : C has no conjugate transform. For example, g(x) def = exp x has no supports and hence no conjugate transform when C = < but has supports and hence a conjugate transform when C is bounded from above, say C =( ; +]. If a support (y; t) is tangential at a point say(~x; g(~x)), and if g is differentiable at ~x, note that y = g 0 (~x). On the other hand, note that not every derivative g 0 (~x) at some ~x 2 (C) produces a support (y; t) with y = g 0 (~x). Also, note that the following example shows that the tangential supports can occur at a point (~x; g(~x)) where g is not differentiable.
2 Refer Figure 2 g : C where C = [ ; +] and g(x) = q jxj has infinitely many supports at (0,0) namely, all straight lines through (0; 0) with slope y 2 [ ; +]. It also has infinitely many supports at ( ; +), namely, all straight lines through ( ; ) with slope y 2 ( ; ]. Finally, it has infinitely many supports at (; ), namely, all straight lines through (; ) with slope y 2 [; +). None of these supports occur where g is differentiable, and no points at which g is differentiable produce a support. The support slopes y are the graph of a multivalued termed as subderivative of g. g x dg x Figure 2: Graph depicting the function and its subderivative 2
3 Refer Figure 3 The range in this example is just <, is the domain D of the conjugate transform h : D whose graph and epigraph are easily obtained either analytically or geometrically. Note that g : C is not a closed convex function (because it is not convex), but h : D is (as previously established in the general case). The of h : D is in fact just h 0 (y), except at points y where h is not differentiable; at which points it has a continuum of multivariables (a property that is shared by all convex functions). The in this example just [ ; +], is of course the domain C μ of the conjugate transform μg : μc of h : D. the graph and epigraph of μg : μc are easily obtained either analytically or geometrically as is the graph of its Note that C C μ and g(x) μg(x) for each x 2 C (previously proved in the general case). h y dh y g x dg x Figure 3: Graph depicting a convex function and its subderivative 3
4 In fact it can be shown in general that μg : μc is the "closed convex hull" of g : C, in that (epi μg) is the "closed convex hull" of (epi g) namely the intersect of all closed convex sets containing (epi g). Note also that the graph =f(x; y)=y is a subset of the graph =f(x; μ y)=y and that both are monotone in the sense that (y y 2 )(x x 2 ) 0 when points (x ;y ) and (x 2 ;y 2 ) belong to such a graph. In fact μ is the completion of in the sense that there is "no monotone curve" larger than μ (i.e., properly containing μ and hence ). These properties of and μ can be proved in the general case, as can the property that the graph is simply the "inverse" of the graph : a fact that will enable us to calculate the conjugate transform h : D of g : C by "subdifferentiation" of g : C followed by "completion" of, then "inversion" of, and finally the "integration" of. In equilibrium problems, (rather than optimization problems), we shall see that complete monotone curves arise from modeling (rather than objective function g : C). Since we have just seen that convex functions and their subderivatives arise naturally from conjugate transformation (even when the function being transformed is not convex), we need to take a careful look at convex functions and their differentiability property. It is not hard to see that a function f defined on a subset I of < is convex iff I is an interval (the only convex subsets of <) andalso f(s 2 )» s 3 s 2 s 3 s f(s )+ s 2 s s 3 s f(s 3 ):::::(Λ) when s < s 2 < s 3 and all are in I. This inequality (*) is equivalent to each of the three inequalities, f(s 2 ) f(s )» f(s 3) f(s )» f(s 3) f(s 2 ) :::::(ΛΛ) s 2 s s 3 s s 3 s 2 In particular, subtracting f(s ) from both sides of (*) and dividing by s 2 s gives the left-hand inequality (**); while multiplying (*) by, adding f(s 3 ) to both sides of the resulting inequality, and then dividing by s 3 s 2 gives the 4
5 right-hand inequality (**). Manipulation of each of the three inequalities (**) to give (*) is even easier. Consequently, we infer that a function f defined on a subset I of < is convex iff I is an interval and inequalities (**) are satisfied when s < s 2 < s 3 and all are in I. This characterization of convex functions f : I in terms of the "difference quotients" in (**) is the key to establishing the differentiability properties of convex functions. Theorem If f is convex on I <, then. f 0 def f (s+ffi) f (s) + = lim ffi!0+ exists and is either finite or for each s 2 I ffi οfright hand end point ofig, 2. f 0 def f (s+ffi) f (s) = lim ffi!0 exists and is either finite or + for each s 2 I ffi ο fleft hand end point ofig, 3. On the (int I) both the "left hand derivative" f 0 and the "right hand derivative" f 0 are finite non decreasing functions, and + f 0» f 0 + for each s 2(int I), 4. the sub-derivative def = ft 2 R=f(s)+tffi» f(s + ffi); 8ffi 2 I fsgg is given by the = 8 >< >: 5. f is continuous on (int I), (-;f 0 + (s)]) if s is the left-hand endpoint of I [f 0 (s);f0 + (s)] if s 2(int I) [f 0 (s); +] ifs is the right-hand endpoint of I 6. f is differentiable at s 2(int I) contains a single point t, in which case f 0 (s) =t = f 0 (s) =f 0 + (s), 7. f 00 (s) 0foreach s 2(int I) for which f 00 (s) exists, 8. if e is an endpoint ofi, then the lim s!e f(s) exists and is either finite or + and the lim s!e f(s)» f(e) whene 2 I 5
6 Proof: Straight-forward exercise by way of inequality (**) and standard arguments from analysis, when done in the stated order. Theorem: If f 00 exists on an open interval I and f 00 (s) 08s 2 I, then,. f is convex on I, 2. f is strictly convex on I iff f 00 (s) is positive except possibly at isolated Proof: points of I. f(s 3 ) f(s 2 ) s 3 s 2 f(s 2) f(s ) s 2 s = f 0 (s 5 ) f 0 (s 4 )=f 00 (s 6 )(s 5 s 4 ) 0 The remainder follows from inequality (**) differentiation and integration. If g : C with C < has a conjugate transform h : D then g : C also has a closed convex hull function μg : C μ to which the preceding theorems can be applied (with f =μg and I = C. μ In particular, the graph is a subset of the graph μ which is itself a complete monotone curve. In fact = μ iff g : C is itself convex and closed; in which case g : C = g : C μ and hence g : C and h : D are conjugate functions. Conjugate functions g : C and h : D can be defined (or constructed) directly from a given complete monotone curve andapoint(a; b) 2 a construction that is the key to transforming equilibrium problems into useful optimization problems. the construction is illustrated graphically in Figure 4. monotone and complete. fl(s) def = ft=(s; t) 2 g; s 2 domain( ) fl (t) def = fs=(s; t) 2 g; s 2 range( ) R g(x) def b ab = fl(s)ds + C R def x = fx= a 2 a R h(y) def y = b fl (t)dt + ab D R def y = fy= 2 b fl(s)d(s); convergesg fl (t)d(t); convergesg 6
7 t y b a x Due to this area xy<=g(x)+h(y) s Figure 4: Complete monotone curve depicting inequality Using the area interpretation of the definite integrals shows that: xy» g(x)+h(y); equality iff (x; y) 2 m y 2 fl(x) =@g(x) m x 2 fl (y) =@h(y) + y iff x Observe g : C and h : D are, ffl Convex, by montonicity of ffl Closed, by completeness of ffl Conjugate functions 7
8 Multi dimensional Conjugancy Young-Fenchel Conjugate inequality Theorem: Given "Conjugate functions" g : C and h : D (i.e, each is Convex, closed and Conjugate transform of the other) with equality iff xy» g(x)+h(y); 8x 2C;y 2D y def = fy 2< n =g(x)+y(x 0 x)» g(x 0 ); 8x 0 2Cg Proof: The inequality follows from the defining equation, If h(y) = sup[yx g(x)]; 8y 2D x2c g(x)+y(x 0 x)» g(x 0 ); 8x 0 2C; then yx 0 g(x 0 )» yx gx; 8x 0 2C and hence h(y) = yx g(x); so the conjugate inequality is an equality. On the other hand, if xy = g(x)+h(y) then and hence yx g(x) =h(y) yx 0 g(x 0 ); 8x 0 2C g(x 0 ) g(x)+y(x 0 x); 8x 0 2C: Q.E.D Theorem: Given conjugate functions g : C and h : D. y iff x 2. if then, C = py C k ; g(x) = px k= = py k (x k ) g k (x k ) 8
9 Proof:. Follows from the preceding theorem and the fact that g : C and h : D are conjugate transforms of one another. 2. Follows from the fact that y iff px g k (x k )+ px y k (x k0 x k )» px k= k= k= g k (x k0 ); 8x 0 2C iff g k (x k )+y k (x k0 x k )» g k (x k0 ); 8x k0 2C k for k =; 2;:::p iff y k k (x k ) for k =; 2;::::p: Q.E.D Note: Since we previously showed that the seperability ofg : C hypothesized in (2) implies that, D = py D k and h(y) = px k= k= h k (y k0 ) a corollary to (2) is = py k (y k ) These are three elementary facts that help in the computation of conjugate transforms when the conjugate transforms of closely related functions are already known. In particluar, given that g : C has a known conjugate transform, h : D,. for a given scalar s, the function g + s : C has a conjugate transform h s : D (because sup x2c [yx fg(x)+sg] = sup x2c [yx g(x)] s): 2. for a given vector v 2< n, the function g(: + v) :C fvg has a conjugate transform h(:) v : D (because sup x2c fvg [yx fg(x + v)g] becomes via the change of variables x + v = z, sup z2c [y(z v) g(z)] = sup[yz g(z)] vy z2c 9
10 3. for a given scalar > 0, the function g : C has a conjugate transform h(:= ) : D (because sup x2c [yx g(x)] = sup [(y= )x g(x)] x2c Example: Since the inspections shows that, 0:f0g has conjugate transform 0:< we infer that,. a:f0g has conjugate transform -a:< 2. a:fbg has conjugate transform -a+b(.):< 3. -a+b(.):< has conjugate transform a:fbg = sup[(y= )x g(x)]) x2c Example: Since we know that, log( P n ex i ):<n has conjugate transform ( y i log y i ):fy 0= y i =g we infer that: (). log( P n c ie x i ):<n has conjugate transform ( y i log y i=c i ):fy 0= y i =g (because c i e x i = ex i+log(c i ) and log[y i =c i ]=log(y i )=log(c i )) (2). log( P n c ie x i ):<n has conjugate transform ( y i log y i=c i ) log( ) :fy 0= y i = g (because (y i = )log[y i = c i ]= y i logfy i =c i g ( y i )log( ) and because y= 0 and P n (y i= ) =imply that y 0and P n (y i)=.) 0
11 Example: (=2)x 2 : < with graph has conjugate transform (=2)y 2 : < (by inspection and elementary calculus). Consequently,. (=2)(x b) 2 : < has conjugate transform (=2)y 2 + by : <. 2. (=2) P n (x i b i ) 2 : < n has conjugate transform P n (=2)y2 i + by : <n. 3. (=2) P n (x i b i ) 2 d : < n has conjugate transform P n (=2)y2 i + by + d : <n. 4. [(=2) P n (x i b i ) 2 ]:< n has conjugate transform (=2 ) P n y2 i < n. + by + d : Example: jxj : < with graph, has conjugate transform 0 : [ ; +], by inspection. Consequently,
12 . P jx bj : < has conjugate transform by :[ ; +]. n 2. jx i b i j : < Q n n P has conjugate transform by : [ ; +]. n 3. jx i b i j d : < Q n n P has conjugate transform by + d : [ ; +]. n 4. [ jx i b i j d] :< Q n n has conjugate transform by + d : [ ; +]. Exercise: Generalize the preceding examples to (=p)jxj p : < where the given constant p>. fhint: while using inspection and the elementary calculus you will find it convenient to introduce the constant q where (=p)+(=q) = g. 2
13 Linear sets, Affine sets and Polyhedral sets Convex sets and cones Definition: A non empty set S E ( -dimensional Euclidean space) is: ffl linear (i.e., a subspace) if ffi z +ffi 2 z 2 2 S when (z ;z 2 ) 2 S and (ffi ;ffi 2 ) 2 <. ffl affine (i.e., a linear manifold) if ffi z + ffi 2 z 2 2 S when (z ;z 2 ) 2 S and ffi + ffi 2 =. ffl convex if ffi z +ffi 2 z 2 2 S when (z ;z 2 ) 2 S and ffi +ffi 2 = and ffi ;ffi 2 0. Observations: Each linear set is affine (but not conversely) and each affine set is convex (but not conversely). Some important facts: (whose proofs are non trivial). Each linear set is the solution set of a finite system of linear homogeneous equations and also the set of all linear combinations of a finite set of basis vectors (and conversely). Each affine set is the solution set of a finite system of linear (not necessarily homogeneous) equations and also a particular solution plus linear combination of basis solutions to the corresponding linear homogeneous system (and conversely). The solution set of a finite system of linear equations and/or inequalities (i.e., a polyhedral set) is convex (but not conversely). Each convex set that is topologically closed and not all of E is the solution set of a (possibly infinite) system of linear equations and/or inequalities. Definition: z 2 S and ffi 0. A non empty set S E is conical (i.e., a cone) if ffiz 2 S when Observations: Each linear set is conical (but not conversely). Some important facts: (whose proofs are non trivial). A non empty set S is a convex cone iff ffi z + ffi 2 z 2 2 S when (z ;z 2 ) 2 S and ffi ;ffi
14 The solution set of a finite system of linear homogeneous equations and/or inequalities (i.e., a special type of polyhedral set) is a convex cone (but not conversely). Such a cone is "finitely generated" in that it consists of all nonnegative linear combinations of a finite set of "generating vectors". 4
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 informationSome 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 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 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 informationConvex Functions. Pontus Giselsson
Convex Functions Pontus Giselsson 1 Today s lecture lower semicontinuity, closure, convex hull convexity preserving operations precomposition with affine mapping infimal convolution image function supremum
More informationChapter 2. Limits and Continuity 2.6 Limits Involving Infinity; Asymptotes of Graphs
2.6 Limits Involving Infinity; Asymptotes of Graphs Chapter 2. Limits and Continuity 2.6 Limits Involving Infinity; Asymptotes of Graphs Definition. Formal Definition of Limits at Infinity.. We say that
More informationMathematics 530. Practice Problems. n + 1 }
Department of Mathematical Sciences University of Delaware Prof. T. Angell October 19, 2015 Mathematics 530 Practice Problems 1. Recall that an indifference relation on a partially ordered set is defined
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 informationConvex 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 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 information3. Convex functions. basic properties and examples. operations that preserve convexity. the conjugate function. quasiconvex functions
3. Convex functions Convex Optimization Boyd & Vandenberghe basic properties and examples operations that preserve convexity the conjugate function quasiconvex functions log-concave and log-convex functions
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 information4. Convex Sets and (Quasi-)Concave Functions
4. Convex Sets and (Quasi-)Concave Functions Daisuke Oyama Mathematics II April 17, 2017 Convex Sets Definition 4.1 A R N is convex if (1 α)x + αx A whenever x, x A and α [0, 1]. A R N is strictly convex
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 informationTOPOLOGY HW 2. x x ± y
TOPOLOGY HW 2 CLAY SHONKWILER 20.9 Show that the euclidean metric d on R n is a metric, as follows: If x, y R n and c R, define x + y = (x 1 + y 1,..., x n + y n ), cx = (cx 1,..., cx n ), x y = x 1 y
More informationUTILITY OPTIMIZATION IN A FINITE SCENARIO SETTING
UTILITY OPTIMIZATION IN A FINITE SCENARIO SETTING J. TEICHMANN Abstract. We introduce the main concepts of duality theory for utility optimization in a setting of finitely many economic scenarios. 1. Utility
More informationConstraint qualifications for convex inequality systems with applications in constrained optimization
Constraint qualifications for convex inequality systems with applications in constrained optimization Chong Li, K. F. Ng and T. K. Pong Abstract. For an inequality system defined by an infinite family
More information3. Convex functions. basic properties and examples. operations that preserve convexity. the conjugate function. quasiconvex functions
3. Convex functions Convex Optimization Boyd & Vandenberghe basic properties and examples operations that preserve convexity the conjugate function quasiconvex functions log-concave and log-convex functions
More informationBounded uniformly continuous functions
Bounded uniformly continuous functions Objectives. To study the basic properties of the C -algebra of the bounded uniformly continuous functions on some metric space. Requirements. Basic concepts of analysis:
More informationLECTURE 12 LECTURE OUTLINE. Subgradients Fenchel inequality Sensitivity in constrained optimization Subdifferential calculus Optimality conditions
LECTURE 12 LECTURE OUTLINE Subgradients Fenchel inequality Sensitivity in constrained optimization Subdifferential calculus Optimality conditions Reading: Section 5.4 All figures are courtesy of Athena
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 informationFunctions and Their Graphs
Functions and Their Graphs DEFINITION Function A function from a set D to a set Y is a rule that assigns a unique (single) element ƒ(x) Y to each element x D. A symbolic way to say y is a function of x
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 informationEE 546, Univ of Washington, Spring Proximal mapping. introduction. review of conjugate functions. proximal mapping. Proximal mapping 6 1
EE 546, Univ of Washington, Spring 2012 6. Proximal mapping introduction review of conjugate functions proximal mapping Proximal mapping 6 1 Proximal mapping the proximal mapping (prox-operator) of a convex
More informationInequality Constraints
Chapter 2 Inequality Constraints 2.1 Optimality Conditions Early in multivariate calculus we learn the significance of differentiability in finding minimizers. In this section we begin our study of the
More information(a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff
Chapter 4: Functional Limits and Continuity Definition. Let S R and f : S R. (a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff ε > 0, δ
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: October 16, 2014
More informationDivision 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 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 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 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 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 informationSubgradients. subgradients and quasigradients. subgradient calculus. optimality conditions via subgradients. directional derivatives
Subgradients subgradients and quasigradients subgradient calculus optimality conditions via subgradients directional derivatives Prof. S. Boyd, EE392o, Stanford University Basic inequality recall basic
More information8. Conjugate functions
L. Vandenberghe EE236C (Spring 2013-14) 8. Conjugate functions closed functions conjugate function 8-1 Closed set a set C is closed if it contains its boundary: x k C, x k x = x C operations that preserve
More informationSubgradients. subgradients. strong and weak subgradient calculus. optimality conditions via subgradients. directional derivatives
Subgradients subgradients strong and weak subgradient calculus optimality conditions via subgradients directional derivatives Prof. S. Boyd, EE364b, Stanford University Basic inequality recall basic inequality
More informationCONSTRAINT QUALIFICATIONS, LAGRANGIAN DUALITY & SADDLE POINT OPTIMALITY CONDITIONS
CONSTRAINT QUALIFICATIONS, LAGRANGIAN DUALITY & SADDLE POINT OPTIMALITY CONDITIONS A Dissertation Submitted For The Award of the Degree of Master of Philosophy in Mathematics Neelam Patel School of Mathematics
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationLogical Connectives and Quantifiers
Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then
More informationLecture 4 Lebesgue spaces and inequalities
Lecture 4: Lebesgue spaces and inequalities 1 of 10 Course: Theory of Probability I Term: Fall 2013 Instructor: Gordan Zitkovic Lecture 4 Lebesgue spaces and inequalities Lebesgue spaces We have seen how
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 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 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 information0, otherwise. Find each of the following limits, or explain that the limit does not exist.
Midterm Solutions 1, y x 4 1. Let f(x, y) = 1, y 0 0, otherwise. Find each of the following limits, or explain that the limit does not exist. (a) (b) (c) lim f(x, y) (x,y) (0,1) lim f(x, y) (x,y) (2,3)
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 informationIntroduction to Functional Analysis
Introduction to Functional Analysis Carnegie Mellon University, 21-640, Spring 2014 Acknowledgements These notes are based on the lecture course given by Irene Fonseca but may differ from the exact lecture
More information6.2 Fubini s Theorem. (µ ν)(c) = f C (x) dµ(x). (6.2) Proof. Note that (X Y, A B, µ ν) must be σ-finite as well, so that.
6.2 Fubini s Theorem Theorem 6.2.1. (Fubini s theorem - first form) Let (, A, µ) and (, B, ν) be complete σ-finite measure spaces. Let C = A B. Then for each µ ν- measurable set C C the section x C is
More informationSKILL BUILDER TEN. Graphs of Linear Equations with Two Variables. If x = 2 then y = = = 7 and (2, 7) is a solution.
SKILL BUILDER TEN Graphs of Linear Equations with Two Variables A first degree equation is called a linear equation, since its graph is a straight line. In a linear equation, each term is a constant or
More informationConvex Optimization Conjugate, Subdifferential, Proximation
1 Lecture Notes, HCI, 3.11.211 Chapter 6 Convex Optimization Conjugate, Subdifferential, Proximation Bastian Goldlücke Computer Vision Group Technical University of Munich 2 Bastian Goldlücke Overview
More informationSCORE BOOSTER JAMB PREPARATION SERIES II
BOOST YOUR JAMB SCORE WITH PAST Polynomials QUESTIONS Part II ALGEBRA by H. O. Aliu J. K. Adewole, PhD (Editor) 1) If 9x 2 + 6xy + 4y 2 is a factor of 27x 3 8y 3, find the other factor. (UTME 2014) 3x
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 informationPicard s Existence and Uniqueness Theorem
Picard s Existence and Uniqueness Theorem Denise Gutermuth 1 These notes on the proof of Picard s Theorem follow the text Fundamentals of Differential Equations and Boundary Value Problems, 3rd edition,
More informationChapter 2: Preliminaries and elements of convex analysis
Chapter 2: Preliminaries and elements of convex analysis Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-14-15.shtml Academic year 2014-15
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 informationarxiv: v1 [math.oc] 21 Mar 2015
Convex KKM maps, monotone operators and Minty variational inequalities arxiv:1503.06363v1 [math.oc] 21 Mar 2015 Marc Lassonde Université des Antilles, 97159 Pointe à Pitre, France E-mail: marc.lassonde@univ-ag.fr
More informationZERO DUALITY GAP FOR CONVEX PROGRAMS: A GENERAL RESULT
ZERO DUALITY GAP FOR CONVEX PROGRAMS: A GENERAL RESULT EMIL ERNST AND MICHEL VOLLE Abstract. This article addresses a general criterion providing a zero duality gap for convex programs in the setting of
More informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More informationLecture 2: Convex functions
Lecture 2: Convex functions f : R n R is convex if dom f is convex and for all x, y dom f, θ [0, 1] f is concave if f is convex f(θx + (1 θ)y) θf(x) + (1 θ)f(y) x x convex concave neither x examples (on
More informationStructure of R. Chapter Algebraic and Order Properties of R
Chapter Structure of R We will re-assemble calculus by first making assumptions about the real numbers. All subsequent results will be rigorously derived from these assumptions. Most of the assumptions
More informationLECTURE SLIDES ON CONVEX OPTIMIZATION AND DUALITY THEORY TATA INSTITUTE FOR FUNDAMENTAL RESEARCH MUMBAI, INDIA JANUARY 2009 PART I
LECTURE SLIDES ON CONVEX OPTIMIZATION AND DUALITY THEORY TATA INSTITUTE FOR FUNDAMENTAL RESEARCH MUMBAI, INDIA JANUARY 2009 PART I BY DIMITRI P. BERTSEKAS M.I.T. http://web.mit.edu/dimitrib/www/home.html
More informationIn English, this means that if we travel on a straight line between any two points in C, then we never leave C.
Convex sets In this section, we will be introduced to some of the mathematical fundamentals of convex sets. In order to motivate some of the definitions, we will look at the closest point problem from
More informationLegendre transformation and information geometry
Legendre transformation and information geometry CIG-MEMO #2, v1 Frank Nielsen École Polytechnique Sony Computer Science Laboratorie, Inc http://www.informationgeometry.org September 2010 Abstract We explain
More informationM2PM1 Analysis II (2008) Dr M Ruzhansky List of definitions, statements and examples Preliminary version
M2PM1 Analysis II (2008) Dr M Ruzhansky List of definitions, statements and examples Preliminary version Chapter 0: Some revision of M1P1: Limits and continuity This chapter is mostly the revision of Chapter
More informationDuality. for The New Palgrave Dictionary of Economics, 2nd ed. Lawrence E. Blume
Duality for The New Palgrave Dictionary of Economics, 2nd ed. Lawrence E. Blume Headwords: CONVEXITY, DUALITY, LAGRANGE MULTIPLIERS, PARETO EFFICIENCY, QUASI-CONCAVITY 1 Introduction The word duality is
More informationA Dual Condition for the Convex Subdifferential Sum Formula with Applications
Journal of Convex Analysis Volume 12 (2005), No. 2, 279 290 A Dual Condition for the Convex Subdifferential Sum Formula with Applications R. S. Burachik Engenharia de Sistemas e Computacao, COPPE-UFRJ
More informationLebesgue measure and integration
Chapter 4 Lebesgue measure and integration If you look back at what you have learned in your earlier mathematics courses, you will definitely recall a lot about area and volume from the simple formulas
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 informationMAXIMALITY OF SUMS OF TWO MAXIMAL MONOTONE OPERATORS
MAXIMALITY OF SUMS OF TWO MAXIMAL MONOTONE OPERATORS JONATHAN M. BORWEIN, FRSC Abstract. We use methods from convex analysis convex, relying on an ingenious function of Simon Fitzpatrick, to prove maximality
More informationGeneral Notation. Exercises and Problems
Exercises and Problems The text contains both Exercises and Problems. The exercises are incorporated into the development of the theory in each section. Additional Problems appear at the end of most sections.
More informationConvex Feasibility Problems
Laureate Prof. Jonathan Borwein with Matthew Tam http://carma.newcastle.edu.au/drmethods/paseky.html Spring School on Variational Analysis VI Paseky nad Jizerou, April 19 25, 2015 Last Revised: May 6,
More informationLimits at Infinity. Horizontal Asymptotes. Definition (Limits at Infinity) Horizontal Asymptotes
Limits at Infinity If a function f has a domain that is unbounded, that is, one of the endpoints of its domain is ±, we can determine the long term behavior of the function using a it at infinity. Definition
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 informationMarch 25, 2010 CHAPTER 2: LIMITS AND CONTINUITY OF FUNCTIONS IN EUCLIDEAN SPACE
March 25, 2010 CHAPTER 2: LIMIT AND CONTINUITY OF FUNCTION IN EUCLIDEAN PACE 1. calar product in R n Definition 1.1. Given x = (x 1,..., x n ), y = (y 1,..., y n ) R n,we define their scalar product as
More informationFuchsian groups. 2.1 Definitions and discreteness
2 Fuchsian groups In the previous chapter we introduced and studied the elements of Mob(H), which are the real Moebius transformations. In this chapter we focus the attention of special subgroups of this
More informationShiqian Ma, MAT-258A: Numerical Optimization 1. Chapter 4. Subgradient
Shiqian Ma, MAT-258A: Numerical Optimization 1 Chapter 4 Subgradient Shiqian Ma, MAT-258A: Numerical Optimization 2 4.1. Subgradients definition subgradient calculus duality and optimality conditions Shiqian
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 informationREAL VARIABLES: PROBLEM SET 1. = x limsup E k
REAL VARIABLES: PROBLEM SET 1 BEN ELDER 1. Problem 1.1a First let s prove that limsup E k consists of those points which belong to infinitely many E k. From equation 1.1: limsup E k = E k For limsup E
More informationSYMBOLIC CONVEX ANALYSIS
SYMBOLIC CONVEX ANALYSIS by Chris Hamilton B.Sc., Okanagan University College, 2001 a thesis submitted in partial fulfillment of the requirements for the degree of Master of Science in the Department of
More informationInduction, sequences, limits and continuity
Induction, sequences, limits and continuity Material covered: eclass notes on induction, Chapter 11, Section 1 and Chapter 2, Sections 2.2-2.5 Induction Principle of mathematical induction: Let P(n) be
More informationMetric Space Topology (Spring 2016) Selected Homework Solutions. HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y)
Metric Space Topology (Spring 2016) Selected Homework Solutions HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y) d(z, w) d(x, z) + d(y, w) holds for all w, x, y, z X.
More information2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1
Lectures - Week 11 General First Order ODEs & Numerical Methods for IVPs In general, nonlinear problems are much more difficult to solve than linear ones. Unfortunately many phenomena exhibit nonlinear
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationi c Robert C. Gunning
c Robert C. Gunning i ii MATHEMATICS 218: NOTES Robert C. Gunning January 27, 2010 ii Introduction These are notes of honors courses on calculus of several variables given at Princeton University during
More informationBirgit Heydenreich, Rudolf Müller, Marc Uetz, Rakesh Vohra. Characterization of Revenue Equivalence RM/07/017. JEL code: D71, C72, C69
Birgit Heydenreich, Rudolf Müller, Marc Uetz, Rakesh Vohra Characterization of Revenue Equivalence RM/07/017 JEL code: D71, C72, C69 Maastricht research school of Economics of TEchnology and ORganizations
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 informationThe proximal mapping
The proximal mapping http://bicmr.pku.edu.cn/~wenzw/opt-2016-fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghes lecture notes Outline 2/37 1 closed function 2 Conjugate function
More informationChap 2. Optimality conditions
Chap 2. Optimality conditions Version: 29-09-2012 2.1 Optimality conditions in unconstrained optimization Recall the definitions of global, local minimizer. Geometry of minimization Consider for f C 1
More informationIntroduction to Algebraic and Geometric Topology Week 3
Introduction to Algebraic and Geometric Topology Week 3 Domingo Toledo University of Utah Fall 2017 Lipschitz Maps I Recall f :(X, d)! (X 0, d 0 ) is Lipschitz iff 9C > 0 such that d 0 (f (x), f (y)) apple
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 informationTHE RADIUS OF CONVERGENCE FORMULA. a n (z c) n, f(z) =
THE RADIUS OF CONVERGENCE FORMULA Every complex power series, f(z) = (z c) n, n=0 has a radius of convergence, nonnegative-real or infinite, R = R(f) [0, + ], that describes the convergence of the series,
More informationStrongly convex functions, Moreau envelopes and the generic nature of convex functions with strong minimizers
University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part B Faculty of Engineering and Information Sciences 206 Strongly convex functions, Moreau envelopes
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 informationNOTES ON VECTOR-VALUED INTEGRATION MATH 581, SPRING 2017
NOTES ON VECTOR-VALUED INTEGRATION MATH 58, SPRING 207 Throughout, X will denote a Banach space. Definition 0.. Let ϕ(s) : X be a continuous function from a compact Jordan region R n to a Banach space
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
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 informationConvex Sets with Applications to Economics
Convex Sets with Applications to Economics Debasis Mishra March 10, 2010 1 Convex Sets A set C R n is called convex if for all x, y C, we have λx+(1 λ)y C for all λ [0, 1]. The definition says that for
More informationSolutions Chapter 5. The problem of finding the minimum distance from the origin to a line is written as. min 1 2 kxk2. subject to Ax = b.
Solutions Chapter 5 SECTION 5.1 5.1.4 www Throughout this exercise we will use the fact that strong duality holds for convex quadratic problems with linear constraints (cf. Section 3.4). The problem of
More informationB553 Lecture 1: Calculus Review
B553 Lecture 1: Calculus Review Kris Hauser January 10, 2012 This course requires a familiarity with basic calculus, some multivariate calculus, linear algebra, and some basic notions of metric topology.
More informationChapter 1 Limits and Their Properties
Chapter 1 Limits and Their Properties Calculus: Chapter P Section P.2, P.3 Chapter P (briefly) WARM-UP 1. Evaluate: cot 6 2. Find the domain of the function: f( x) 3x 3 2 x 4 g f ( x) f ( x) x 5 3. Find
More information1. Introduction. 2. Outlines
1. Introduction Graphs are beneficial because they summarize and display information in a manner that is easy for most people to comprehend. Graphs are used in many academic disciplines, including math,
More information