The HJB-POD approach for infinite dimensional control problems
|
|
- Christina Skinner
- 6 years ago
- Views:
Transcription
1 The HJB-POD approach for infinite dimensional control problems M. Falcone works in collaboration with A. Alla, D. Kalise and S. Volkwein Università di Roma La Sapienza OCERTO Workshop Cortona, June 22, 26 M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach / 48
2 Outline Outline HJ equations, DP schemes and feedback synthesis HJ Equations Numerical scheme for HJ equation 2 Efficient numerical methods for HJ equations A quick overview Accelerated iterative schemes 3 HJB-POD method for high dimensional problem A-priori estimates for the HJB approximation A-priori estimates for the HJB-POD approximation 4 Numerical Tests M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 2 / 48
3 Outline Introduction The Dynamic Programming Principle allows to derive a first order partial differential equation describing the value function associated to the optimal control problem (in finite or infinite dimension). The theory of viscosity solutions allows to characterize the value function as the unique weak solution of the Bellman equation. This characterization has been used also to construct numerical schemes for the value function and to compute optimal feedbacks. Reference M. Bardi, I. Capuzzo Dolcetta, Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations, 997. M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 3 / 48
4 Outline DP s advantages and disadvantages PROS. The characterization of the value function is valid for all classical problems in any dimension. 2. The approximation is based on a-priori error estimates in L and is valid in any dimension 3. DP (semi-lagrangian) schemes can work on structured and unstructured grids. 4. The computation of feedbacks is almost built in and there are nice results in low dimension. M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 4 / 48
5 Outline DP s advantages and disadvantages PROS. The characterization of the value function is valid for all classical problems in any dimension. 2. The approximation is based on a-priori error estimates in L and is valid in any dimension 3. DP (semi-lagrangian) schemes can work on structured and unstructured grids. 4. The computation of feedbacks is almost built in and there are nice results in low dimension. CONS The "curse of dimensionality" makes the problem difficult to solve in high dimension due to. computational cost 2. huge memory allocations. M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 4 / 48
6 Outline HJ equations, DP schemes and feedback synthesis HJ equations, DP schemes and feedback synthesis HJ Equations Numerical scheme for HJ equation 2 Efficient numerical methods for HJ equations A quick overview Accelerated iterative schemes 3 HJB-POD method for high dimensional problem A-priori estimates for the HJB approximation A-priori estimates for the HJB-POD approximation 4 Numerical Tests M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 5 / 48
7 HJ equations, DP schemes and feedback synthesis HJ Equations HJB equation for the infinite horizon problem Controlled Dynamics and Cost Functional { ẏ(t) = f (y(t), u(t)), t (t, + ] y(t ) = x, Infinite horizon cost functional Value Function J x (y, u) = + v(x) := g(y(s), u(s))e λs ds inf J x(y, u( )). u( ) U M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 6 / 48
8 HJ equations, DP schemes and feedback synthesis Numerical scheme for HJ equation Value and HJB equation: infinite horizon problem Dynamic Programming Principle { τ } v(x) = min e λs g(y x (s), u(s)) ds + v(y x (τ))e λτ u U t By Dynamic Programming we get the stationary Bellman equation λv(x) + max{ f (x, u) v(x) g(x, u)} =, x u U Rn Since the value function is in general not regular we need to use weak solutions, typically Lipschitz continuous. The value function is the unique viscosity solution of the Bellman equation. The construction of the approximation scheme can be obtained via a discrete dynamic programming approach. State constraints can also be included. M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 7 / 48
9 HJ equations, DP schemes and feedback synthesis Synthesis of feedback controls Numerical scheme for HJ equation The numerical solution of optimal control problems via HJB PDEs leads to the computation of feedback controls for generic nonlinear Lipschitz continuous vectorfields and costs. Solving λv(x) + max{ f (x, u) v(x) g(x, u)} =, x u U Ω we get the value function on a grid and we extend it to the whole domain. Then, we can also compute a feedback map u : Ω U u (x) arg min{f (x, u) v(x) + g(x, u)}, x u U Ω which is used to compute optimal trajectories by an ODE scheme. M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 8 / 48
10 HJ equations, DP schemes and feedback synthesis Numerical scheme for HJ equation The Zermelo navigation problem Value Function Feedback M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 9 / 48
11 Outline Efficient numerical methods for HJ equations HJ equations, DP schemes and feedback synthesis HJ Equations Numerical scheme for HJ equation 2 Efficient numerical methods for HJ equations A quick overview Accelerated iterative schemes 3 HJB-POD method for high dimensional problem A-priori estimates for the HJB approximation A-priori estimates for the HJB-POD approximation 4 Numerical Tests M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach / 48
12 Efficient numerical methods for HJ equations A quick overview How can we compute the value function? The bottleneck of the DP approach is the computation of the value function, since this requires to solve a non linear PDE in high-dimension. This is a challenging problem due to the huge number of nodes involved and to the singularities of the solution. This goal has motivated new efforts in several directions: Domain Decomposition (DD) Fast Marching Methods (FMM) Accelerated iterative schemes M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach / 48
13 Efficient numerical methods for HJ equations Accelerated iterative schemes Semi-Lagrangian discretization of HJB Dynamic Programming Principle { τ } v(x) = min e λs g(y x (s), u(s)) ds + v(y x (τ))e λτ u U t Time-Discrete Approximation via Value Iteration V k+ i = min u U {e λ t V k (x i + t f (x i, u)) + t g (x i, u)} Fix a grid in Ω with Ω R n bounded, Steps x. Nodes: {x,..., x N }, Discrete solution: V i v(x i ). Stability for large time steps t M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 2 / 48
14 Efficient numerical methods for HJ equations Accelerated iterative schemes Semi-Lagrangian discretization of HJB The most standard way to solve this system is the Value Iteration (VI). Fully discrete SL-FEM/ Value Iteration (VI) scheme ( T (V k ) Some advantages: V k+ ) = T (V k ), for i =,..., N i min u U {e λ t I[V k ](x i + t f (x i, u)) + g(x i, u)} Simple to implement (for I = I,the P interpolation operator) (VI) Converges under very general assumptions. WARNING: Rather expensive in terms of CPU time, since β = e λ t the Lipschitz constant of T goes to when t. M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 3 / 48
15 Efficient numerical methods for HJ equations Accelerated iterative schemes Semi-Lagrangian discretization of HJB Fully-Discrete Approximation (Value Iteration) V k+ i = min u U {e λ t I [ V k] (x i + t f (x i, u)) + t L (x i, u)} This algorithm converges for any initial guess V. Error Estimate: [F. 987] max v(x i ) V i C t /2 L + f x i N G λ(λ L f ) t. N G = number of nodes, L f = Lipschitz constant of the dynamics f. M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 4 / 48
16 Efficient numerical methods for HJ equations Accelerated iterative schemes Policy iteration An alternative form to solve this problem is the iteration in the policy space [Bellman 955, Howard 96]. Fully discrete SL-FEM/ Policy Iteration (PI) scheme Fix u i U, for i =,..., K. 2 Solve (V k ) i = βi [V k ](x i + t f (x i, u k i )) + t g(x i, u k i ). 3 Update u k+ i = argmin{i [V k ](x i + t f (x i, u)) + t g(x i, u)}. u U 4 Repeat until matching convergence criteria (can be set on V or u).typically we use V k+ V k < ɛ as stopping rule. M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 5 / 48
17 Efficient numerical methods for HJ equations Numerical Fact #: PI is faster Accelerated iterative schemes V k V evolution for VI (2D MTP) 2 2 DoF 4 2 DoF 8 2 DoF 6 2 DoF L error # of iterations M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 6 / 48
18 Efficient numerical methods for HJ equations Numerical Fact #: PI is faster Accelerated iterative schemes V k V evolution for PI (2D MTP) 2 2 DoF 4 2 DoF 8 2 DoF 6 2 DoF L error # of iterations M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 7 / 48
19 Efficient numerical methods for HJ equations Accelerated iterative schemes Numerical Fact #2: PI is sensitive to u i. V k V evolution for PI with different u i.9.8 Guess Guess 2 Guess 3 Guess 4 L error # of iterations M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 8 / 48
20 Efficient numerical methods for HJ equations Accelerated iterative schemes Numerical Fact #2: PI is sensitive to u i. PI inner solver iteration subcount (2D MTP) 8 7 Guess Guess 4 Guess 3 6 Subiterations count # of global iterations M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 9 / 48
21 Efficient numerical methods for HJ equations Accelerated iterative schemes Num. Fact #3: VI is fast in coarse meshes. V k V evolution for VI (2D MTP) 2 2 DoF 4 2 DoF 8 2 DoF 6 2 DoF L error # of iterations M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 2 / 48
22 Efficient numerical methods for HJ equations Accelerated iterative schemes The accelerated algorithm (Alla, F., Kalise, 25) Theoretical results have established a link between VI and PI in control problems and games [Puterman and Brumelle (979), Bokanowski, Maroso and Zidani (29)]. Numerically, PI strongly depends on a good initialization. Similar approaches have been studied by González and Sagastizábal (99), Chow (99), Seeck (997), and Grüne (24). The Accelerated PI (API) algorithm Consider two mesh parameters k and k 2, k > k 2. Set V k. 2 Perform a coarse VI in the k mesh with result V k. 3 Vk 2 = I [Vk ] and uk 2 = argmin{i [Vk 2 ](x i + hf (x i, u))}. u U 4 start PI solver over the k 2 -mesh. M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 2 / 48
23 Efficient numerical methods for HJ equations Test : different performances Accelerated iterative schemes L -norm V k V evolution. 2D EIKONAL EQUATION,6 CONTROLS, DELTAX=.25. Value Iteration Policy Iteration Accelerated PI L inf NORM CPU TIME M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 22 / 48
24 Outline HJB-POD method for high dimensional problem HJ equations, DP schemes and feedback synthesis HJ Equations Numerical scheme for HJ equation 2 Efficient numerical methods for HJ equations A quick overview Accelerated iterative schemes 3 HJB-POD method for high dimensional problem A-priori estimates for the HJB approximation A-priori estimates for the HJB-POD approximation 4 Numerical Tests M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 23 / 48
25 HJB-POD method for high dimensional problem Control of Partial Differential Equations via DP The discretization of a PDE leads to a large system of ODEs. The approximation of the correspondent HJB equations becomes unfeasible because of the curse of dimensionality. Model Reduction via Proper Ortoghonal Decomposition POD decomposition allows to reduce the number of variables to approximate partial differential equations. GOAL: to approximate PDE optimal control problems in a rather small dimension via POD using numerical schemes for HJB equations. References Kunisch and Volkwein (2,...), Kunisch, Volkwein and Xie (24), Alla-F. (23, 24), Alla-Hinze (25). M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 24 / 48
26 HJB-POD method for high dimensional problem Proper Orthogonal Decomposition and SVD Given snapshots : (y(t, u),..., y(t m, u)) R n We look for an orthonormal basis {ψ i } l i= in Rm with l min{n, m} s.t. J(ψ,..., ψ l ) = m l 2 d α j y j y j, ψ i ψ i = j= i= i=l+ σ 2 i reaches a minimum where {α j } n j= R+. min J(ψ,..., ψ l ) s.t. ψ i, ψ j = δ ij Singular Value Decomposition: Y = ΨΣV T. For l {,..., d = rank(y )}, {ψ i } l i= is called the POD basis of rank l. Ansatz: l y(x, t) yi l (t)ψ i(x) i= M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 25 / 48
27 HJB-POD method for high dimensional problem Reduced Order Modeling Control Problem min J l (y l, u) y l satisfies the reduced dynamics { ẏ l (t) = F l (y l (t), u(t)) t >, y l (t ) = y l Rl. The cost functional is: J l y l (y l, u) = Reduced Value Function v(y l ) = g l (y l (t), u(t))e λt dt inf J l (y l, u) u U y l ad M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 26 / 48
28 HJB-POD method for high dimensional problem Reduced Domain (in the POD space) for HJB We are going to solve the HJB equation in a box: [a, b ]... [a l, b l ] The box must be chosen such that the dynamic contains all the possible controlled trajectories. We discretize the control space U by a discrete set {u,..., u M }. l y(t) = < y(t, u j ), ψ i > ψ i = i= and we choose the box to guarantee l i= y l i (t, u j)ψ i y l i (t, u j) [a i, b i ], j =,..., M. M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 27 / 48
29 HJB-POD method for high dimensional problem Back to the infinite horizon problem A-priori estimates for the HJB approximation Let us consider the controlled dynamics ẏ(t) = f ( y(t), u(t) ) R n for t >, y() = y R n () where f : R n R m R n The infinite horizon cost functional is J(y, u) = where λ > and g : R n R m R. The set of admissible controls has the form g ( y(t), u(t) ) e λt dt (2) U ad = { u U u(t) U ad for almost all t }, where U = L 2 (, ; R m ) and U ad R m is a compact, convex subset. M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 28 / 48
30 HJB-POD method for high dimensional problem A-priori estimates for the HJB approximation Variational formulation of the dynamics Let M R n n denote a symmetric, positive definite (mass) matrix with smallest and largest positive eigenvalues λ min and λ max, respectively. We introduce the following weighted inner product in R n : y, ỹ M = y Mỹ for y, ỹ R n, By M =, /2 M we define the associated induced norm. Recall that we have Then, y is a trajectory if λ min y 2 2 y 2 M λ max y 2 2 for all y R n. ẏ(t) f (y(t), u(t)), ϕ M = for all ϕ R n and for almost all t >, y() y, ϕ M = for all ϕ R n (3) M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 29 / 48
31 HJB-POD method for high dimensional problem The infinite horizon problem A-priori estimates for the HJB approximation Assume that the dynamics has a unique solution y = y(u; y ) Y = H (, ; R n ) for every admissible control u U ad and for every initial condition y R n, denoted by y(u; y ). Reduced cost functional Ĵ(u; y ) = J(y(u; y ), u) for u U ad and y R n, Then, our optimal control problem for y R n is min Ĵ(u; y ). u U ad ( P) M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 3 / 48
32 HJB-POD method for high dimensional problem ASSUMPTIONS A-priori estimates for the HJB approximation (A) f : R n R m R n is continuous and f (y, u) f (ỹ, u) 2 L f y ỹ 2 for all y, ỹ R n and u U ad Moreover, f (y, u) M f for all (y, u) Ω U ad. (A2) g : R n R m R n is continuous and globally Lipschitz continuous. Moreover, g(y, u) M g for all (y, u) Ω U ad. If (A) (A2) hold and λ > L f, v h is globally Lipschitz-continuous v h (y) v h (ỹ) L g λ L f y ỹ 2 y, ỹ Ω and h [, /λ) M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 3 / 48
33 HJB-POD method for high dimensional problem A-priori estimates for the HJB approximation A-priori estimate for HJB [F87] Theorem Let (A) (A2) hold and λ > max{l g, L f }. Let v and v h be the continuous and semi-discrete solutions respectively. Moreover, assume semiconcavity, i.e. f (y + ỹ, u) 2f (y, u) + f (y ỹ, u) 2 C f ỹ 2 2, g(y + ỹ, u) 2g(y, u) + g(y ỹ, u) C g ỹ 2 2 (4) for all (y, ỹ, u) R n R n U ad. Then, sup y R n v(y) v h (y) Ch for any h [, /λ). M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 32 / 48
34 HJB-POD method for high dimensional problem A-priori estimates for the HJB-POD approximation An estimate for the HJB-POD approximation We introduce two different POD approximations for the HJB equation. A first estimate is based on the fully discrete HJB equation, where we project all vertices {y i } n S i= into Rl by setting y l i = Ψ My i for i =,..., n S. Here we assume yi l yj l for i, j {,..., n S } with i j. Then, a POD discretization of HJB in the reduced space is given by v l hk (y l i ) = min u U ad { ( λh)v l hk ( y l i + hf l (y l i, u)) + hg l (y l i, u)} (5) for i n S. M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 33 / 48
35 HJB-POD method for high dimensional problem A-priori estimates for the HJB-POD approximation An estimate for the HJB-POD approximation Let us define the mapping ṽ l hk : Ω R by ṽ l hk (y) = v l hk (Ψ My) for all y Ω with Ψ My Ω. Thus, (5) can be written as ṽhk l (y { i) = min ( λh)ṽ l ( hk yi + hf (P l y i, u) ) + hg(p l y i, u) } (6) u U ad for i n S. M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 34 / 48
36 HJB-POD method for high dimensional problem A-priori estimates for the HJB-POD approximation An estimate for the HJB-POD approximation To simplify, let us assume the invariance condition for the reduced order dynamics y i + hf (P l y i, u) Ω for i =,..., n S, u U ad (A3) Theorem Assume that (A) (A2), (A3) and λ > L f hold. Then, there exist two constants Ĉ, Ĉ such that ( sup v h (y) ṽhk l (y) k Ĉ y Ω h + ns ) /2 Ĉ y i P l y i 2 2 i= for any h [, /λ) M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 35 / 48
37 HJB-POD method for high dimensional problem A-priori estimates for the HJB-POD approximation An estimate for the HJB-POD approximation By the previous results we conclude Theorem Assume that (A) (A2), (A3) and (A4) hold. Let f, g satisfy the semiconcavity conditions. If λ > max{l f, L g }, then there exists constants C, C, C 2 such that ( sup v(y) ṽhk l (y) k C h + C y Ω h + C ns ) /2 2 y i P l y i 2 2 i= for any h [, /λ). M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 36 / 48
38 Outline Numerical Tests HJ equations, DP schemes and feedback synthesis HJ Equations Numerical scheme for HJ equation 2 Efficient numerical methods for HJ equations A quick overview Accelerated iterative schemes 3 HJB-POD method for high dimensional problem A-priori estimates for the HJB approximation A-priori estimates for the HJB-POD approximation 4 Numerical Tests M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 37 / 48
39 Numerical Tests Test 3: Advection-Diffusion Equation Advection-Diffusion Equation y t εy xx + βy x = χ Ωc (x)u(t) in Ω (, ], y(, ) = y, in Ω, y(, t) = in Ω (, T ), (7) Cost Functional Parameters J(y, u, t) = ( y(x, τ) 2 + γ u(τ) 2) e λτ dτ. ε =., β =, γ =., y (x) =.5 sin(πx), Ω = [, 2], Ω c = (.5, ), U = [ 2.2, ]; Snapshots: x =., t =.. VF: x = {.,.5}, t =. x; Trajectories: t =.; M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 38 / 48
40 Numerical Tests Test 3: Advection-Diffusion Equation time time time Controls time time Figure: Test 3: Uncontrolled (left), LQR optimal (middle), HJB-POD (right). M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 39 / 48
41 Numerical Tests Test 3: Advection-Diffusion Equation K=. K= k=. k= K=. K= Number of POD basis Number of POD basis Number of POD basis Figure: Evaluation of the cost functional (left), L 2 error for y(u l ) and y l (u l ) (middle) and L 2 -error between LQR solution and y(u l ). M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 4 / 48
42 Numerical Tests Test 4: Semi-linear Equation Semi-Linear Equation y t εy xx + βy x + µ(y y 3 ) = y (x)u(t) in Ω (, ], y(, ) = y, in Ω, y(, t) = in Ω (, T ), Cost Functional Parameters J(y, u, t) = ( y(x, τ) 2 + γ u(τ) 2) e λτ dτ. ε =. = β, µ =, γ =., y (x) = sin(πx), Ω = [, ], U = [, ]; Snapshots: x =., t =.. VF: x = {.,.5}, t =. x; Trajectories: t =.; M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 4 / 48
43 Numerical Tests Test 4: Semi-linear Equation time time time time time Figure: Uncontrolled (left), Optimal (middle) and optimal HJB control (right). M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 42 / 48
44 Test 5: Wave Equation Numerical Tests Damped Wave Equation y tt y xx βy xxt = χ Ωc (x)u(t) in Ω (, ], y(, ) = y, y t (, ) = y in Ω, y(, t) = in Ω (, T ), Cost Functional Parameters J(y, u, t) = ( y(x, τ) 2 + γ u(τ) 2) e λτ dτ. β =.5, γ =., y (x) = sin(πx), y (x) =, Ω = [, ], Ω c = (.4,.6), U = [.2,.6]; Snapshots: x =., t =.. VF: t =., x =.; Trajectories: t =.; M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 43 / 48
45 Numerical Tests Test 5: Wave Equation, Optimal Solution TIME TIME `=3 `=4 `=5.2 TIME k =. k = Table: H error between LQR control and HJB-POD approx. at time t = 4. M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 44 / 48
46 Numerical Tests Test 5: Wave Equation, Stabilization of the feedback Figure: Feedback Control with Chattering (left) LQR control (right)), M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 45 / 48
47 Numerical Tests Wave Equation: Stabilization of the feedback Figure: Feedback Control with Chattering (left), Stabilized feedback control with limited chattering (right) M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 46 / 48
48 Numerical Tests CONCLUSIONS Accelerated Policy Iteration speeds up the numerical approximation of the value function Model reduction via POD is crucial in order to make the problem feasible Feedback Control for PDEs is obtained via the POD-HJB approach The chattering of the feedback control for finite and infinite dimensional problem can be reduced A-priori error estimation are available M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 47 / 48
49 Numerical Tests References for this talk A. Alla, M. Falcone An adaptive POD approximation method for the control of advection-diffusions equation, 23. A. Alla, M. Falcone, D. Kalise, An efficient Policy Iteration algorithm for Dynamic Programming equations, 25. A. Alla, M. Falcone, D. Kalise, A HJB-POD feedback synthesis approach for the wave equation, 25. A. Alla, M. Falcone, S. Volkwein, Error Analysis for POD approximations of infinite horizon problems via the dynamic programming principle, submitted 25. M. Bardi, I. Capuzzo Dolcetta. Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations, Birkhauser,Basel, 997. M. Falcone, R. Ferretti, Semi-Lagrangian approximation schemes for linear and Hamilton-Jacobi equations, SIAM, 24. K. Kunisch, S. Volkwein, L. Xie, HJB-POD Based Feedback Design for the Optimal Control of Evolution Problems, 24. S. Volkwein. Model Reduction using Proper Orthogonal Decomposition, Lecture Notes, 23. M. Falcone (Università di Roma La Sapienza ) The HJB-POD approach 48 / 48
Numerical approximation for optimal control problems via MPC and HJB. Giulia Fabrini
Numerical approximation for optimal control problems via MPC and HJB Giulia Fabrini Konstanz Women In Mathematics 15 May, 2018 G. Fabrini (University of Konstanz) Numerical approximation for OCP 1 / 33
More informationNumerical Methods for Optimal Control Problems. Part I: Hamilton-Jacobi-Bellman Equations and Pontryagin Minimum Principle
Numerical Methods for Optimal Control Problems. Part I: Hamilton-Jacobi-Bellman Equations and Pontryagin Minimum Principle Ph.D. course in OPTIMAL CONTROL Emiliano Cristiani (IAC CNR) e.cristiani@iac.cnr.it
More informationAn adaptive RBF-based Semi-Lagrangian scheme for HJB equations
An adaptive RBF-based Semi-Lagrangian scheme for HJB equations Roberto Ferretti Università degli Studi Roma Tre Dipartimento di Matematica e Fisica Numerical methods for Hamilton Jacobi equations in optimal
More informationFiltered scheme and error estimate for first order Hamilton-Jacobi equations
and error estimate for first order Hamilton-Jacobi equations Olivier Bokanowski 1 Maurizio Falcone 2 2 1 Laboratoire Jacques-Louis Lions, Université Paris-Diderot (Paris 7) 2 SAPIENZA - Università di Roma
More informationFast Marching Methods for Front Propagation Lecture 1/3
Outline for Front Propagation Lecture 1/3 M. Falcone Dipartimento di Matematica SAPIENZA, Università di Roma Autumn School Introduction to Numerical Methods for Moving Boundaries ENSTA, Paris, November,
More informationSuboptimal feedback control of PDEs by solving Hamilton-Jacobi Bellman equations on sparse grids
Suboptimal feedback control of PDEs by solving Hamilton-Jacobi Bellman equations on sparse grids Jochen Garcke joint work with Axel Kröner, INRIA Saclay and CMAP, Ecole Polytechnique Ilja Kalmykov, Universität
More informationarxiv: v1 [math.na] 29 Jul 2018
AN EFFICIENT DP ALGORITHM ON A TREE-STRUCTURE FOR FINITE HORIZON OPTIMAL CONTROL PROBLEMS ALESSANDRO ALLA, MAURIZIO FALCONE, LUCA SALUZZI arxiv:87.8v [math.na] 29 Jul 28 Abstract. The classical Dynamic
More informationPOD for Parametric PDEs and for Optimality Systems
POD for Parametric PDEs and for Optimality Systems M. Kahlbacher, K. Kunisch, H. Müller and S. Volkwein Institute for Mathematics and Scientific Computing University of Graz, Austria DMV-Jahrestagung 26,
More informationProper Orthogonal Decomposition for Optimal Control Problems with Mixed Control-State Constraints
Proper Orthogonal Decomposition for Optimal Control Problems with Mixed Control-State Constraints Technische Universität Berlin Martin Gubisch, Stefan Volkwein University of Konstanz March, 3 Martin Gubisch,
More informationarxiv: v1 [math.na] 28 Dec 2018
ERROR ESTIMATES FOR A TREE STRUCTURE ALGORITHM SOLVING FINITE HORIZON CONTROL PROBLEMS LUCA SALUZZI, ALESSANDRO ALLA, MAURIZIO FALCONE, arxiv:1812.11194v1 [math.na] 28 Dec 2018 Abstract. In the Dynamic
More informationProper Orthogonal Decomposition. POD for PDE Constrained Optimization. Stefan Volkwein
Proper Orthogonal Decomposition for PDE Constrained Optimization Institute of Mathematics and Statistics, University of Constance Joined work with F. Diwoky, M. Hinze, D. Hömberg, M. Kahlbacher, E. Kammann,
More informationThe Kuratowski Ryll-Nardzewski Theorem and semismooth Newton methods for Hamilton Jacobi Bellman equations
The Kuratowski Ryll-Nardzewski Theorem and semismooth Newton methods for Hamilton Jacobi Bellman equations Iain Smears INRIA Paris Linz, November 2016 joint work with Endre Süli, University of Oxford Overview
More informationpacman A classical arcade videogame powered by Hamilton-Jacobi equations Simone Cacace Universita degli Studi Roma Tre
HJ pacman A classical arcade videogame powered by Hamilton-Jacobi equations Simone Cacace Universita degli Studi Roma Tre Control of State Constrained Dynamical Systems 25-29 September 2017, Padova Main
More informationProper Orthogonal Decomposition (POD) for Nonlinear Dynamical Systems. Stefan Volkwein
Proper Orthogonal Decomposition (POD) for Nonlinear Dynamical Systems Institute for Mathematics and Scientific Computing, Austria DISC Summerschool 5 Outline of the talk POD and singular value decomposition
More informationOptimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations
Martino Bardi Italo Capuzzo-Dolcetta Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations Birkhauser Boston Basel Berlin Contents Preface Basic notations xi xv Chapter I. Outline
More informationEN Applied Optimal Control Lecture 8: Dynamic Programming October 10, 2018
EN530.603 Applied Optimal Control Lecture 8: Dynamic Programming October 0, 08 Lecturer: Marin Kobilarov Dynamic Programming (DP) is conerned with the computation of an optimal policy, i.e. an optimal
More informationProper Orthogonal Decomposition (POD)
Intro Results Problem etras Proper Orthogonal Decomposition () Advisor: Dr. Sorensen CAAM699 Department of Computational and Applied Mathematics Rice University September 5, 28 Outline Intro Results Problem
More informationINTERPRETATION OF PROPER ORTHOGONAL DECOMPOSITION AS SINGULAR VALUE DECOMPOSITION AND HJB-BASED FEEDBACK DESIGN PAPER MSC-506
INTERPRETATION OF PROPER ORTHOGONAL DECOMPOSITION AS SINGULAR VALUE DECOMPOSITION AND HJB-BASED FEEDBACK DESIGN PAPER MSC-506 SIXTEENTH INTERNATIONAL SYMPOSIUM ON MATHEMATICAL THEORY OF NETWORKS AND SYSTEMS
More informationProper Orthogonal Decomposition in PDE-Constrained Optimization
Proper Orthogonal Decomposition in PDE-Constrained Optimization K. Kunisch Department of Mathematics and Computational Science University of Graz, Austria jointly with S. Volkwein Dynamic Programming Principle
More informationSuboptimal feedback control of PDEs by solving HJB equations on adaptive sparse grids
Wegelerstraße 6 53115 Bonn Germany phone +49 228 73-3427 fax +49 228 73-7527 www.ins.uni-bonn.de Jochen Garcke and Axel Kröner Suboptimal feedback control of PDEs by solving HJB equations on adaptive sparse
More informationSuboptimal Open-loop Control Using POD. Stefan Volkwein
Institute for Mathematics and Scientific Computing University of Graz, Austria PhD program in Mathematics for Technology Catania, May 22, 2007 Motivation Optimal control of evolution problems: min J(y,
More informationThuong Nguyen. SADCO Internal Review Metting
Asymptotic behavior of singularly perturbed control system: non-periodic setting Thuong Nguyen (Joint work with A. Siconolfi) SADCO Internal Review Metting Rome, Nov 10-12, 2014 Thuong Nguyen (Roma Sapienza)
More informationOptimal Control Theory
Optimal Control Theory The theory Optimal control theory is a mature mathematical discipline which provides algorithms to solve various control problems The elaborate mathematical machinery behind optimal
More informationMean field games and related models
Mean field games and related models Fabio Camilli SBAI-Dipartimento di Scienze di Base e Applicate per l Ingegneria Facoltà di Ingegneria Civile ed Industriale Email: Camilli@dmmm.uniroma1.it Web page:
More informationModel order reduction & PDE constrained optimization
1 Model order reduction & PDE constrained optimization Fachbereich Mathematik Optimierung und Approximation, Universität Hamburg Leuven, January 8, 01 Names Afanasiev, Attwell, Burns, Cordier,Fahl, Farrell,
More informationExam February h
Master 2 Mathématiques et Applications PUF Ho Chi Minh Ville 2009/10 Viscosity solutions, HJ Equations and Control O.Ley (INSA de Rennes) Exam February 2010 3h Written-by-hands documents are allowed. Printed
More informationValue Function and Optimal Trajectories for some State Constrained Control Problems
Value Function and Optimal Trajectories for some State Constrained Control Problems Hasnaa Zidani ENSTA ParisTech, Univ. of Paris-saclay "Control of State Constrained Dynamical Systems" Università di Padova,
More informationA Semi-Lagrangian scheme for a regularized version of the Hughes model for pedestrian flow
A Semi-Lagrangian scheme for a regularized version of the Hughes model for pedestrian flow Adriano FESTA Johann Radon Institute for Computational and Applied Mathematics (RICAM) Austrian Academy of Sciences
More informationNumerical Optimal Control Overview. Moritz Diehl
Numerical Optimal Control Overview Moritz Diehl Simplified Optimal Control Problem in ODE path constraints h(x, u) 0 initial value x0 states x(t) terminal constraint r(x(t )) 0 controls u(t) 0 t T minimize
More informationComputational Issues in Nonlinear Dynamics and Control
Computational Issues in Nonlinear Dynamics and Control Arthur J. Krener ajkrener@ucdavis.edu Supported by AFOSR and NSF Typical Problems Numerical Computation of Invariant Manifolds Typical Problems Numerical
More informationA model order reduction technique for speeding up computational homogenisation
A model order reduction technique for speeding up computational homogenisation Olivier Goury, Pierre Kerfriden, Wing Kam Liu, Stéphane Bordas Cardiff University Outline Introduction Heterogeneous materials
More informationViscosity Solutions of the Bellman Equation for Perturbed Optimal Control Problems with Exit Times 0
Viscosity Solutions of the Bellman Equation for Perturbed Optimal Control Problems with Exit Times Michael Malisoff Department of Mathematics Louisiana State University Baton Rouge, LA 783-4918 USA malisoff@mathlsuedu
More informationOn the Bellman equation for control problems with exit times and unbounded cost functionals 1
On the Bellman equation for control problems with exit times and unbounded cost functionals 1 Michael Malisoff Department of Mathematics, Hill Center-Busch Campus Rutgers University, 11 Frelinghuysen Road
More informationAn optimal control problem for a parabolic PDE with control constraints
An optimal control problem for a parabolic PDE with control constraints PhD Summer School on Reduced Basis Methods, Ulm Martin Gubisch University of Konstanz October 7 Martin Gubisch (University of Konstanz)
More informationNumerical algorithms for one and two target optimal controls
Numerical algorithms for one and two target optimal controls Sung-Sik Kwon Department of Mathematics and Computer Science, North Carolina Central University 80 Fayetteville St. Durham, NC 27707 Email:
More informationMatrix stabilization using differential equations.
Matrix stabilization using differential equations. Nicola Guglielmi Universitá dell Aquila and Gran Sasso Science Institute, Italia NUMOC-2017 Roma, 19 23 June, 2017 Inspired by a joint work with Christian
More informationNumerical schemes of resolution of stochastic optimal control HJB equation
Numerical schemes of resolution of stochastic optimal control HJB equation Elisabeth Ottenwaelter Journée des doctorants 7 mars 2007 Équipe COMMANDS Elisabeth Ottenwaelter (INRIA et CMAP) Numerical schemes
More informationPolynomial approximation of high-dimensional Hamilton-Jacobi-Bellman equations and applications to feedback control of semilinear parabolic PDEs
www.oeaw.ac.at Polynomial approximation of high-dimensional Hamilton-Jacobi-Bellman equations and applications to feedback control of semilinear parabolic PDEs D. Kalise, K. Kunisch RICAM-Report 217-5
More informationNeighboring feasible trajectories in infinite dimension
Neighboring feasible trajectories in infinite dimension Marco Mazzola Université Pierre et Marie Curie (Paris 6) H. Frankowska and E. M. Marchini Control of State Constrained Dynamical Systems Padova,
More informationOptimal Control. Lecture 18. Hamilton-Jacobi-Bellman Equation, Cont. John T. Wen. March 29, Ref: Bryson & Ho Chapter 4.
Optimal Control Lecture 18 Hamilton-Jacobi-Bellman Equation, Cont. John T. Wen Ref: Bryson & Ho Chapter 4. March 29, 2004 Outline Hamilton-Jacobi-Bellman (HJB) Equation Iterative solution of HJB Equation
More informationHJB equations. Seminar in Stochastic Modelling in Economics and Finance January 10, 2011
Department of Probability and Mathematical Statistics Faculty of Mathematics and Physics, Charles University in Prague petrasek@karlin.mff.cuni.cz Seminar in Stochastic Modelling in Economics and Finance
More informationApproximate Dynamic Programming
Approximate Dynamic Programming A. LAZARIC (SequeL Team @INRIA-Lille) Ecole Centrale - Option DAD SequeL INRIA Lille EC-RL Course Value Iteration: the Idea 1. Let V 0 be any vector in R N A. LAZARIC Reinforcement
More information5. Solving the Bellman Equation
5. Solving the Bellman Equation In the next two lectures, we will look at several methods to solve Bellman s Equation (BE) for the stochastic shortest path problem: Value Iteration, Policy Iteration and
More informationReduced Basis Method for Parametric
1/24 Reduced Basis Method for Parametric H 2 -Optimal Control Problems NUMOC2017 Andreas Schmidt, Bernard Haasdonk Institute for Applied Analysis and Numerical Simulation, University of Stuttgart andreas.schmidt@mathematik.uni-stuttgart.de
More informationThe Hopf - Lax solution for state dependent Hamilton - Jacobi equations
The Hopf - Lax solution for state dependent Hamilton - Jacobi equations Italo Capuzzo Dolcetta Dipartimento di Matematica, Università di Roma - La Sapienza 1 Introduction Consider the Hamilton - Jacobi
More informationDeterministic Dynamic Programming
Deterministic Dynamic Programming 1 Value Function Consider the following optimal control problem in Mayer s form: V (t 0, x 0 ) = inf u U J(t 1, x(t 1 )) (1) subject to ẋ(t) = f(t, x(t), u(t)), x(t 0
More informationGreedy control. Martin Lazar University of Dubrovnik. Opatija, th Najman Conference. Joint work with E: Zuazua, UAM, Madrid
Greedy control Martin Lazar University of Dubrovnik Opatija, 2015 4th Najman Conference Joint work with E: Zuazua, UAM, Madrid Outline Parametric dependent systems Reduced basis methods Greedy control
More informationAdaptive methods for control problems with finite-dimensional control space
Adaptive methods for control problems with finite-dimensional control space Saheed Akindeinde and Daniel Wachsmuth Johann Radon Institute for Computational and Applied Mathematics (RICAM) Austrian Academy
More informationNumerical method for HJB equations. Optimal control problems and differential games (lecture 3/3)
Numerical method for HJB equations. Optimal control problems and differential games (lecture 3/3) Maurizio Falcone (La Sapienza) & Hasnaa Zidani (ENSTA) ANOC, 23 27 April 2012 M. Falcone & H. Zidani ()
More informationCME 345: MODEL REDUCTION
CME 345: MODEL REDUCTION Proper Orthogonal Decomposition (POD) Charbel Farhat & David Amsallem Stanford University cfarhat@stanford.edu 1 / 43 Outline 1 Time-continuous Formulation 2 Method of Snapshots
More informationBlock-Structured Adaptive Mesh Refinement
Block-Structured Adaptive Mesh Refinement Lecture 2 Incompressible Navier-Stokes Equations Fractional Step Scheme 1-D AMR for classical PDE s hyperbolic elliptic parabolic Accuracy considerations Bell
More informationCalculating the domain of attraction: Zubov s method and extensions
Calculating the domain of attraction: Zubov s method and extensions Fabio Camilli 1 Lars Grüne 2 Fabian Wirth 3 1 University of L Aquila, Italy 2 University of Bayreuth, Germany 3 Hamilton Institute, NUI
More informationOPTIMAL CONTROL. Sadegh Bolouki. Lecture slides for ECE 515. University of Illinois, Urbana-Champaign. Fall S. Bolouki (UIUC) 1 / 28
OPTIMAL CONTROL Sadegh Bolouki Lecture slides for ECE 515 University of Illinois, Urbana-Champaign Fall 2016 S. Bolouki (UIUC) 1 / 28 (Example from Optimal Control Theory, Kirk) Objective: To get from
More informationProper Orthogonal Decomposition Surrogate Models for Nonlinear Dynamical Systems: Error Estimates and Suboptimal Control
Proper Orthogonal Decomposition Surrogate Models for Nonlinear Dynamical Systems: Error Estimates and Suboptimal Control Michael Hinze 1 and Stefan Volkwein 1 Institut für Numerische Mathematik, TU Dresden,
More informationLMI Methods in Optimal and Robust Control
LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 15: Nonlinear Systems and Lyapunov Functions Overview Our next goal is to extend LMI s and optimization to nonlinear
More informationAsymptotic Stability of POD based Model Predictive Control for a semilinear parabolic PDE
Asymptotic Stability of POD based Model Predictive Control for a semilinear parabolic PDE Alessandro Alla Dipartimento di Matematica, Sapienza Università di Roma, P.le Aldo Moro, 85 Rome, Italy Stefan
More informationHJ equations. Reachability analysis. Optimal control problems
HJ equations. Reachability analysis. Optimal control problems Hasnaa Zidani 1 1 ENSTA Paris-Tech & INRIA-Saclay Graz, 8-11 September 2014 H. Zidani (ENSTA & Inria) HJ equations. Reachability analysis -
More informationOptimal stopping time formulation of adaptive image filtering
Optimal stopping time formulation of adaptive image filtering I. Capuzzo Dolcetta, R. Ferretti 19.04.2000 Abstract This paper presents an approach to image filtering based on an optimal stopping time problem
More informationSolving Distributed Optimal Control Problems for the Unsteady Burgers Equation in COMSOL Multiphysics
Excerpt from the Proceedings of the COMSOL Conference 2009 Milan Solving Distributed Optimal Control Problems for the Unsteady Burgers Equation in COMSOL Multiphysics Fikriye Yılmaz 1, Bülent Karasözen
More informationMINIMAL TIME PROBLEM WITH IMPULSIVE CONTROLS
MINIMAL TIME PROBLEM WITH IMPULSIVE CONTROLS KARL KUNISCH AND ZHIPING RAO Abstract. Time optimal control problems for systems with impulsive controls are investigated. Sufficient conditions for the existence
More informationPOD/DEIM 4DVAR Data Assimilation of the Shallow Water Equation Model
nonlinear 4DVAR 4DVAR Data Assimilation of the Shallow Water Equation Model R. Ştefănescu and Ionel M. Department of Scientific Computing Florida State University Tallahassee, Florida May 23, 2013 (Florida
More informationComputation of an Over-Approximation of the Backward Reachable Set using Subsystem Level Set Functions. Stanford University, Stanford, CA 94305
To appear in Dynamics of Continuous, Discrete and Impulsive Systems http:monotone.uwaterloo.ca/ journal Computation of an Over-Approximation of the Backward Reachable Set using Subsystem Level Set Functions
More informationA Semi-Lagrangian Scheme for the Open Table Problem in Granular Matter Theory
A Semi-Lagrangian Scheme for the Open Table Problem in Granular Matter Theory M. Falcone and S. Finzi Vita Abstract We introduce and analyze a new scheme for the approximation of the two-layer model proposed
More informationL 2 -induced Gains of Switched Systems and Classes of Switching Signals
L 2 -induced Gains of Switched Systems and Classes of Switching Signals Kenji Hirata and João P. Hespanha Abstract This paper addresses the L 2-induced gain analysis for switched linear systems. We exploit
More informationKasetsart University Workshop. Multigrid methods: An introduction
Kasetsart University Workshop Multigrid methods: An introduction Dr. Anand Pardhanani Mathematics Department Earlham College Richmond, Indiana USA pardhan@earlham.edu A copy of these slides is available
More informationNonlinear Control Systems
Nonlinear Control Systems António Pedro Aguiar pedro@isr.ist.utl.pt 3. Fundamental properties IST-DEEC PhD Course http://users.isr.ist.utl.pt/%7epedro/ncs2012/ 2012 1 Example Consider the system ẋ = f
More informationChapter 5. Pontryagin s Minimum Principle (Constrained OCP)
Chapter 5 Pontryagin s Minimum Principle (Constrained OCP) 1 Pontryagin s Minimum Principle Plant: (5-1) u () t U PI: (5-2) Boundary condition: The goal is to find Optimal Control. 2 Pontryagin s Minimum
More informationGreedy Control. Enrique Zuazua 1 2
Greedy Control Enrique Zuazua 1 2 DeustoTech - Bilbao, Basque Country, Spain Universidad Autónoma de Madrid, Spain Visiting Fellow of LJLL-UPMC, Paris enrique.zuazua@deusto.es http://enzuazua.net X ENAMA,
More informationA Second Order Discontinuous Galerkin Fast Sweeping Method for Eikonal Equations
A Second Order Discontinuous Galerkin Fast Sweeping Method for Eikonal Equations Fengyan Li, Chi-Wang Shu, Yong-Tao Zhang 3, and Hongkai Zhao 4 ABSTRACT In this paper, we construct a second order fast
More informationA method for optimal control problems
A method for optimal control problems An adaptative antidissipative method for optimal control problems Olivier Bokanowski *, Nadia Megdich **, Hasnaa Zidani ** * Lab. Jacques-Louis Lions, Université Pierre
More informationLipschitz continuity for solutions of Hamilton-Jacobi equation with Ornstein-Uhlenbeck operator
Lipschitz continuity for solutions of Hamilton-Jacobi equation with Ornstein-Uhlenbeck operator Thi Tuyen Nguyen Ph.D student of University of Rennes 1 Joint work with: Prof. E. Chasseigne(University of
More informationAcceleration of a Domain Decomposition Method for Advection-Diffusion Problems
Acceleration of a Domain Decomposition Method for Advection-Diffusion Problems Gert Lube 1, Tobias Knopp 2, and Gerd Rapin 2 1 University of Göttingen, Institute of Numerical and Applied Mathematics (http://www.num.math.uni-goettingen.de/lube/)
More informationSingular Perturbations of Stochastic Control Problems with Unbounded Fast Variables
Singular Perturbations of Stochastic Control Problems with Unbounded Fast Variables Joao Meireles joint work with Martino Bardi and Guy Barles University of Padua, Italy Workshop "New Perspectives in Optimal
More informationMinimal time mean field games
based on joint works with Samer Dweik and Filippo Santambrogio PGMO Days 2017 Session Mean Field Games and applications EDF Lab Paris-Saclay November 14th, 2017 LMO, Université Paris-Sud Université Paris-Saclay
More informationA Narrow-Stencil Finite Difference Method for Hamilton-Jacobi-Bellman Equations
A Narrow-Stencil Finite Difference Method for Hamilton-Jacobi-Bellman Equations Xiaobing Feng Department of Mathematics The University of Tennessee, Knoxville, U.S.A. Linz, November 23, 2016 Collaborators
More informationComputer simulation of multiscale problems
Progress in the SSF project CutFEM, Geometry, and Optimal design Computer simulation of multiscale problems Axel Målqvist and Daniel Elfverson University of Gothenburg and Uppsala University Umeå 2015-05-20
More informationSuboptimal feedback control of PDEs by solving HJB equations on adaptive sparse grids
Suboptimal feedback control of PDEs by solving HJB equations on adaptive sparse grids Jochen Garcke, Axel Kröner To cite this version: Jochen Garcke, Axel Kröner. Suboptimal feedback control of PDEs by
More informationA Monotone Scheme for Hamilton-Jacobi Equations via the Nonstandard Finite Difference Method
A Monotone Scheme for Hamilton-Jacobi Equations via the Nonstandard Finite Difference Method Roumen Anguelov, Jean M-S Lubuma and Froduald Minani Department of Mathematics and Applied Mathematics University
More informationModel Order Reduction Techniques
Model Order Reduction Techniques SVD & POD M. Grepl a & K. Veroy-Grepl b a Institut für Geometrie und Praktische Mathematik b Aachen Institute for Advanced Study in Computational Engineering Science (AICES)
More informationNonlinear Optimization for Optimal Control
Nonlinear Optimization for Optimal Control Pieter Abbeel UC Berkeley EECS Many slides and figures adapted from Stephen Boyd [optional] Boyd and Vandenberghe, Convex Optimization, Chapters 9 11 [optional]
More informationPOD/DEIM 4D-Var for a Finite-Difference Shallow Water Equations Model
.. POD/DEIM 4D-Var for a Finite-Difference Shallow Water Equations Model North Carolina State University rstefan@ncsu.edu POD/DEIM 4D-Var for a Finite-Difference Shallow Water Equations Model 1/64 Part1
More informationHamilton Jacobi Bellman equations
Chapter 2 Hamilton Jacobi Bellman equations In this chapter we present recent developments in the theory of Hamilton Jacobi Bellman (HJB) equations as well as applications. The intention of this chapter
More informationImplicit-explicit exponential integrators
Implicit-explicit exponential integrators Bawfeh Kingsley Kometa joint work with Elena Celledoni MaGIC 2011 Finse, March 1-4 1 Introduction Motivation 2 semi-lagrangian Runge-Kutta exponential integrators
More informationDynamic programming using radial basis functions and Shepard approximations
Dynamic programming using radial basis functions and Shepard approximations Oliver Junge, Alex Schreiber Fakultät für Mathematik Technische Universität München Workshop on algorithms for dynamical systems
More informationAn Inexact Newton Method for Nonlinear Constrained Optimization
An Inexact Newton Method for Nonlinear Constrained Optimization Frank E. Curtis Numerical Analysis Seminar, January 23, 2009 Outline Motivation and background Algorithm development and theoretical results
More informationOPTIMALITY CONDITIONS AND POD A-POSTERIORI ERROR ESTIMATES FOR A SEMILINEAR PARABOLIC OPTIMAL CONTROL
OPTIMALITY CONDITIONS AND POD A-POSTERIORI ERROR ESTIMATES FOR A SEMILINEAR PARABOLIC OPTIMAL CONTROL O. LASS, S. TRENZ, AND S. VOLKWEIN Abstract. In the present paper the authors consider an optimal control
More informationDomain decomposition on different levels of the Jacobi-Davidson method
hapter 5 Domain decomposition on different levels of the Jacobi-Davidson method Abstract Most computational work of Jacobi-Davidson [46], an iterative method suitable for computing solutions of large dimensional
More informationCME 345: MODEL REDUCTION
CME 345: MODEL REDUCTION Balanced Truncation Charbel Farhat & David Amsallem Stanford University cfarhat@stanford.edu These slides are based on the recommended textbook: A.C. Antoulas, Approximation of
More informationCHAPTER 2 THE MAXIMUM PRINCIPLE: CONTINUOUS TIME. Chapter2 p. 1/67
CHAPTER 2 THE MAXIMUM PRINCIPLE: CONTINUOUS TIME Chapter2 p. 1/67 THE MAXIMUM PRINCIPLE: CONTINUOUS TIME Main Purpose: Introduce the maximum principle as a necessary condition to be satisfied by any optimal
More informationAlternative Decompositions for Distributed Maximization of Network Utility: Framework and Applications
Alternative Decompositions for Distributed Maximization of Network Utility: Framework and Applications Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization
More informationNon-Intrusive Solution of Stochastic and Parametric Equations
Non-Intrusive Solution of Stochastic and Parametric Equations Hermann G. Matthies a Loïc Giraldi b, Alexander Litvinenko c, Dishi Liu d, and Anthony Nouy b a,, Brunswick, Germany b École Centrale de Nantes,
More informationNumerical methods for Mean Field Games: additional material
Numerical methods for Mean Field Games: additional material Y. Achdou (LJLL, Université Paris-Diderot) July, 2017 Luminy Convergence results Outline 1 Convergence results 2 Variational MFGs 3 A numerical
More informationPartitioned Methods for Multifield Problems
C Partitioned Methods for Multifield Problems Joachim Rang, 6.7.2016 6.7.2016 Joachim Rang Partitioned Methods for Multifield Problems Seite 1 C One-dimensional piston problem fixed wall Fluid flexible
More informationarxiv: v1 [math.oc] 9 Oct 2018
A Convex Optimization Approach to Dynamic Programming in Continuous State and Action Spaces Insoon Yang arxiv:1810.03847v1 [math.oc] 9 Oct 2018 Abstract A convex optimization-based method is proposed to
More informationSelf-Concordant Barrier Functions for Convex Optimization
Appendix F Self-Concordant Barrier Functions for Convex Optimization F.1 Introduction In this Appendix we present a framework for developing polynomial-time algorithms for the solution of convex optimization
More informationAn Introduction to Algebraic Multigrid (AMG) Algorithms Derrick Cerwinsky and Craig C. Douglas 1/84
An Introduction to Algebraic Multigrid (AMG) Algorithms Derrick Cerwinsky and Craig C. Douglas 1/84 Introduction Almost all numerical methods for solving PDEs will at some point be reduced to solving A
More informationDuality and dynamics in Hamilton-Jacobi theory for fully convex problems of control
Duality and dynamics in Hamilton-Jacobi theory for fully convex problems of control RTyrrell Rockafellar and Peter R Wolenski Abstract This paper describes some recent results in Hamilton- Jacobi theory
More informationMarkov Decision Processes and Dynamic Programming
Markov Decision Processes and Dynamic Programming A. LAZARIC (SequeL Team @INRIA-Lille) Ecole Centrale - Option DAD SequeL INRIA Lille EC-RL Course In This Lecture A. LAZARIC Markov Decision Processes
More informationMultigrid and stochastic sparse-grids techniques for PDE control problems with random coefficients
Multigrid and stochastic sparse-grids techniques for PDE control problems with random coefficients Università degli Studi del Sannio Dipartimento e Facoltà di Ingegneria, Benevento, Italia Random fields
More informationChapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs
Chapter Two: Numerical Methods for Elliptic PDEs Finite Difference Methods for Elliptic PDEs.. Finite difference scheme. We consider a simple example u := subject to Dirichlet boundary conditions ( ) u
More information