Salient features of dynamic optimization problems Basics of dynamic programming The principle of optimality
|
|
- Sibyl Ross
- 5 years ago
- Views:
Transcription
1
2
3 A Z D I A 4 2 B C E F G H J K 3 2 Z
4 D I A 4 2 B C E F G H J K 3 2 Z s x {, 2,..., n} r(x, s) x
5 s r(, A) = 2 r(, D) = 2 r(2, A) = 4 r(2, D) = 8 g(x, s) s s x g(, A) = B g(2, A) = C g(, D) = I g(2, D) = J x = s r(s, s ) r(a, B) = 2 r(g, I) = 2 r(a, C) = 4 r(g, J) = 8 g(s, s ) g(a, B) = B g(a, C) = C g(g, I) = I g(g, J) = J t s t s(t) c(abdgiz) = = 7 = c() c(abehkz) = = 8 = c(22) 4 r(s t, x t ) s t+ = g(x t, s t ), t = 0,..., 4 V t (s t ) t s t V t (s t ) = x 0,...,x 4 4 r(s t, x t ) s t+ = g(x t, s t ), t = 0,..., 4
6 h t (s t ) s t t h t (s t ) = x 0,...,x 4 4 r(s t, x t ) s t+ = g(x t, s t ), t = 0,..., 4 V t (s t ) = x t {r(x t, s t ) + V t+ (s t+ )} s t+ = g(x t, s t ) V t (s t ) = x t {r(x t, s t ) + V t+ (g(x t, s t ))} V t (s t ) = r [h t (s t ), s t ] + V t+ [g (h t (s t ), s t )] V t (s t ) = x t {r(x t, s t ) + V t+ (g(x t, s t ))} Z 0 A 4 2 B C D E F G H I J K 3 2 Z
7 V 5 (Z) = 0 h 5 (Z) = Z V 4 (K) = {2 + V 5 (Z)} = 2 h 4 (K) = Z V 4 (J) = { + V 5 (Z)} = h 4 (J) = Z V 4 (I) = {3 + V 5 (Z)} = 3 h 4 (I) = Z V 3 (H) = {4 + V 4 (J), 6 + V 4 (K)} = 5 h 3 (H) = J V 3 (G) = {2 + V 4 (I), 8 + V 4 (J)} = 5 h 3 (G) = I V 2 (F ) = {5 + V 3 (H)} = 0 h 2 (F ) = H V 2 (E) = {3 + V 3 (H)} = 8 h 2 (E) = H V 2 (D) = {3 + V 3 (G), 4 + V 3 (H)} = 8 h 2 (D) = G V (C) = {2 + V 2 (E), 6 + V (F )} = 0 h (C) = E V (B) = {7 + V 2 (D), 5 + V 2 (E)} = 3 h (B) = E V 0 (A) = {2 + V (B), 4 + V (C)} = 4 h 0 (A) = C β (0, ) {u t } β t r(x t, u t ) x t+ = g(x t, u t ) x 0 R r(x t, u t ) {(x t+, x t ) : x t+ g(x t, u t ), u t R} h x t u t {u s } s=0 u t = h(x t ) x t+ = g(x t, u t )
8 x 0 t = 0 h V (x) x X V (x 0 ) = {u s} s=0 β t r(x t, u t ) x t+ = g(x t, u t ) x 0 V (x 0 ) h x X {r(x, u) + βv ( x)}, x = g(x, u) u V (x) h x V (x), h(x) V (x) = {r(x, u) + βv [g(x, u)]} u h(x) V (x) = r[x, h(x)] + βv {g[x, h(x)]} V (x), h(x) r g j V j+ (x) = {r(x, u) + βv j( x)}, x = g(x, u), x u V 0 u t = h(x t ) h V f x y t [0, ] t (0, ) x y f(( t)x + ty) ( t)f(x) + tf(y) f(( t)x + ty) ( t)f(x) + tf(y)
9 f : R R z x y (z, f(z)) f f(y) f(x) ( t)f(x) + tf(y) (x, f(x)) (y, f(y)) x y x f f(x ) = x f(f(... f(x )... )) = x f y = x x x x 0 f : X X X δ 0 δ < d(f(x), f(y)) δd(x, y)
10 f f(t) f(x) f(y) x y x y X x y t f X x f(x ) = x x 0 X x i+ = f(x i ) x i x x 0 x d(f(x 0 ), f(x )) δd(x 0, x ) d(x, x ) δd(x 0, x ) d(x k, x ) δ k d(x 0, x ) 0 k f(x) = + 0.5x x R x = 2 f(x ) = f(2) = + 0.5(2) = 2 = x x = + 0.5x f (x) = 0.5 < f x 0
11 x j+ = f(x j ) j x j = x x 0 = 6 x = f(x 0 ) = = 4 x 2 = f(x ) = = 3 x 3 = f(x 2 ) = = 2.5 x 4 = f(x 3 ) = = 2.25 f f(t) x = 2 x 0 x r u (x, u) + βv {g(x, u)}g u (x, u) = 0 V (x) = r x [x, h(x)] + r u [x, h(x)]h (x) + βv {g[x, h(x)]} {g x [x, h(x)] + g u [x, h(x)]h (x)} u x = g(u) V (x) = r x [x, h(x)] x = g(u) r u (x t, u t ) + βr x (x t+, u t+ )g (u t ) = 0
12 u t x t+ u t x t V V V
13 V 0 = 0 V j V j+ (x) = {r(x, u) + βv j[g(x, u)]} u u = h 0 (x) V hj (x) = β t r[x t, h j (x t )] x t+ = g[x t, h j (x t )] j = 0 u = h j+ (x) j {r(x, u) + βv h j [g(x, u)]} u T u(c t ) = c t β (0, ) U(c 0, c,..., c T ) = T β t c t c t U A 0 r R + r A t+ = R(A t c t )
14 {c t } T A 0 T + V V 0 (A 0 ) = {c,a} T β t c t V 0 (A 0 ) = {c t} T β t c t A t+ = R(A t c t ) A t+ = R(A t c t ) t = 0,..., T A T + 0 t = T t = T t = T 2 T = t = T V T (A T ) = c T,A T + { c T } A T + = R(A T c T ), A T + 0 c T A T + c T = A T A T + R [ A T A ] T + A T + R A T + 0 A T + A T + A T + = 0 c T = A T V T (A T ) = A T t = T V T (A T ) = { c T + + β c T } A T = R (A T c T ), A T + = R(A T c T ), A T + 0 c T, c T, A T A T +
15 T c T A T c T A T + t = T c T = A T A T + = 0 V T (A T ) = { c T + β c T } c T :T,A T :T + { } = c T + β [ c T ] c T,A T c T,A T + = c T,A T { c T + βv T (A T )} A T = R(A T c T ) c T = A T A T R { A T [ A T A ] T + βv T (A T ) R c T R + βv T (A T ) = 0 = Rβc T V T (A T ) } V T (A) = A t = T V T (A T ) = A T = Rβc T A T A T = Rβc T Rβc T = R(A T c T ) c T = +β A T A T = Rβ +β A T V T (A T ) = c T + βv T (A T ) θ T t = T 2 = c T + β A T = c T + β [Rβc T ] = ( + β) c T + β β + β R = ( + β) A T ( + β) ( + β) β β + β R = ( + β) A T + θ T
16 V T 2 (A T 2 ) = { c T 2 + β c T + β 2 c T } A T = R(A T 2 c T 2 ), A T = R(A T c T ), A T + = R(A T c T ), A T + 0 c T 2 A T c T, c T, A T, A T + { V T 2 (A T 2 ) = c T 2:T, ct 2 + β c T + β 2 } c T A T :T + = c T 2,A T c T 2 + β c T :T, = c T 2,A T { c T 2 + βv T (A T )} [ c T + β c T ] A T :T + c T 2 = A T 2 A T R { [ A T 2 A ] } T + βv T (A T ) A T R c T 2 R + βv T (A T ) = 0 = Rβc T 2 V T (A T ) V T (A) = (+β) A+θ T t = T V T (A T ) = +β A T = Rβc T 2 +β A T A T = R(β + β 2 )c T 2 ( + β)rβc T 2 = R(A T 2 c T 2 ) c T 2 = +β+β 2 A T 2 A T = R(β+β2 ) +β+β 2 A T 2 V T 2 (A T 2 ) = c T 2 + βv T (A T ) = c T 2 + β[( + β) (A T ) + θ T ] = c T 2 + (β + β 2 ) [R(β + β 2 )c T 2] + βθ T = ( + β + β2 ) c T 2 + (β + β 2 )[ R (β + β 2 )] + βθ T = ( + β + β 2 ) A T 2 + θ T 2 θ T 2 = (β + 2β 2 ) R + (β + 2β 2 ) β ( + β + β 2 ) ( + β + β 2 )
17 t = T K t = T K V T K (A T K ) = { c T K + β c T K+ + + β K c T } A t+ = R(A t c t ), t = T K, T K +,..., T A T + 0 c T K A T K+ c T K, A T K+ c T K + β c T K = A T K A T K+ R V T K (A T K ) = [ c c T K+:T, T K+ + + β K c T ] A T K+2:T + = c T K, A T K+ { c T K + βv T K+ (A T K+ )} { [ A T K A T K+ A T K R ] + βv T K+ (A T K+ ) c T K R + βv T K+(A T K+ ) = 0 = Rβc T K V T K+(A T K+ ) } V T K+ (A) t c t A t+ T A T 0A T T +β A T Rβ +β A T T 2 +β+β A 2 T 2 Rβ +β +β+β A 2 T 2 K T K +β+ +β K A T K Rβ +β+ +βk A +β+ +β K T K = β β K+ A T K Rβ βk β K+ A T K
18 A T K+ = Rβ βk β K+ A T K K = T, T A = Rβ βt β T + A 0 βt A 2 = Rβ β T A 2 βt = (Rβ) β T + A 0 + t t βt A t = (Rβ) β T + A 0 c T K = β A β K+ T K t = T K c β t = β T + t A t = β β T + t = (Rβ) t β β T + A 0 ϕ + t t βt [(Rβ) β T + A 0 ] c t = t (Rβ) + ϕ 0 V 0 (A 0 ) T β t c t = T β t (t (Rβ) + ϕ) T T = (Rβ) β t t + ϕ = β β = β β + ( β T β T βt ( β T β T βt + βt β β t ) + βt (Rβ) + β ) (Rβ) +... β β T + + βt + A 0 β ϕ
19 + t t βt A t = (Rβ) β T + A 0 c t = (Rβ) t β β T + A 0 V 0(A 0) = β ( ) β T + β β T βt β βt (Rβ) + β β + βt + A T + 0 β T A t = (Rβ) t A 0 c t = (Rβ) t ( β)a 0 = ( β)a t V 0 (A 0 ) = β A β R + β β + ( β) ( β) 0 + ( β) 2 c t = ( β)a t A t+ = RβA t β β R t T T T 2 V t (A) A ( + β) A + θ T ( + β + β 2 ) A + θ T 2 K V T K (A T K ) = { c c T K, T K + βv T K+ (A T K+ )} A T K+ T K T K + V (A T K ) = { c c T K, T K + βv (A T K+ )} A T K+ V (A) = { c + βv c,a (A )}
20 { ) } V (A) = (A A + βv (A ) A R = RβcV (A ) V V (A) = (A A ) + βv (A ) R V (A) = c V (A) = c V (A ) = c = Rβ c c = Rβ u (c ) u (c) u (c) βu (c ) R V (A) = c,a { c + βv (A )} A = R(A c) V j+ (A) = c,a { c + βv j(a )} A = R(A c) V 0 (A) = 0 j V j (A) 0 0 A 2 ( + β) A + θ 2 3 ( + β + β 2 ) A + θ 3 A + β + β 2 + = β θ j V (A) = A + θ β
21 V (A) = β A + θ = RβcV (A ) A = R(A c) c = ( β)a A = RβA V (A) c + βv (A ) β A + θ [ ] A = ( β)a + β β + θ [ ] = ( β)a + β RβA β + θ = β A + β β RB + ( β) + βθ θ = θ = β β RB + ( β) + βθ β R + β β + ( β) ( β) ( β) 2 V (A) A A A = h(a) h [ V (A) = A h(a) ] + βv (h(a)) R V (A) = c [ ] h (A) R = c + [ cr + βv (A ) + βv (h(a))h (A) ] h (A) k 0
22 U(c 0, c,..., c ) = βt c t y = Ak α A > 0 0 < α < c t + k t+ = Ak α t V (k 0 ) = {c,k } β t c t k = Ak α c V (k 0 ) = c 0,k { c 0 + βv (k )} c 0 = Ak α 0 k k V (k) = k {(Ak α k ) + βv (k )} V (k) = k {(Ak α k ) + βv (k )} V (k) V β < V 0 (k) = 0 V j+ (k) = k {(Ak α k ) + βv j (k )} j
23 V 0 = 0 V (k) = k {(Ak α k ) + β 0} k k 0 k = 0 c = Ak α V (k) = c + β 0 = A + α k V 2 V 2 (k) = k {(Ak α k ) + β[ A + α k ]} Ak α k = αβ k k = αβ + αβ Akα = θ Ak α c = ( θ )Ak α = +αβ Akα V 2 (k) = (c ) + β A + αβ k = ( θ ) + (Ak α ) + β[ A + α θ + α (Ak α )] = ( + αβ) (Ak α ) + β A + [( θ ) + αβ θ ] = ( + αβ) (Ak α ) + ϕ V 3 (k) = k {(Ak α k ) + β[( + αβ) (Ak α ) + ϕ ]} αβ( + αβ) Ak α = k k k = αβ + α2 β 2 + αβ + α 2 β 2 Akα = θ 2 Ak α c = ( θ 2 )Ak α = +αβ+α 2 β 2 Ak α c () Ak α ( + αβ) Ak α ( + αβ + α 2 β 2 ) Ak α j c j = ( + αβ α j β j ) Ak α
24 j 0 < αβ < c = ( αβ)ak α k = αβak α k = (αβa) + α k 0 = ( α)ψ + α k 0 k ψ = α( k 0 ψ) k t ψ = α t ( k 0 ψ) k t = ψ( α t ) + α t k 0 ψ (αβa) α V (k 0 ) β t (c t ) = = = = c t = [A( αβ)] + α k t = [A( αβ)] + αψ( α t ) + α t+ k 0 { β t [A( αβ)] + αψβ t ( α t ) + β t α t+ } k 0 [A( αβ)] β [A( αβ)] β [A( αβ)] β [ + αψ + α (αβa) α + β αβ [ ] + α k 0 αβ β( α) ( β)( αβ) αβ (αβa) ( β)( αβ) + α k 0 αβ ] + α k 0 αβ
25 V (k) = E + F k E F V (k) = k {(Ak α k ) + βe + βf k } Ak α k = βf k k = βf +βf Akα c = +βf Akα V (k) = c + βe + βf k ( ( E + F k = +βf Akα) + βe + βf βf +βf Akα) = A { = +βf + α k + βe + βf AβF A AβF +βf + βe + βf +βf +βf + αβf k } + α( + βf ) k F = α( + βf ) F = α αβ ( β)e = A E = β +βf + βf AβF +βf { [A( αβ)] + } αβ αβ (αβa) + βf = αβ βf +βf = αβ k = βf +βf Akα = αβak α A = A( αβ) +βf c = +βf Akα = ( αβ)ak α V (k) = E + F k = β { [A( αβ)] + } αβ αβ (αβa) + α αβ k
26 x 0 t = 0 E 0 β t r(x t, u t ) x t+ = g(x t, u t, ϵ t+ ) ϵ t P[ϵ t e] = F (e) t ϵ t+ t + u t t t x t x t+j j u t = h(x t ) x = g(x, u, ϵ) E{V (x ) x} = V (x ) df (ϵ) V (x) = {r(x, u) + β E[V u (x ) x]} V (x) r u (x, u) + β E {V (x ) g u (x, u, ϵ) x} = 0 x V (x) = r x [x, h(x)] r u (x, u) + β E {r x (x, u )g u (x, u, ϵ) x} = 0
Lecture 9. Dynamic Programming. Randall Romero Aguilar, PhD I Semestre 2017 Last updated: June 2, 2017
Lecture 9 Dynamic Programming Randall Romero Aguilar, PhD I Semestre 2017 Last updated: June 2, 2017 Universidad de Costa Rica EC3201 - Teoría Macroeconómica 2 Table of contents 1. Introduction 2. Basics
More informationLecture 10. Dynamic Programming. Randall Romero Aguilar, PhD II Semestre 2017 Last updated: October 16, 2017
Lecture 10 Dynamic Programming Randall Romero Aguilar, PhD II Semestre 2017 Last updated: October 16, 2017 Universidad de Costa Rica EC3201 - Teoría Macroeconómica 2 Table of contents 1. Introduction 2.
More informationChapter 3. Dynamic Programming
Chapter 3. Dynamic Programming This chapter introduces basic ideas and methods of dynamic programming. 1 It sets out the basic elements of a recursive optimization problem, describes the functional equation
More informationProblem Set #4 Answer Key
Problem Set #4 Answer Key Economics 808: Macroeconomic Theory Fall 2004 The cake-eating problem a) Bellman s equation is: b) If this policy is followed: c) If this policy is followed: V (k) = max {log
More informationHOMEWORK #3 This homework assignment is due at NOON on Friday, November 17 in Marnix Amand s mailbox.
Econ 50a second half) Yale University Fall 2006 Prof. Tony Smith HOMEWORK #3 This homework assignment is due at NOON on Friday, November 7 in Marnix Amand s mailbox.. This problem introduces wealth inequality
More informationIntroduction to Dynamic Programming Applied to Economics
Introduction to Dynamic Programming Applied to Economics Paulo Brito Instituto Superior de Economia e Gestão Universidade Técnica de Lisboa pbrito@iseg.utl.pt 8.10.2009 Contents 1 Introduction 4 1.1 A
More informationLecture 5: Some Informal Notes on Dynamic Programming
Lecture 5: Some Informal Notes on Dynamic Programming The purpose of these class notes is to give an informal introduction to dynamic programming by working out some cases by h. We want to solve subject
More informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
More informationT k b p M r will so ordered by Ike one who quits squuv. fe2m per year, or year, jo ad vaoce. Pleaie and THE ALTO SOLO
q q P XXX F Y > F P Y ~ Y P Y P F q > ##- F F - 5 F F?? 5 7? F P P?? - - F - F F - P 7 - F P - F F % P - % % > P F 9 P 86 F F F F F > X7 F?? F P Y? F F F P F F
More information7. Let X be a (general, abstract) metric space which is sequentially compact. Prove X must be complete.
Math 411 problems The following are some practice problems for Math 411. Many are meant to challenge rather that be solved right away. Some could be discussed in class, and some are similar to hard exam
More informationHOMEWORK #1 This homework assignment is due at 5PM on Friday, November 3 in Marnix Amand s mailbox.
Econ 50a (second half) Yale University Fall 2006 Prof. Tony Smith HOMEWORK # This homework assignment is due at 5PM on Friday, November 3 in Marnix Amand s mailbox.. Consider a growth model with capital
More informationLecture 1: Background on Convex Analysis
Lecture 1: Background on Convex Analysis John Duchi PCMI 2016 Outline I Convex sets 1.1 Definitions and examples 2.2 Basic properties 3.3 Projections onto convex sets 4.4 Separating and supporting hyperplanes
More informationProblem Set 9 Solutions. (a) Using the guess that the value function for this problem depends only on y t and not ε t and takes the specific form
EC 720 - Math for Economists Samson Alva Department of Economics, Boston College December 9, 20 roblem Set 9 Solutions. Stochastic Linear-Quadratic Dnamic rogramming (a) Using the guess that the value
More informationDYNAMIC LECTURE 5: DISCRETE TIME INTERTEMPORAL OPTIMIZATION
DYNAMIC LECTURE 5: DISCRETE TIME INTERTEMPORAL OPTIMIZATION UNIVERSITY OF MARYLAND: ECON 600. Alternative Methods of Discrete Time Intertemporal Optimization We will start by solving a discrete time intertemporal
More informationThe Principle of Optimality
The Principle of Optimality Sequence Problem and Recursive Problem Sequence problem: Notation: V (x 0 ) sup {x t} β t F (x t, x t+ ) s.t. x t+ Γ (x t ) x 0 given t () Plans: x = {x t } Continuation plans
More informationEconomics 204 Fall 2011 Problem Set 2 Suggested Solutions
Economics 24 Fall 211 Problem Set 2 Suggested Solutions 1. Determine whether the following sets are open, closed, both or neither under the topology induced by the usual metric. (Hint: think about limit
More informationIntroduction to Dynamic Programming Lecture Notes
Introduction to Dynamic Programming Lecture Notes Klaus Neusser November 30, 2017 These notes are based on the books of Sargent (1987) and Stokey and Robert E. Lucas (1989). Department of Economics, University
More informationLecture 18: L-estimators and trimmed sample mean
Lecture 18: L-estimators and trimmed sample mean L-functional and L-estimator For a function J(t) on [0,1], define the L-functional as T (G) = xj(g(x))dg(x), G F. If X 1,...,X n are i.i.d. from F and T
More informationMany of you got these steps reversed or otherwise out of order.
Problem 1. Let (X, d X ) and (Y, d Y ) be metric spaces. Suppose that there is a bijection f : X Y such that for all x 1, x 2 X. 1 10 d X(x 1, x 2 ) d Y (f(x 1 ), f(x 2 )) 10d X (x 1, x 2 ) Show that if
More informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More information3 The Life Cycle, Tax Policy,
3 The Life Cycle, Tax Policy, and the Current Account C 1 + I 1 + C 2 + I 2 = Y 1 T 1 + Y 2 T 2. (1) G 1 + G 2 = T 1 + T 2, (2) C 1 + I 1 + C 2 + I 2 = Y 1 G 1 + Y 2 G 2, Foundations of International Macroeconomics
More informationLINEAR ALGEBRA (PMTH213) Tutorial Questions
Tutorial Questions The tutorial exercises range from revision and routine practice, through lling in details in the notes, to applications of the theory. While the tutorial problems are not compulsory,
More informationDynamic (Stochastic) General Equilibrium and Growth
Dynamic (Stochastic) General Equilibrium and Growth Martin Ellison Nuffi eld College Michaelmas Term 2018 Martin Ellison (Nuffi eld) D(S)GE and Growth Michaelmas Term 2018 1 / 43 Macroeconomics is Dynamic
More informationMOMENT OF A FORCE SCALAR FORMULATION, CROSS PRODUCT, MOMENT OF A FORCE VECTOR FORMULATION, & PRINCIPLE OF MOMENTS
MOMENT OF A FORCE SCALAR FORMULATION, CROSS PRODUCT, MOMENT OF A FORCE VECTOR FORMULATION, & PRINCIPLE OF MOMENTS Today s Objectives : Students will be able to: a) understand and define moment, and, b)
More informationAnalysis Comprehensive Exam, January 2011 Instructions: Do as many problems as you can. You should attempt to answer completely some questions in both
Analysis Comprehensive Exam, January 2011 Instructions: Do as many problems as you can. You should attempt to answer completely some questions in both real and complex analysis. You have 3 hours. Real
More informationSixth Term Examination Papers 9475 MATHEMATICS 3 THURSDAY 22 JUNE 2017
Sixth Term Examination Papers 9475 MATHEMATICS 3 THURSDAY 22 JUNE 207 INSTRUCTIONS TO CANDIDATES AND INFORMATION FOR CANDIDATES six six Calculators are not permitted. Please wait to be told you may begin
More informationa P (A) f k(x) = A k g k " g k (x) = ( 1) k x ą k. $ & g k (x) = x k (0, 1) f k, f, g : [0, 8) Ñ R f k (x) ď g(x) k P N x P [0, 8) g(x)dx g(x)dx ă 8
M M, d A Ď M f k : A Ñ R A a P A f kx = A k xña k P N ta k u 8 k=1 f kx = f k x. xña kñ8 kñ8 xña M, d N, ρ A Ď M f k : A Ñ N tf k u 8 k=1 f : A Ñ N A f A 8ř " x ď k, g k x = 1 k x ą k. & g k x = % g k
More informationSec 4.1 Limits, Informally. When we calculated f (x), we first started with the difference quotient. f(x + h) f(x) h
1 Sec 4.1 Limits, Informally When we calculated f (x), we first started with the difference quotient f(x + h) f(x) h and made h small. In other words, f (x) is the number f(x+h) f(x) approaches as h gets
More informationIntroduction to Nonlinear Control Lecture # 3 Time-Varying and Perturbed Systems
p. 1/5 Introduction to Nonlinear Control Lecture # 3 Time-Varying and Perturbed Systems p. 2/5 Time-varying Systems ẋ = f(t, x) f(t, x) is piecewise continuous in t and locally Lipschitz in x for all t
More informationMath Homework 3: solutions. 1. Consider the region defined by the following constraints: x 1 + x 2 2 x 1 + 2x 2 6
Math 7502 Homework 3: solutions 1. Consider the region defined by the following constraints: x 1 + x 2 2 x 1 + 2x 2 6 x 1, x 2 0. (i) Maximize 4x 1 + x 2 subject to the constraints above. (ii) Minimize
More informationA function(al) f is convex if dom f is a convex set, and. f(θx + (1 θ)y) < θf(x) + (1 θ)f(y) f(x) = x 3
Convex functions The domain dom f of a functional f : R N R is the subset of R N where f is well-defined. A function(al) f is convex if dom f is a convex set, and f(θx + (1 θ)y) θf(x) + (1 θ)f(y) for all
More informationParts Manual. EPIC II Critical Care Bed REF 2031
EPIC II Critical Care Bed REF 2031 Parts Manual For parts or technical assistance call: USA: 1-800-327-0770 2013/05 B.0 2031-109-006 REV B www.stryker.com Table of Contents English Product Labels... 4
More informationMATH 104: INTRODUCTORY ANALYSIS SPRING 2008/09 PROBLEM SET 8 SOLUTIONS
MATH 04: INTRODUCTORY ANALYSIS SPRING 008/09 PROBLEM SET 8 SOLUTIONS. Let f : R R be continuous periodic with period, i.e. f(x + ) = f(x) for all x R. Prove the following: (a) f is bounded above below
More informationEconomics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011
Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Section 2.6 (cont.) Properties of Real Functions Here we first study properties of functions from R to R, making use of the additional structure
More informationDETERMINATION OF AN UNKNOWN SOURCE TERM IN A SPACE-TIME FRACTIONAL DIFFUSION EQUATION
Journal of Fractional Calculus and Applications, Vol. 6(1) Jan. 2015, pp. 83-90. ISSN: 2090-5858. http://fcag-egypt.com/journals/jfca/ DETERMINATION OF AN UNKNOWN SOURCE TERM IN A SPACE-TIME FRACTIONAL
More informationSTA 4321/5325 Solution to Homework 5 March 3, 2017
STA 4/55 Solution to Homework 5 March, 7. Suppose X is a RV with E(X and V (X 4. Find E(X +. By the formula, V (X E(X E (X E(X V (X + E (X. Therefore, in the current setting, E(X V (X + E (X 4 + 4 8. Therefore,
More informationSolutions to Homework 2
Solutions to Homewor Due Tuesday, July 6,. Chapter. Problem solution. If the series for ln+z and ln z both converge, +z then we can find the series for ln z by term-by-term subtraction of the two series:
More informationDefinition: If y = f(x), then. f(x + x) f(x) y = f (x) = lim. Rules and formulas: 1. If f(x) = C (a constant function), then f (x) = 0.
Definition: If y = f(x), then Rules and formulas: y = f (x) = lim x 0 f(x + x) f(x). x 1. If f(x) = C (a constant function), then f (x) = 0. 2. If f(x) = x k (a power function), then f (x) = kx k 1. 3.
More informationNonlinear equations. Norms for R n. Convergence orders for iterative methods
Nonlinear equations Norms for R n Assume that X is a vector space. A norm is a mapping X R with x such that for all x, y X, α R x = = x = αx = α x x + y x + y We define the following norms on the vector
More informationFunctions. Paul Schrimpf. October 9, UBC Economics 526. Functions. Paul Schrimpf. Definition and examples. Special types of functions
of Functions UBC Economics 526 October 9, 2013 of 1. 2. of 3.. 4 of Functions UBC Economics 526 October 9, 2013 of Section 1 Functions of A function from a set A to a set B is a rule that assigns to each
More informationLecture notes for Macroeconomics I, 2004
Lecture notes for Macroeconomics I, 2004 Per Krusell Please do NOT distribute without permission! Comments and suggestions are welcome. 1 Chapter 3 Dynamic optimization There are two common approaches
More informationMath Camp Notes: Everything Else
Math Camp Notes: Everything Else Systems of Dierential Equations Consider the general two-equation system of dierential equations: Steady States ẋ = f(x, y ẏ = g(x, y Just as before, we can nd the steady
More information176 5 t h Fl oo r. 337 P o ly me r Ma te ri al s
A g la di ou s F. L. 462 E l ec tr on ic D ev el op me nt A i ng er A.W.S. 371 C. A. M. A l ex an de r 236 A d mi ni st ra ti on R. H. (M rs ) A n dr ew s P. V. 326 O p ti ca l Tr an sm is si on A p ps
More informationCOMPLETE METRIC SPACES AND THE CONTRACTION MAPPING THEOREM
COMPLETE METRIC SPACES AND THE CONTRACTION MAPPING THEOREM A metric space (M, d) is a set M with a metric d(x, y), x, y M that has the properties d(x, y) = d(y, x), x, y M d(x, y) d(x, z) + d(z, y), x,
More informationDerivatives of Functions from R n to R m
Derivatives of Functions from R n to R m Marc H Mehlman Department of Mathematics University of New Haven 20 October 2014 1 Matrices Definition 11 A m n matrix, A, is an array of numbers having m rows
More informationData for a vector space
Data for a vector space Aim lecture: We recall the notion of a vector space which provides the context for describing linear phenomena. Throughout the rest of these lectures, F denotes a field. Defn A
More information1 Recursive Formulations
1 Recursive Formulations We wish to solve the following problem: subject to max {a t,x t} T β t r(x t,a t (1 a t Γ(x t (2 x t+1 = t(x t (3 x 0 given. (4 The horizon length, T, can be infinite (in fact,
More informationLecture 4: The Bellman Operator Dynamic Programming
Lecture 4: The Bellman Operator Dynamic Programming Jeppe Druedahl Department of Economics 15th of February 2016 Slide 1/19 Infinite horizon, t We know V 0 (M t ) = whatever { } V 1 (M t ) = max u(m t,
More informationSome Results about the Classification of Totally Real Minimal Surfaces in S 5
Int. J. Contemp. Math. Sciences, Vol. 2, 2007, no. 24, 1175-1181 Some Results about the Classification of Totally Real Minimal Surfaces in S 5 Rodrigo Ristow Montes Departamento de Matemática Universidade
More informationSummer 2017 MATH Solution to Exercise 5
Summer 07 MATH00 Solution to Exercise 5. Find the partial derivatives of the following functions: (a (xy 5z/( + x, (b x/ x + y, (c arctan y/x, (d log((t + 3 + ts, (e sin(xy z 3, (f x α, x = (x,, x n. (a
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 informationf(x) f(z) c x z > 0 1
INVERSE AND IMPLICIT FUNCTION THEOREMS I use df x for the linear transformation that is the differential of f at x.. INVERSE FUNCTION THEOREM Definition. Suppose S R n is open, a S, and f : S R n is a
More informationMunkres Chapter 9. The Fundamental Group
Munkres 51. Homotopy of Paths 1 Munkres Chapter 9. The Fundamental Group Note. These supplemental notes are based on James R. Munkres Topology, 2nd edition, Prentice Hall (2000). Note. We are interested
More informationStereographic projection and inverse geometry
Stereographic projection and inverse geometry The conformal property of stereographic projections can be established fairly efficiently using the concepts and methods of inverse geometry. This topic is
More information1. Gradient method. gradient method, first-order methods. quadratic bounds on convex functions. analysis of gradient method
L. Vandenberghe EE236C (Spring 2016) 1. Gradient method gradient method, first-order methods quadratic bounds on convex functions analysis of gradient method 1-1 Approximate course outline First-order
More information1. The accumulated net change function or area-so-far function
Name: Section: Names of collaborators: Main Points: 1. The accumulated net change function ( area-so-far function) 2. Connection to antiderivative functions: the Fundamental Theorem of Calculus 3. Evaluating
More informationLOWELL WEEKLY JOURNAL.
Y 5 ; ) : Y 3 7 22 2 F $ 7 2 F Q 3 q q 6 2 3 6 2 5 25 2 2 3 $2 25: 75 5 $6 Y q 7 Y Y # \ x Y : { Y Y Y : ( \ _ Y ( ( Y F [ F F ; x Y : ( : G ( ; ( ~ x F G Y ; \ Q ) ( F \ Q / F F \ Y () ( \ G Y ( ) \F
More informationImplicit Functions, Curves and Surfaces
Chapter 11 Implicit Functions, Curves and Surfaces 11.1 Implicit Function Theorem Motivation. In many problems, objects or quantities of interest can only be described indirectly or implicitly. It is then
More informationRECURRENT ITERATED FUNCTION SYSTEMS
RECURRENT ITERATED FUNCTION SYSTEMS ALEXANDRU MIHAIL The theory of fractal sets is an old one, but it also is a modern domain of research. One of the main source of the development of the theory of fractal
More informationExample I: Capital Accumulation
1 Example I: Capital Accumulation Time t = 0, 1,..., T < Output y, initial output y 0 Fraction of output invested a, capital k = ay Transition (production function) y = g(k) = g(ay) Reward (utility of
More informationWeb Solutions for How to Read and Do Proofs
Web Solutions for How to Read and Do Proofs An Introduction to Mathematical Thought Processes Sixth Edition Daniel Solow Department of Operations Weatherhead School of Management Case Western Reserve University
More informationSYSTEM OF CIRCLES If d is the distance between the centers of two intersecting circles with radii r 1, r 2 and θ is the
SYSTEM OF CIRCLES Theorem: If d is the distance between the centers of two intersecting circles with radii r 1, r 2 and θ is the 2 2 2 d r1 r2 angle between the circles then cos θ =. 2r r 1 2 Proof: Let
More informationnd A L T O SOLO LOWELL. MICHIGAN. THURSDAY. APRIL Spring Activities Heads Up and Forward (Editorial By " T h e Committee'')
- 6 7 8 9 3-6 7 8 9 3 G UDY 3 93 VU XXXV U XY F K FD D j V K D V FY G F D Y X K X DD Y j \ V F \ VD GD D U Y 78 K U D Y U Y 484?35 V 93 7 4 U x K 77 - D :3 F K > 6 D x F 5 - - x - G 7 43 8 D $35 K F $5
More informationFUNCTIONAL ANALYSIS HAHN-BANACH THEOREM. F (m 2 ) + α m 2 + x 0
FUNCTIONAL ANALYSIS HAHN-BANACH THEOREM If M is a linear subspace of a normal linear space X and if F is a bounded linear functional on M then F can be extended to M + [x 0 ] without changing its norm.
More informationMath 20C Homework 2 Partial Solutions
Math 2C Homework 2 Partial Solutions Problem 1 (12.4.14). Calculate (j k) (j + k). Solution. The basic properties of the cross product are found in Theorem 2 of Section 12.4. From these properties, we
More informationDRAFT - Math 101 Lecture Note - Dr. Said Algarni
2 Limits 2.1 The Tangent Problems The word tangent is derived from the Latin word tangens, which means touching. A tangent line to a curve is a line that touches the curve and a secant line is a line that
More informationNonlinear Systems and Control Lecture # 12 Converse Lyapunov Functions & Time Varying Systems. p. 1/1
Nonlinear Systems and Control Lecture # 12 Converse Lyapunov Functions & Time Varying Systems p. 1/1 p. 2/1 Converse Lyapunov Theorem Exponential Stability Let x = 0 be an exponentially stable equilibrium
More informationDynamic Programming with Hermite Interpolation
Dynamic Programming with Hermite Interpolation Yongyang Cai Hoover Institution, 424 Galvez Mall, Stanford University, Stanford, CA, 94305 Kenneth L. Judd Hoover Institution, 424 Galvez Mall, Stanford University,
More informationMidterm Examination: Economics 210A October 2011
Midterm Examination: Economics 210A October 2011 The exam has 6 questions. Answer as many as you can. Good luck. 1) A) Must every quasi-concave function must be concave? If so, prove it. If not, provide
More informationMATH MEASURE THEORY AND FOURIER ANALYSIS. Contents
MATH 3969 - MEASURE THEORY AND FOURIER ANALYSIS ANDREW TULLOCH Contents 1. Measure Theory 2 1.1. Properties of Measures 3 1.2. Constructing σ-algebras and measures 3 1.3. Properties of the Lebesgue measure
More informationA Very Brief Summary of Statistical Inference, and Examples
A Very Brief Summary of Statistical Inference, and Examples Trinity Term 2009 Prof. Gesine Reinert Our standard situation is that we have data x = x 1, x 2,..., x n, which we view as realisations of random
More informationScience One Integral Calculus. January 9, 2019
Science One Integral Calculus January 9, 2019 Recap: What have we learned so far? The definite integral is defined as a limit of Riemann sums Riemann sums can be constructed using any point in a subinterval
More information1 FUNCTIONS _ 5 _ 1.0 RELATIONS
1 FUNCTIONS 1.0 RELATIONS Notes : (i) Four types of relations : one-to-one many-to-one one-to-many many-to-many. (ii) Three ways to represent relations : arrowed diagram set of ordered pairs graph. (iii)
More informationNote: Every graph is a level set (why?). But not every level set is a graph. Graphs must pass the vertical line test. (Level sets may or may not.
Curves in R : Graphs vs Level Sets Graphs (y = f(x)): The graph of f : R R is {(x, y) R y = f(x)} Example: When we say the curve y = x, we really mean: The graph of the function f(x) = x That is, we mean
More informationMath 341: Probability Seventeenth Lecture (11/10/09)
Math 341: Probability Seventeenth Lecture (11/10/09) Steven J Miller Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller/ public html/341/ Bronfman Science Center Williams
More informationSection 2.1, Section 3.1 Rate of change, Tangents and Derivatives at a point
Section 2.1, Section 3.1 Rate of change, Tangents and Derivatives at a point Line through P and Q approaches to the tangent line at P as Q approaches P. That is as a + h a = h gets smaller. Slope of the
More informationMathematical Analysis Outline. William G. Faris
Mathematical Analysis Outline William G. Faris January 8, 2007 2 Chapter 1 Metric spaces and continuous maps 1.1 Metric spaces A metric space is a set X together with a real distance function (x, x ) d(x,
More informationContents. An example 5. Mathematical Preliminaries 13. Dynamic programming under certainty 29. Numerical methods 41. Some applications 57
T H O M A S D E M U Y N C K DY N A M I C O P T I M I Z AT I O N Contents An example 5 Mathematical Preliminaries 13 Dynamic programming under certainty 29 Numerical methods 41 Some applications 57 Stochastic
More informationFunctions. A function is a rule that gives exactly one output number to each input number.
Functions A function is a rule that gives exactly one output number to each input number. Why it is important to us? The set of all input numbers to which the rule applies is called the domain of the function.
More informationISOLATED SUBSEMIGROUPS IN THE VARIANTS OF T n. 1. Introduction and description of the results
ISOLATED SUBSEMIGROUPS IN THE VARIANTS OF T n V. MAZORCHUK and G. TSYAPUTA Abstract. We classify all isolated, completely isolated and convex subsemigroups in the semigroup T n of all transformations of
More informationEC /11. Math for Microeconomics September Course, Part II Lecture Notes. Course Outline
LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC400 20010/11 Math for Microeconomics September Course, Part II Lecture Notes Course Outline Lecture 1: Tools for
More informationOptimization Over Time
Optimization Over Time Joshua Wilde, revised by Isabel Tecu and Takeshi Suzuki August 26, 21 Up to this point, we have only considered constrained optimization problems at a single point in time. However,
More informationf(f 1 (B)) B f(f 1 (B)) = B B f(s) f 1 (f(a)) A f 1 (f(a)) = A f : S T 若敘述為真則證明之, 反之則必須給反例 (Q, ) y > 1 y 1/n y t > 1 n > (y 1)/(t 1) y 1/n < t
S T A S B T f : S T f(f 1 (B)) B f(f 1 (B)) = B B f(s) f 1 (f(a)) A f 1 (f(a)) = A f : S T f : S T S T f y T f 1 ({y) f(d 1 D 2 ) = f(d 1 ) f(d 2 ) D 1 D 2 S F x 0 x F x = 0 x = 0 x y = x y x, y F x +
More informationTHE INVERSE FUNCTION THEOREM
THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics http://jipam.vu.edu.au/ Volume 2, Issue 1, Article 12, 2001 ON KY FAN S MINIMAX INEQUALITIES, MIXED EQUILIBRIUM PROBLEMS AND HEMIVARIATIONAL INEQUALITIES
More informationSolutions to Problem Set 2
Solutions to Problem Set Part I/Part II Part I(0 points) (a) ( points) p. 97, Section 3.3, Problem 44 (b) ( points) p. 107, Section 3.5, Problem 15 (c) ( points) p. 110, Section 3.6, Problem 3(c) (d) (
More information88 CHAPTER 3. SYMMETRIES
88 CHAPTER 3 SYMMETRIES 31 Linear Algebra Start with a field F (this will be the field of scalars) Definition: A vector space over F is a set V with a vector addition and scalar multiplication ( scalars
More informationReview all the activities leading to Midterm 3. Review all the problems in the previous online homework sets (8+9+10).
MA109, Activity 34: Review (Sections 3.6+3.7+4.1+4.2+4.3) Date: Objective: Additional Assignments: To prepare for Midterm 3, make sure that you can solve the types of problems listed in Activities 33 and
More informationLinear and Loglinear Approximations (Started: July 7, 2005; Revised: February 6, 2009)
Dave Backus / NYU Linear and Loglinear Approximations (Started: July 7, 2005; Revised: February 6, 2009) Campbell s Inspecting the mechanism (JME, 1994) added some useful intuition to the stochastic growth
More informationDerivatives and Integrals
Derivatives and Integrals Definition 1: Derivative Formulas d dx (c) = 0 d dx (f ± g) = f ± g d dx (kx) = k d dx (xn ) = nx n 1 (f g) = f g + fg ( ) f = f g fg g g 2 (f(g(x))) = f (g(x)) g (x) d dx (ax
More information(FALL 2011) 225A - DIFFERENTIAL TOPOLOGY FINAL < HOPF DEGREE THEOREM >
(FALL 2011) 225A - DIFFERENTIAL TOPOLOGY FINAL < HOPF DEGREE THEOREM > GEUNHO GIM 1. Without loss of generality, we can assume that x = z = 0. Let A = df 0. By regularity at 0, A is a linear isomorphism.
More informationMath 106 Calculus 1 Topics for first exam
Chapter 2: Limits and Continuity Rates of change and its: Math 06 Calculus Topics for first exam Limit of a function f at a point a = the value the function should take at the point = the value that the
More informationFUNDAMENTAL GROUPS AND THE VAN KAMPEN S THEOREM
FUNDAMENTAL GROUPS AND THE VAN KAMPEN S THEOREM ANG LI Abstract. In this paper, we start with the definitions and properties of the fundamental group of a topological space, and then proceed to prove Van-
More informationEC /11. Math for Microeconomics September Course, Part II Problem Set 1 with Solutions. a11 a 12. x 2
LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC400 2010/11 Math for Microeconomics September Course, Part II Problem Set 1 with Solutions 1. Show that the general
More information6. Proximal gradient method
L. Vandenberghe EE236C (Spring 2016) 6. Proximal gradient method motivation proximal mapping proximal gradient method with fixed step size proximal gradient method with line search 6-1 Proximal mapping
More informationMilnor s Exotic 7-Spheres Jhan-Cyuan Syu ( June, 2017 Introduction
許展銓 1 2 3 R 4 R 4 R n n 4 R 4 ξ : E π M 2n J : E E R J J(v) = v v E ξ ξ ξ R ξ : E π M M ξ : Ē π M ξ ξ R = ξ R i : E Ē i(cv) = ci(v) c C v E ξ : E π M n M c(ξ) = c i (ξ) H 2n (M, Z) i 0 c 0 (ξ) = 1 c i
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: Linear algebra. 4. Solutions of linear equation systems The fundamental theorem of linear algebra
Lecture: Linear algebra. 1. Subspaces. 2. Orthogonal complement. 3. The four fundamental subspaces 4. Solutions of linear equation systems The fundamental theorem of linear algebra 5. Determining the fundamental
More informationChapter 7 Polynomial Functions. Factoring Review. We will talk about 3 Types: ALWAYS FACTOR OUT FIRST! Ex 2: Factor x x + 64
Chapter 7 Polynomial Functions Factoring Review We will talk about 3 Types: 1. 2. 3. ALWAYS FACTOR OUT FIRST! Ex 1: Factor x 2 + 5x + 6 Ex 2: Factor x 2 + 16x + 64 Ex 3: Factor 4x 2 + 6x 18 Ex 4: Factor
More information