An introduction to the theory of SDDP algorithm
|
|
- Evelyn Houston
- 5 years ago
- Views:
Transcription
1 An inroducion o he heory of SDDP algorihm V. Leclère (ENPC) Augus 1, 2014 V. Leclère Inroducion o SDDP Augus 1, / 21
2 Inroducion Large scale sochasic problem are hard o solve. Two ways of aacking such problems : decompose (spaially) he problem and coordinae soluions, consruc easily solvable approximaions (Linear Programming). Behind he name SDDP here is hree differen hings: a class of algorihms, a specific implemenaion of he algorihm, a sofware implemening his mehod develloped by PSR. The aim of his alk is o give you an idea of how he class of algorihm is working and give a convergence resul. V. Leclère Inroducion o SDDP Augus 1, / 21
3 Inroducion Large scale sochasic problem are hard o solve. Two ways of aacking such problems : decompose (spaially) he problem and coordinae soluions, consruc easily solvable approximaions (Linear Programming). Behind he name SDDP here is hree differen hings: a class of algorihms, a specific implemenaion of he algorihm, a sofware implemening his mehod develloped by PSR. The aim of his alk is o give you an idea of how he class of algorihm is working and give a convergence resul. V. Leclère Inroducion o SDDP Augus 1, / 21
4 Inroducion Large scale sochasic problem are hard o solve. Two ways of aacking such problems : decompose (spaially) he problem and coordinae soluions, consruc easily solvable approximaions (Linear Programming). Behind he name SDDP here is hree differen hings: a class of algorihms, a specific implemenaion of he algorihm, a sofware implemening his mehod develloped by PSR. The aim of his alk is o give you an idea of how he class of algorihm is working and give a convergence resul. V. Leclère Inroducion o SDDP Augus 1, / 21
5 An inroducive applicaion A dam is seen as a sock of energy wih uncerain inflows, valorized a an uncerain price. The objecive is o minimize he expeced cumulaed cos. V. Leclère Inroducion o SDDP Augus 1, / 21
6 Conens 1 Technical Preliminaries Problem Formulaion and Dynamic Programming Dualiy Approach 2 SDDP Algorihm The SDDP algorihm Miscellaneous 3 Convergence and Numerical Resuls 4 Conclusion V. Leclère Inroducion o SDDP Augus 1, / 21
7 Problem Formulaion min A 0 x 0 =b 0 x 0 0 { c T 0 x 0 + E [ min B 1 (ξ 1 )x 0 +A 1 (ξ 1 )x 1 =b 1 x 1 0 [ + E { [ c1 T (ξ 1 )x 1 + E min B T (ξ T )x T 1 +A T (ξ T )x T =b T (ξ T ) x T 0 c T T (ξ T )x T ] ]}]} Key pracical assumpion: he noise ( ξ 1,..., ξ T ) is independen from ime o ime. If i is no he case we can ofen exend he sae x o obain an independen noise V. Leclère Inroducion o SDDP Augus 1, / 21
8 Problem Formulaion min A 0 x 0 =b 0 x 0 0 { c T 0 x 0 + E [ min B 1 (ξ 1 )x 0 +A 1 (ξ 1 )x 1 =b 1 x 1 0 [ + E { [ c1 T (ξ 1 )x 1 + E min B T (ξ T )x T 1 +A T (ξ T )x T =b T (ξ T ) x T 0 c T T (ξ T )x T ] ]}]} Key pracical assumpion: he noise ( ξ 1,..., ξ T ) is independen from ime o ime. If i is no he case we can ofen exend he sae x o obain an independen noise V. Leclère Inroducion o SDDP Augus 1, / 21
9 Dynamic Programming Approach This problem can be solved by Dynamic Programming wih: Q T 1 (x T 1, ξ T ) = Q 1 (x 1, ξ ) = min B T (ξ T )x T 1 +A T (ξ T )x T =b T (ξ T ) x T 0 V T 1 = E [ Q T 1 (x T 1, ξ T ) ] min B (ξ )x 1 +A (ξ )x =b (ξ ) x 0 V 1 (x 1 ) = E [ Q 1 (x 1, ξ ) ] c T T (ξ T )x T c T x + V (x ) Noe ha: he resoluion can be done backward in ime bu require a priori discreizaion; funcions Q and V are convex in x; funcions Q and V are pieciewise linear, hence above problems are linear programming problems. V. Leclère Inroducion o SDDP Augus 1, / 21
10 Dynamic Programming Approach This problem can be solved by Dynamic Programming wih: Q T 1 (x T 1, ξ T ) = Q 1 (x 1, ξ ) = min B T (ξ T )x T 1 +A T (ξ T )x T =b T (ξ T ) x T 0 V T 1 = E [ Q T 1 (x T 1, ξ T ) ] min B (ξ )x 1 +A (ξ )x =b (ξ ) x 0 V 1 (x 1 ) = E [ Q 1 (x 1, ξ ) ] c T T (ξ T )x T c T x + V (x ) Noe ha: he resoluion can be done backward in ime bu require a priori discreizaion; funcions Q and V are convex in x; funcions Q and V are pieciewise linear, hence above problems are linear programming problems. V. Leclère Inroducion o SDDP Augus 1, / 21
11 Conens 1 Technical Preliminaries Problem Formulaion and Dynamic Programming Dualiy Approach 2 SDDP Algorihm The SDDP algorihm Miscellaneous 3 Convergence and Numerical Resuls 4 Conclusion V. Leclère Inroducion o SDDP Augus 1, / 21
12 Subgradien of a Value Funcion 1/2 Consider he following problem: Q (x, ξ) = min x,x +1 c T (ξ)x + V +1 (x +1 ) s.. x = x λ (ξ ) B (ξ)x 1 + A (ξ)x = b (ξ) Noe λ (ξ ) he Lagrangian muliplier associaed o he consrain x = x. Marginalis inerpreaion of he muliplier (and convexiy of Q ) implies ha λ (ξ ) Q (x, ξ) is a subgradien of Q (, ξ). In oher words Q (, ξ) Q (x, ξ) + λ, x. V. Leclère Inroducion o SDDP Augus 1, / 21
13 Subgradien of a Value Funcion 2/2 We have: x, Q (x, ξ) Q (x, ξ) + λ, x x. Recall ha V (x) = E [ Q (x, ξ) ]. By lineariy we obain V ( ) E [ Q (x, ξ) ] + E [ λ (ξ ) ], x. V. Leclère Inroducion o SDDP Augus 1, / 21
14 Consrucing a Cu from a Lower Approximaion 1/2 Assume ha we have Recall ha Q (x, ξ) = For any possible ξ, consider β (k) (ξ) = min x,x +1 Hence we have, hen, ˇV (k) +1 V +1. Choose a poin x (k). min B +1 (ξ)x +A +1 (ξ)x +1 =b +1 (ξ) x +1 0 s.. β (k) E [ β (k) c T (ξ)x + ˇV (k) +1 (x +1) x = x (k) B (ξ)x 1 + A (ξ)x = b (ξ) c T +1x + V +1 (x +1 ) (ξ) + λ (ξ), x (k) Q (, ξ). (ξ ) ] + E [ λ (ξ ) ], x (k) V ( ). λ (k) (ξ) V. Leclère Inroducion o SDDP Augus 1, / 21
15 Consrucing a Cu from a Lower Approximaion 2/2 Recall ha, Hence leads o β (k) V (x) = E [ Q (x, ξ +1 ) ]. (ξ) + λ (ξ), x (k) Q (, ξ), E [ β (k) (ξ ) ] + E [ λ (ξ ) ], x (k) V ( ) V. Leclère Inroducion o SDDP Augus 1, / 21
16 Conens 1 Technical Preliminaries Problem Formulaion and Dynamic Programming Dualiy Approach 2 SDDP Algorihm The SDDP algorihm Miscellaneous 3 Convergence and Numerical Resuls 4 Conclusion V. Leclère Inroducion o SDDP Augus 1, / 21
17 Probabilisic Assumpion The noise process (ξ 1,, ξ T ) is assumed o be independen in ime. If he acual noise process is auoregressive, i.e. W = a 0 + a 1 W a τ W τ + ξ we can exend he sae of he problem by considering (x, W 1,, W τ ) as he new sae, and ξ as he new (independen) noise. The noise is assumed o be discree. A ime he noise affecing he sysem is assumed o be known before he decision x is made (Hazard-Decision informaion srucure). V. Leclère Inroducion o SDDP Augus 1, / 21
18 Global Scheme Assume ha we have lower approximaion V (k) Forward Phase Replacing he acual value funcions V by heir approximaion V (k), and selecing a scenario of noise (ξ (k) ) we derive a sae rajecory 0,..., ξ(k) T x (k) 0,..., x (k) T. Backward Phase Recursively backward compue a new cu (i.e. affine funcion lower han V ) of V a x (k). The new approximaion is given by V (k+1) = max { V (k), β (k) + λ (k), x (k) }. V. Leclère Inroducion o SDDP Augus 1, / 21
19 Forward Phase The forward phase of ieraion k find a good sae rajecory, given a sequence of lower approximaion V (k) : 1 Selec a sequence of noise (ξ (k) 0,..., ξ(k) T ). 2 Fix x (k) 0 = x 0. 3 Solve, recursively forward in ime, min x +1 s.. c T (ξ)x + x = x (k) ˇV (k) +1 (x +1) B (ξ (k) )x 1 + A (ξ)x = b (ξ (k) ) o obain a sequence ( x (k) 0,, x (k) ) T. This is he opimal rajecory given by he approximaion of he Bellman funcion along he given scenario. V. Leclère Inroducion o SDDP Augus 1, / 21
20 Backward Phase For any ime sep 1 For any ξ in he suppor of ξ +1, solve β (k) (ξ) = min x,x +1 s.. c T (ξ)x + ˇV (k) +1 (x +1) x = x (k) B (ξ)x 1 + A (ξ)x = b (ξ) λ (k) (ξ) 2 Compue he exac expecaions β (k) = E [ β (k) (ξ +1 ) ], λ (k) = E [ λ (k) (ξ +1 ) ]. 3 Updae he approximaion a ime : V (k+1) := max { V (k), β (k) + λ (k), x (k) }. V. Leclère Inroducion o SDDP Augus 1, / 21
21 Conens 1 Technical Preliminaries Problem Formulaion and Dynamic Programming Dualiy Approach 2 SDDP Algorihm The SDDP algorihm Miscellaneous 3 Convergence and Numerical Resuls 4 Conclusion V. Leclère Inroducion o SDDP Augus 1, / 21
22 Bounds Lower Bound A any sage of he algorihm we have an exac lower bound of he problem given by V (k) 0 (x 0 ). Upper Bound From he collecion of value funcions approximaions we derive a policy ( (k) X 0,, ) X(k) T ha can be simulaed. Hence, an upper bound of he value of he problem is given by [ T ] E c T X (k), =1 which can be esimaed by Mone-Carlo mehod. V. Leclère Inroducion o SDDP Augus 1, / 21
23 Sopping Rule A number of sopping rules for he SDDP mehod has been proposed. In pracice i is ofen simply a given number of ieraion (or a given compuaion ime). An ineresing sopping rule is he following. Fix an objecive gap ε. Compue he lower bound v (k) = V (k) (x 0 ). Esimae by Mone-Carlo he upper bound v (k). I is easy o obain an (asympoic) 90% confiance inerval for he upper bound [v (k) e (k), v (k) + e (k) ]. Sop if he difference v (k) + e (k) v (k) beween he upper esimaion of he upper bound and he lower bound is lower han he objecive gap, in which case we can cerified, wih 95% confidence ha he soluion of he algorihm is less han ε from he opimal. V. Leclère Inroducion o SDDP Augus 1, / 21
24 A Number of Approximaions 1 We fi on he daa available an auoregressive process represening he noise. firs unconrollable error. 2 We discreize he sochasic process o obain a scenario ree represenaion. second error conrolable hrough Sampling Average Approximaion (SAA) heory. 3 We compue approximaions ˇV (k) of he real value funcions V. hird error conrolable by bounds from he SDDP algorihm. 4 The upper bound is obained hrough Mone Carlo. fourh error conrolable hrough cenral limi heorem. V. Leclère Inroducion o SDDP Augus 1, / 21
25 Convergence resul - linear case Convergence resul Assume ha: he admissible ses of saes are compac, we are in he relaively complee recourse case, he random selecion in he forward phase saisfy some independence condiion, every value funcion is updaed an infinie number of ime. Then he upper and lower bounds converges almos surely oward he value of he problem. V. Leclère Inroducion o SDDP Augus 1, / 21
26 Convergence resul - convex case Convergence resul Assume ha: he admissible ses of saes are compac convex, he cos funcions are convex, we are in he exended relaively complee recourse case, he random selecion in he forward phase saisfy some independence condiion, every value funcion is updaed an infinie number of ime. Then he upper and lower bounds converges almos surely oward he value of he problem. V. Leclère Inroducion o SDDP Augus 1, / 21
27 Numerical Resuls Widely used in he energy communiy (managemen of dam, sizing of nework ec...) Efficien up o dams. Numerical experimens available on A. Shapiro websie: 120 ime-sep, 4 dams for a sae of dimension 8, each ξ is discreized in 100 poins, hence here is scenarios, 3000 ieraions runs in 15 minues, 20% gap, 4% in dimension 4. V. Leclère Inroducion o SDDP Augus 1, / 21
28 Conens 1 Technical Preliminaries Problem Formulaion and Dynamic Programming Dualiy Approach 2 SDDP Algorihm The SDDP algorihm Miscellaneous 3 Convergence and Numerical Resuls 4 Conclusion V. Leclère Inroducion o SDDP Augus 1, / 21
29 Conclusion SDDP is an algorihm, more precisely a class of algorihms ha exploi convexiy of he value funcions (from convexiy of coss...); does no require discreizaion; consruc ouer approximaions of V, hose approximaions being precise only in he righ places ; gives bounds : real lower bound V (k) 0 (x 0 ), esimaed (by Mone-Carlo) upper bound; consruc linear-convex approximaions, hus enabling he use of linear solver like CPLEX, have proofs of asympoic convergence. V. Leclère Inroducion o SDDP Augus 1, / 21
30 Available Exensions Cu dropping mehods are sudied. Ho sar by bypassing he forward phase and selecing arificial rajecories are numerically efficien. Work is done o apply SDDP in some non-convex cases. Risk aversion (hrough CVAR - eiher as consrain or as an elemen of he objecive funcion) can be aken ino accoun (by exending he sae). Non linear convex cos can be used (convergence resul). V. Leclère Inroducion o SDDP Augus 1, / 21
31 M. Pereira, L.Pino (1991). Muli-sage sochasic opimizaion applied o energy planning. Mahemaical Programming Z.Chen, W. Powell (1999). A convergen cuing plane and parial-sampling algorihm for mulisage linear programs wih recourse. Journal of Opimizaion Theory and Applicaions A.Philpo, Z. Guan (2008). On he convergence of sochasic dual dynamic programming and relaed mehods. Operaions research leers P.Girardeau, V.Leclère, A. Philpo (2014). On he convergence of decomposiion mehods for muli-sage sochasic convex programs. acceped in Mahemaics of Operaions Research. V. Leclère Inroducion o SDDP Augus 1, / 21
Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing
Applicaion of a Sochasic-Fuzzy Approach o Modeling Opimal Discree Time Dynamical Sysems by Using Large Scale Daa Processing AA WALASZE-BABISZEWSA Deparmen of Compuer Engineering Opole Universiy of Technology
More informationt dt t SCLP Bellman (1953) CLP (Dantzig, Tyndall, Grinold, Perold, Anstreicher 60's-80's) Anderson (1978) SCLP
Coninuous Linear Programming. Separaed Coninuous Linear Programming Bellman (1953) max c () u() d H () u () + Gsusds (,) () a () u (), < < CLP (Danzig, yndall, Grinold, Perold, Ansreicher 6's-8's) Anderson
More informationModal identification of structures from roving input data by means of maximum likelihood estimation of the state space model
Modal idenificaion of srucures from roving inpu daa by means of maximum likelihood esimaion of he sae space model J. Cara, J. Juan, E. Alarcón Absrac The usual way o perform a forced vibraion es is o fix
More informationT L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB
Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal
More informationA Hop Constrained Min-Sum Arborescence with Outage Costs
A Hop Consrained Min-Sum Arborescence wih Ouage Coss Rakesh Kawara Minnesoa Sae Universiy, Mankao, MN 56001 Email: Kawara@mnsu.edu Absrac The hop consrained min-sum arborescence wih ouage coss problem
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
his aricle appeared in a journal published by Elsevier. he aached copy is furnished o he auhor for inernal non-commercial research and educaion use, including for insrucion a he auhors insiuion and sharing
More informationRandom Walk with Anti-Correlated Steps
Random Walk wih Ani-Correlaed Seps John Noga Dirk Wagner 2 Absrac We conjecure he expeced value of random walks wih ani-correlaed seps o be exacly. We suppor his conjecure wih 2 plausibiliy argumens and
More informationRisk-Averse Stochastic Dual Dynamic Programming
Risk-Averse Sochasic Dual Dynamic Programming Václav Kozmík Deparmen of Probabiliy and Mahemaical Saisics Charles Universiy in Prague Prague, Czech Republic David P. Moron Graduae Program in Operaions
More information3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon
3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of
More informationZürich. ETH Master Course: L Autonomous Mobile Robots Localization II
Roland Siegwar Margaria Chli Paul Furgale Marco Huer Marin Rufli Davide Scaramuzza ETH Maser Course: 151-0854-00L Auonomous Mobile Robos Localizaion II ACT and SEE For all do, (predicion updae / ACT),
More informationNotes on Kalman Filtering
Noes on Kalman Filering Brian Borchers and Rick Aser November 7, Inroducion Daa Assimilaion is he problem of merging model predicions wih acual measuremens of a sysem o produce an opimal esimae of he curren
More informationAn Introduction to Stochastic Programming: The Recourse Problem
An Inroducion o Sochasic Programming: he Recourse Problem George Danzig and Phil Wolfe Ellis Johnson, Roger Wes, Dick Cole, and Me John Birge Where o look in he ex pp. 6-7, Secion.2.: Inroducion o sochasic
More informationarxiv: v1 [math.oc] 27 Jul 2009
PARTICLE METHODS FOR STOCHASTIC OPTIMAL CONTROL PROBLEMS PIERRE CARPENTIER GUY COHEN AND ANES DALLAGI arxiv:0907.4663v1 [mah.oc] 27 Jul 2009 Absrac. When dealing wih numerical soluion of sochasic opimal
More informationSTATE-SPACE MODELLING. A mass balance across the tank gives:
B. Lennox and N.F. Thornhill, 9, Sae Space Modelling, IChemE Process Managemen and Conrol Subjec Group Newsleer STE-SPACE MODELLING Inroducion: Over he pas decade or so here has been an ever increasing
More informationSimulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010
Simulaion-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Week Descripion Reading Maerial 2 Compuer Simulaion of Dynamic Models Finie Difference, coninuous saes, discree ime Simple Mehods Euler Trapezoid
More informationScheduling of Crude Oil Movements at Refinery Front-end
Scheduling of Crude Oil Movemens a Refinery Fron-end Ramkumar Karuppiah and Ignacio Grossmann Carnegie Mellon Universiy ExxonMobil Case Sudy: Dr. Kevin Furman Enerprise-wide Opimizaion Projec March 15,
More informationSupplement for Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence
Supplemen for Sochasic Convex Opimizaion: Faser Local Growh Implies Faser Global Convergence Yi Xu Qihang Lin ianbao Yang Proof of heorem heorem Suppose Assumpion holds and F (w) obeys he LGC (6) Given
More informationLecture 20: Riccati Equations and Least Squares Feedback Control
34-5 LINEAR SYSTEMS Lecure : Riccai Equaions and Leas Squares Feedback Conrol 5.6.4 Sae Feedback via Riccai Equaions A recursive approach in generaing he marix-valued funcion W ( ) equaion for i for he
More informationInventory Control of Perishable Items in a Two-Echelon Supply Chain
Journal of Indusrial Engineering, Universiy of ehran, Special Issue,, PP. 69-77 69 Invenory Conrol of Perishable Iems in a wo-echelon Supply Chain Fariborz Jolai *, Elmira Gheisariha and Farnaz Nojavan
More informationOnline Appendix to Solution Methods for Models with Rare Disasters
Online Appendix o Soluion Mehods for Models wih Rare Disasers Jesús Fernández-Villaverde and Oren Levinal In his Online Appendix, we presen he Euler condiions of he model, we develop he pricing Calvo block,
More informationGeorey E. Hinton. University oftoronto. Technical Report CRG-TR February 22, Abstract
Parameer Esimaion for Linear Dynamical Sysems Zoubin Ghahramani Georey E. Hinon Deparmen of Compuer Science Universiy oftorono 6 King's College Road Torono, Canada M5S A4 Email: zoubin@cs.orono.edu Technical
More information2.160 System Identification, Estimation, and Learning. Lecture Notes No. 8. March 6, 2006
2.160 Sysem Idenificaion, Esimaion, and Learning Lecure Noes No. 8 March 6, 2006 4.9 Eended Kalman Filer In many pracical problems, he process dynamics are nonlinear. w Process Dynamics v y u Model (Linearized)
More informationSUPPLEMENTARY INFORMATION
SUPPLEMENTARY INFORMATION DOI: 0.038/NCLIMATE893 Temporal resoluion and DICE * Supplemenal Informaion Alex L. Maren and Sephen C. Newbold Naional Cener for Environmenal Economics, US Environmenal Proecion
More informationDistributionally Robust Stochastic Control with Conic Confidence Sets
Disribuionally Robus Sochasic Conrol wih Conic Confidence Ses Insoon Yang Absrac The heory of (sandard) sochasic opimal conrol is based on he assumpion ha he probabiliy disribuion of uncerain variables
More informationA Primal-Dual Type Algorithm with the O(1/t) Convergence Rate for Large Scale Constrained Convex Programs
PROC. IEEE CONFERENCE ON DECISION AND CONTROL, 06 A Primal-Dual Type Algorihm wih he O(/) Convergence Rae for Large Scale Consrained Convex Programs Hao Yu and Michael J. Neely Absrac This paper considers
More informationL07. KALMAN FILTERING FOR NON-LINEAR SYSTEMS. NA568 Mobile Robotics: Methods & Algorithms
L07. KALMAN FILTERING FOR NON-LINEAR SYSTEMS NA568 Mobile Roboics: Mehods & Algorihms Today s Topic Quick review on (Linear) Kalman Filer Kalman Filering for Non-Linear Sysems Exended Kalman Filer (EKF)
More informationOrdinary Differential Equations
Lecure 22 Ordinary Differenial Equaions Course Coordinaor: Dr. Suresh A. Karha, Associae Professor, Deparmen of Civil Engineering, IIT Guwahai. In naure, mos of he phenomena ha can be mahemaically described
More informationSubway stations energy and air quality management
Subway saions energy and air qualiy managemen wih sochasic opimizaion Trisan Rigau 1,2,4, Advisors: P. Carpenier 3, J.-Ph. Chancelier 2, M. De Lara 2 EFFICACITY 1 CERMICS, ENPC 2 UMA, ENSTA 3 LISIS, IFSTTAR
More informationGMM - Generalized Method of Moments
GMM - Generalized Mehod of Momens Conens GMM esimaion, shor inroducion 2 GMM inuiion: Maching momens 2 3 General overview of GMM esimaion. 3 3. Weighing marix...........................................
More informationGlobal Optimization for Scheduling Refinery Crude Oil Operations
Global Opimizaion for Scheduling Refinery Crude Oil Operaions Ramkumar Karuppiah 1, Kevin C. Furman 2 and Ignacio E. Grossmann 1 (1) Deparmen of Chemical Engineering Carnegie Mellon Universiy (2) Corporae
More informationVariational Iteration Method for Solving System of Fractional Order Ordinary Differential Equations
IOSR Journal of Mahemaics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 1, Issue 6 Ver. II (Nov - Dec. 214), PP 48-54 Variaional Ieraion Mehod for Solving Sysem of Fracional Order Ordinary Differenial
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Noes for EE7C Spring 018: Convex Opimizaion and Approximaion Insrucor: Moriz Hard Email: hard+ee7c@berkeley.edu Graduae Insrucor: Max Simchowiz Email: msimchow+ee7c@berkeley.edu Ocober 15, 018 3
More informationDiebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles
Diebold, Chaper 7 Francis X. Diebold, Elemens of Forecasing, 4h Ediion (Mason, Ohio: Cengage Learning, 006). Chaper 7. Characerizing Cycles Afer compleing his reading you should be able o: Define covariance
More informationSZG Macro 2011 Lecture 3: Dynamic Programming. SZG macro 2011 lecture 3 1
SZG Macro 2011 Lecure 3: Dynamic Programming SZG macro 2011 lecure 3 1 Background Our previous discussion of opimal consumpion over ime and of opimal capial accumulaion sugges sudying he general decision
More informationMulti-scale 2D acoustic full waveform inversion with high frequency impulsive source
Muli-scale D acousic full waveform inversion wih high frequency impulsive source Vladimir N Zubov*, Universiy of Calgary, Calgary AB vzubov@ucalgaryca and Michael P Lamoureux, Universiy of Calgary, Calgary
More informationSDDP FOR MULTISTAGE STOCHASTIC LINEAR PROGRAMS BASED ON SPECTRAL RISK MEASURES
SDDP FOR MULTISTAGE STOCHASTIC LINEAR PROGRAMS BASED ON SPECTRAL RISK MEASURES VINCENT GUIGUES AND WERNER RÖMISCH Absrac. We consider risk-averse formulaions of mulisage sochasic linear programs. For hese
More informationParticle Swarm Optimization Combining Diversification and Intensification for Nonlinear Integer Programming Problems
Paricle Swarm Opimizaion Combining Diversificaion and Inensificaion for Nonlinear Ineger Programming Problems Takeshi Masui, Masaoshi Sakawa, Kosuke Kao and Koichi Masumoo Hiroshima Universiy 1-4-1, Kagamiyama,
More informationUSP. Surplus-Production Models
USP Surplus-Producion Models 2 Overview Purpose of slides: Inroducion o he producion model Overview of differen mehods of fiing Go over some criique of he mehod Source: Haddon 2001, Chaper 10 Hilborn and
More informationRobust estimation based on the first- and third-moment restrictions of the power transformation model
h Inernaional Congress on Modelling and Simulaion, Adelaide, Ausralia, 6 December 3 www.mssanz.org.au/modsim3 Robus esimaion based on he firs- and hird-momen resricions of he power ransformaion Nawaa,
More informationLongest Common Prefixes
Longes Common Prefixes The sandard ordering for srings is he lexicographical order. I is induced by an order over he alphabe. We will use he same symbols (,
More informationUnsteady Flow Problems
School of Mechanical Aerospace and Civil Engineering Unseady Flow Problems T. J. Craf George Begg Building, C41 TPFE MSc CFD-1 Reading: J. Ferziger, M. Peric, Compuaional Mehods for Fluid Dynamics H.K.
More informationTwo Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017
Two Popular Bayesian Esimaors: Paricle and Kalman Filers McGill COMP 765 Sep 14 h, 2017 1 1 1, dx x Bel x u x P x z P Recall: Bayes Filers,,,,,,, 1 1 1 1 u z u x P u z u x z P Bayes z = observaion u =
More informationIsolated-word speech recognition using hidden Markov models
Isolaed-word speech recogniion using hidden Markov models Håkon Sandsmark December 18, 21 1 Inroducion Speech recogniion is a challenging problem on which much work has been done he las decades. Some of
More informationCH Sean Han QF, NTHU, Taiwan BFS2010. (Joint work with T.-Y. Chen and W.-H. Liu)
CH Sean Han QF, NTHU, Taiwan BFS2010 (Join work wih T.-Y. Chen and W.-H. Liu) Risk Managemen in Pracice: Value a Risk (VaR) / Condiional Value a Risk (CVaR) Volailiy Esimaion: Correced Fourier Transform
More informationLecture 33: November 29
36-705: Inermediae Saisics Fall 2017 Lecurer: Siva Balakrishnan Lecure 33: November 29 Today we will coninue discussing he boosrap, and hen ry o undersand why i works in a simple case. In he las lecure
More informationLogic in computer science
Logic in compuer science Logic plays an imporan role in compuer science Logic is ofen called he calculus of compuer science Logic plays a similar role in compuer science o ha played by calculus in he physical
More informationDecentralized Stochastic Control with Partial History Sharing: A Common Information Approach
1 Decenralized Sochasic Conrol wih Parial Hisory Sharing: A Common Informaion Approach Ashuosh Nayyar, Adiya Mahajan and Demoshenis Tenekezis arxiv:1209.1695v1 [cs.sy] 8 Sep 2012 Absrac A general model
More informationPade and Laguerre Approximations Applied. to the Active Queue Management Model. of Internet Protocol
Applied Mahemaical Sciences, Vol. 7, 013, no. 16, 663-673 HIKARI Ld, www.m-hikari.com hp://dx.doi.org/10.1988/ams.013.39499 Pade and Laguerre Approximaions Applied o he Acive Queue Managemen Model of Inerne
More informationChapter 2. Models, Censoring, and Likelihood for Failure-Time Data
Chaper 2 Models, Censoring, and Likelihood for Failure-Time Daa William Q. Meeker and Luis A. Escobar Iowa Sae Universiy and Louisiana Sae Universiy Copyrigh 1998-2008 W. Q. Meeker and L. A. Escobar. Based
More informationOptima and Equilibria for Traffic Flow on a Network
Opima and Equilibria for Traffic Flow on a Nework Albero Bressan Deparmen of Mahemaics, Penn Sae Universiy bressan@mah.psu.edu Albero Bressan (Penn Sae) Opima and equilibria for raffic flow 1 / 1 A Traffic
More informationInventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions
Muli-Period Sochasic Models: Opimali of (s, S) Polic for -Convex Objecive Funcions Consider a seing similar o he N-sage newsvendor problem excep ha now here is a fixed re-ordering cos (> 0) for each (re-)order.
More informationDistribution of Estimates
Disribuion of Esimaes From Economerics (40) Linear Regression Model Assume (y,x ) is iid and E(x e )0 Esimaion Consisency y α + βx + he esimaes approach he rue values as he sample size increases Esimaion
More informationOptimal Investment under Dynamic Risk Constraints and Partial Information
Opimal Invesmen under Dynamic Risk Consrains and Parial Informaion Wolfgang Puschögl Johann Radon Insiue for Compuaional and Applied Mahemaics (RICAM) Ausrian Academy of Sciences www.ricam.oeaw.ac.a 2
More informationChapter 3 Boundary Value Problem
Chaper 3 Boundary Value Problem A boundary value problem (BVP) is a problem, ypically an ODE or a PDE, which has values assigned on he physical boundary of he domain in which he problem is specified. Le
More informationAn Introduction to Backward Stochastic Differential Equations (BSDEs) PIMS Summer School 2016 in Mathematical Finance.
1 An Inroducion o Backward Sochasic Differenial Equaions (BSDEs) PIMS Summer School 2016 in Mahemaical Finance June 25, 2016 Chrisoph Frei cfrei@ualbera.ca This inroducion is based on Touzi [14], Bouchard
More informationINEXACT CUTS FOR DETERMINISTIC AND STOCHASTIC DUAL DYNAMIC PROGRAMMING APPLIED TO CONVEX NONLINEAR OPTIMIZATION PROBLEMS
INEXACT CUTS FOR DETERMINISTIC AND STOCHASTIC DUAL DYNAMIC PROGRAMMING APPLIED TO CONVEX NONLINEAR OPTIMIZATION PROBLEMS Vincen Guigues School of Applied Mahemaics, FGV Praia de Boafogo, Rio de Janeiro,
More informationAuthor's personal copy
European Journal of Operaional Research 224 (2013) 375 391 Conens liss available a SciVerse ScienceDirec European Journal of Operaional Research journal homepage: www.elsevier.com/locae/ejor Decision Suppor
More informationA DELAY-DEPENDENT STABILITY CRITERIA FOR T-S FUZZY SYSTEM WITH TIME-DELAYS
A DELAY-DEPENDENT STABILITY CRITERIA FOR T-S FUZZY SYSTEM WITH TIME-DELAYS Xinping Guan ;1 Fenglei Li Cailian Chen Insiue of Elecrical Engineering, Yanshan Universiy, Qinhuangdao, 066004, China. Deparmen
More informationApplying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Capacity Constraints
IJCSI Inernaional Journal of Compuer Science Issues, Vol 9, Issue 1, No 1, January 2012 wwwijcsiorg 18 Applying Geneic Algorihms for Invenory Lo-Sizing Problem wih Supplier Selecion under Sorage Capaciy
More informationPhysics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle
Chaper 2 Newonian Mechanics Single Paricle In his Chaper we will review wha Newon s laws of mechanics ell us abou he moion of a single paricle. Newon s laws are only valid in suiable reference frames,
More informationRecursive Least-Squares Fixed-Interval Smoother Using Covariance Information based on Innovation Approach in Linear Continuous Stochastic Systems
8 Froniers in Signal Processing, Vol. 1, No. 1, July 217 hps://dx.doi.org/1.2266/fsp.217.112 Recursive Leas-Squares Fixed-Inerval Smooher Using Covariance Informaion based on Innovaion Approach in Linear
More informationMatrix Versions of Some Refinements of the Arithmetic-Geometric Mean Inequality
Marix Versions of Some Refinemens of he Arihmeic-Geomeric Mean Inequaliy Bao Qi Feng and Andrew Tonge Absrac. We esablish marix versions of refinemens due o Alzer ], Carwrigh and Field 4], and Mercer 5]
More informationKriging Models Predicting Atrazine Concentrations in Surface Water Draining Agricultural Watersheds
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Kriging Models Predicing Arazine Concenraions in Surface Waer Draining Agriculural Waersheds Paul L. Mosquin, Jeremy Aldworh, Wenlin Chen Supplemenal Maerial Number
More informationOptimization of a Liquefied Natural Gas Portfolio by SDDP techniques
Opimizaion of a Liquefied Naural Gas Porfolio by SDDP echniques J. Frédéric Bonnans INRIA-Saclay and CMAP, École Polyechnique Commun work wih Zhihao Cen (now a Arelys) Thibaul Chrisel (Toal) CEA EDF Inria
More informationSliding Mode Extremum Seeking Control for Linear Quadratic Dynamic Game
Sliding Mode Exremum Seeking Conrol for Linear Quadraic Dynamic Game Yaodong Pan and Ümi Özgüner ITS Research Group, AIST Tsukuba Eas Namiki --, Tsukuba-shi,Ibaraki-ken 5-856, Japan e-mail: pan.yaodong@ais.go.jp
More informationSpace-time Galerkin POD for optimal control of Burgers equation. April 27, 2017 Absolventen Seminar Numerische Mathematik, TU Berlin
Space-ime Galerkin POD for opimal conrol of Burgers equaion Manuel Baumann Peer Benner Jan Heiland April 27, 207 Absolvenen Seminar Numerische Mahemaik, TU Berlin Ouline. Inroducion 2. Opimal Space Time
More informationMaximum Likelihood Parameter Estimation in State-Space Models
Maximum Likelihood Parameer Esimaion in Sae-Space Models Arnaud Douce Deparmen of Saisics, Oxford Universiy Universiy College London 4 h Ocober 212 A. Douce (UCL Maserclass Oc. 212 4 h Ocober 212 1 / 32
More informationState-Space Models. Initialization, Estimation and Smoothing of the Kalman Filter
Sae-Space Models Iniializaion, Esimaion and Smoohing of he Kalman Filer Iniializaion of he Kalman Filer The Kalman filer shows how o updae pas predicors and he corresponding predicion error variances when
More informationInstitute for Mathematical Methods in Economics. University of Technology Vienna. Singapore, May Manfred Deistler
MULTIVARIATE TIME SERIES ANALYSIS AND FORECASTING Manfred Deisler E O S Economerics and Sysems Theory Insiue for Mahemaical Mehods in Economics Universiy of Technology Vienna Singapore, May 2004 Inroducion
More informationChristos Papadimitriou & Luca Trevisan November 22, 2016
U.C. Bereley CS170: Algorihms Handou LN-11-22 Chrisos Papadimiriou & Luca Trevisan November 22, 2016 Sreaming algorihms In his lecure and he nex one we sudy memory-efficien algorihms ha process a sream
More informationnot to be republished NCERT MATHEMATICAL MODELLING Appendix 2 A.2.1 Introduction A.2.2 Why Mathematical Modelling?
256 MATHEMATICS A.2.1 Inroducion In class XI, we have learn abou mahemaical modelling as an aemp o sudy some par (or form) of some real-life problems in mahemaical erms, i.e., he conversion of a physical
More informationBU Macro BU Macro Fall 2008, Lecture 4
Dynamic Programming BU Macro 2008 Lecure 4 1 Ouline 1. Cerainy opimizaion problem used o illusrae: a. Resricions on exogenous variables b. Value funcion c. Policy funcion d. The Bellman equaion and an
More informationEchocardiography Project and Finite Fourier Series
Echocardiography Projec and Finie Fourier Series 1 U M An echocardiagram is a plo of how a porion of he hear moves as he funcion of ime over he one or more hearbea cycles If he hearbea repeas iself every
More informationCONTROL SYSTEMS, ROBOTICS AND AUTOMATION Vol. XI Control of Stochastic Systems - P.R. Kumar
CONROL OF SOCHASIC SYSEMS P.R. Kumar Deparmen of Elecrical and Compuer Engineering, and Coordinaed Science Laboraory, Universiy of Illinois, Urbana-Champaign, USA. Keywords: Markov chains, ransiion probabiliies,
More informationAir Traffic Forecast Empirical Research Based on the MCMC Method
Compuer and Informaion Science; Vol. 5, No. 5; 0 ISSN 93-8989 E-ISSN 93-8997 Published by Canadian Cener of Science and Educaion Air Traffic Forecas Empirical Research Based on he MCMC Mehod Jian-bo Wang,
More information2. Nonlinear Conservation Law Equations
. Nonlinear Conservaion Law Equaions One of he clear lessons learned over recen years in sudying nonlinear parial differenial equaions is ha i is generally no wise o ry o aack a general class of nonlinear
More informationEnergy Storage Benchmark Problems
Energy Sorage Benchmark Problems Daniel F. Salas 1,3, Warren B. Powell 2,3 1 Deparmen of Chemical & Biological Engineering 2 Deparmen of Operaions Research & Financial Engineering 3 Princeon Laboraory
More informationSingle and Double Pendulum Models
Single and Double Pendulum Models Mah 596 Projec Summary Spring 2016 Jarod Har 1 Overview Differen ypes of pendulums are used o model many phenomena in various disciplines. In paricular, single and double
More informationHamilton- J acobi Equation: Weak S olution We continue the study of the Hamilton-Jacobi equation:
M ah 5 7 Fall 9 L ecure O c. 4, 9 ) Hamilon- J acobi Equaion: Weak S oluion We coninue he sudy of he Hamilon-Jacobi equaion: We have shown ha u + H D u) = R n, ) ; u = g R n { = }. ). In general we canno
More informationEcon107 Applied Econometrics Topic 7: Multicollinearity (Studenmund, Chapter 8)
I. Definiions and Problems A. Perfec Mulicollineariy Econ7 Applied Economerics Topic 7: Mulicollineariy (Sudenmund, Chaper 8) Definiion: Perfec mulicollineariy exiss in a following K-variable regression
More informationEconomics 8105 Macroeconomic Theory Recitation 6
Economics 8105 Macroeconomic Theory Reciaion 6 Conor Ryan Ocober 11h, 2016 Ouline: Opimal Taxaion wih Governmen Invesmen 1 Governmen Expendiure in Producion In hese noes we will examine a model in which
More informationChapter 4. Truncation Errors
Chaper 4. Truncaion Errors and he Taylor Series Truncaion Errors and he Taylor Series Non-elemenary funcions such as rigonomeric, eponenial, and ohers are epressed in an approimae fashion using Taylor
More informationCHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK
175 CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK 10.1 INTRODUCTION Amongs he research work performed, he bes resuls of experimenal work are validaed wih Arificial Neural Nework. From he
More informationProbabilistic Robotics
Probabilisic Roboics Bayes Filer Implemenaions Gaussian filers Bayes Filer Reminder Predicion bel p u bel d Correcion bel η p z bel Gaussians : ~ π e p N p - Univariae / / : ~ μ μ μ e p Ν p d π Mulivariae
More informationRL Lecture 7: Eligibility Traces. R. S. Sutton and A. G. Barto: Reinforcement Learning: An Introduction 1
RL Lecure 7: Eligibiliy Traces R. S. Suon and A. G. Baro: Reinforcemen Learning: An Inroducion 1 N-sep TD Predicion Idea: Look farher ino he fuure when you do TD backup (1, 2, 3,, n seps) R. S. Suon and
More informationOptimal approximate dynamic programming algorithms for a general class of storage problems
Opimal approximae dynamic programming algorihms for a general class of sorage problems Juliana M. Nascimeno Warren B. Powell Deparmen of Operaions Research and Financial Engineering Princeon Universiy
More informationReferences are appeared in the last slide. Last update: (1393/08/19)
SYSEM IDEIFICAIO Ali Karimpour Associae Professor Ferdowsi Universi of Mashhad References are appeared in he las slide. Las updae: 0..204 393/08/9 Lecure 5 lecure 5 Parameer Esimaion Mehods opics o be
More information) were both constant and we brought them from under the integral.
YIELD-PER-RECRUIT (coninued The yield-per-recrui model applies o a cohor, bu we saw in he Age Disribuions lecure ha he properies of a cohor do no apply in general o a collecion of cohors, which is wha
More informationGENERALIZATION OF THE FORMULA OF FAA DI BRUNO FOR A COMPOSITE FUNCTION WITH A VECTOR ARGUMENT
Inerna J Mah & Mah Sci Vol 4, No 7 000) 48 49 S0670000970 Hindawi Publishing Corp GENERALIZATION OF THE FORMULA OF FAA DI BRUNO FOR A COMPOSITE FUNCTION WITH A VECTOR ARGUMENT RUMEN L MISHKOV Received
More informationKEY. Math 334 Midterm III Winter 2008 section 002 Instructor: Scott Glasgow
KEY Mah 334 Miderm III Winer 008 secion 00 Insrucor: Sco Glasgow Please do NOT wrie on his exam. No credi will be given for such work. Raher wrie in a blue book, or on your own paper, preferably engineering
More informationPlanning in POMDPs. Dominik Schoenberger Abstract
Planning in POMDPs Dominik Schoenberger d.schoenberger@sud.u-darmsad.de Absrac This documen briefly explains wha a Parially Observable Markov Decision Process is. Furhermore i inroduces he differen approaches
More informationTom Heskes and Onno Zoeter. Presented by Mark Buller
Tom Heskes and Onno Zoeer Presened by Mark Buller Dynamic Bayesian Neworks Direced graphical models of sochasic processes Represen hidden and observed variables wih differen dependencies Generalize Hidden
More information12: AUTOREGRESSIVE AND MOVING AVERAGE PROCESSES IN DISCRETE TIME. Σ j =
1: AUTOREGRESSIVE AND MOVING AVERAGE PROCESSES IN DISCRETE TIME Moving Averages Recall ha a whie noise process is a series { } = having variance σ. The whie noise process has specral densiy f (λ) = of
More informationMean-square Stability Control for Networked Systems with Stochastic Time Delay
JOURNAL OF SIMULAION VOL. 5 NO. May 7 Mean-square Sabiliy Conrol for Newored Sysems wih Sochasic ime Delay YAO Hejun YUAN Fushun School of Mahemaics and Saisics Anyang Normal Universiy Anyang Henan. 455
More informationControl of computer chip semi-conductor wafer fabs
Conrol of compuer chip semi-conducor wafer fabs Cos: x9 $ Reurn: years Cycle ime: 6 weeks WIP: 6, wafers, 8x6 $ Challenge: Conrol he queues a ~5 work seps Conrol of Manufacuring Sysems:! Sochasic racking
More informationExcel-Based Solution Method For The Optimal Policy Of The Hadley And Whittin s Exact Model With Arma Demand
Excel-Based Soluion Mehod For The Opimal Policy Of The Hadley And Whiin s Exac Model Wih Arma Demand Kal Nami School of Business and Economics Winson Salem Sae Universiy Winson Salem, NC 27110 Phone: (336)750-2338
More informationReconstructing the power grid dynamic model from sparse measurements
Reconsrucing he power grid dynamic model from sparse measuremens Andrey Lokhov wih Michael Cherkov, Deepjyoi Deka, Sidhan Misra, Marc Vuffray Los Alamos Naional Laboraory Banff, Canada Moivaion: learning
More informationCompetitive and Cooperative Inventory Policies in a Two-Stage Supply-Chain
Compeiive and Cooperaive Invenory Policies in a Two-Sage Supply-Chain (G. P. Cachon and P. H. Zipkin) Presened by Shruivandana Sharma IOE 64, Supply Chain Managemen, Winer 2009 Universiy of Michigan, Ann
More informationACE 564 Spring Lecture 7. Extensions of The Multiple Regression Model: Dummy Independent Variables. by Professor Scott H.
ACE 564 Spring 2006 Lecure 7 Exensions of The Muliple Regression Model: Dumm Independen Variables b Professor Sco H. Irwin Readings: Griffihs, Hill and Judge. "Dumm Variables and Varing Coefficien Models
More informationVehicle Arrival Models : Headway
Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where
More information