Solvability of Indefinite Stochastic Riccati Equations and Linear Quadratic Optimal Control Problems

Size: px
Start display at page:

Download "Solvability of Indefinite Stochastic Riccati Equations and Linear Quadratic Optimal Control Problems"

Transcription

1 *Manuscrpt 2nd revson) Clck here to vew lnked References Solvablty of Indefnte Stochastc Rccat Equatons and Lnear Quadratc Optmal Control Problems Janhu Huang a Zhyong Yu b a Department of Appled Mathematcs, The Hong Kong Polytechnc Unversty, Hong Kong, Chna b School of Mathematcs, Shandong Unversty, Jnan 251, Chna January 7, 214 Abstract A new approach to study the ndefnte stochastc lnear quadratc LQ) optmal control problems, whch we called the equvalent cost functonal method, s ntroduced by Yu 15 n the setup of Hamltonan system. On the other hand, another mportant ssue along ths research drecton, s the possble state feedback representaton of optmal control and the solvablty of assocated ndefnte stochastc Rccat equatons. As the response, ths paper contnues to develop the equvalent cost functonal method by extendng t to the Rccat equaton setup. Our analyss s featured by ts ntroducton of some equvalent cost functonals whch enable us to have the brdge between the ndefnte and postvedefnte stochastc LQ problems. Wth such brdge, some solvablty relaton between the ndefnte and postve-defnte Rccat equatons s further characterzed. It s remarkable the solvablty of the former s rather complcated than the latter hence our relaton provdes some alternatve but useful vewpont. Consequently, the correspondng ndefnte lnear quadratc problem s dscussed for whch the unque optmal control s derved n terms of state feedback va the soluton of Rccat equaton. In addton, some example s studed usng our theoretcal results. Key words: Stochastc Rccat Equaton, Stochastc Lnear Quadratc Optmal Control, Backward Stochastc Dfferental Equaton BSDE). AMS subject classfcaton: 93E2, 49N1, 6H1. 1 Introducton In ths paper, we consder the followng stochastc lnear quadratc for short, LQ hereafter) optmal control problem: Mnmze Ju) = 1 T } { Qx 2 E T, x T + R t x t, x t + 2 S t u t, x t + N t u t, u t dt 1) dx t = A t x t + B t u t ) dt + C t x t + D ) tu t dw t, Subject to 2) x = h, Ths work s supported by the Natonal Natural Scence Foundaton of Chna ) and the Natural Scence Foundaton of Shandong Provnce, Chna ZR21AQ4). The authors acknowledge the support of RGC Earmarked grant 599. Emal: majhuang@polyu.edu.hk Correspondng author. Emal: yuzhyong@sdu.edu.cn 1

2 where W t = Wt 1,..., Wt d ) s a d-dmensonal Brownan moton and the control varable u t takes ts value n some Eucldean space. Note that n most lterature of LQ problem, the matrx-valued process S t s set to be zero thus no cross-term S t u t, x t nvolves. For sake of convenence, we call the LQ problem NC for short of no cross-term) f S t. Correspondngly, a stochastc Rccat equaton SRE) s ntroduced for solvng the stochastc LQ problem. In partcular, the SRE assocated to our stochastc LQ problem s a matrx-valued nonlnear backward stochastc dfferental equaton BSDE) wth the followng form: dk t = GA t, B t, C t, D t ; R t, N t, S t ; K t, L t )dt L tdwt, 3) K T = Q, where we denote by L = L 1, L 2,..., L d ) and the coeffcent G s GA, B, C, D; R, N, S; K, L) := KA + A K + L C + C ) L ) + C ) KC + R S + KB + S + KB + C ) KD N + C ) KD. 1 D ) KD Note that a BSDE s an Itô-type stochastc dfferental equaton SDE) n whch the termnal nstead ntal condton s specfed. The BSDE admts an adapted soluton par K, L) under rather mld condtons. Unlke the forward SDE, the addtonal soluton component L s ntroduced here to make the BSDE have adapted solutons to the fltraton generated by underlyng Brownan moton and termnal condton. Borrowng the term from mathematcal fnance, the second component L maybe nterpreted as the rsk-adjustment factor. In ths sense, the soluton structure of BSDEs s very dfferent to that of forward SDEs. For more detals about BSDEs, the nterested readers may refer the orgnal paper by Pardoux and Peng 8 n the general nonlnear case, and the monograph by Yong and Zhou 14, Chapter 7. In prncple, f the SRE 3) admts a soluton, then the correspondng stochastc LQ problem s solvable, and an optmal control can be represented explctly as a lnear state feedback by the soluton of SRE 3). It s well-known that for determnstc NC-LQ problem namely, S t, C t, D t and all the other coeffcents are determnstc matrces), the control weght N t n cost functonal should be nonnegatve defnte to make the LQ problem well-posed e.g., see Anderson and Moore 1 for more detals). If N t s nonnegatve but beng degenerate on a set wth postve Lebesgue measure, the related LQ problem may have no optmal control see an example n Chen and Yong 4). Keep ths n mnd, n the early research stage to stochastc NC-LQ problems, the postve defnteness condton for N t was always assumed and as a result, the derved stochastc LQ theory s very smlar to that of determnstc one. Among them, we would lke to menton the followng results whch are more related to our present work. In case all the coeffcents A, B, C, D, Q, R N are determnstc and N s unformly postve, t follows L = and SRE 3) s reduced to a nonlnear matrx-valued ordnary dfferental equaton wthout randomness. The solvablty for ths case s obtaned by Wonham 13. For the general random coeffcents, the solvablty of SRE 3) wth unformly postve N and vanshed S s a long standng open problem whch s proposed by Bsmut 2 and Peng 1 respectvely. Tang 12 obtaned one exstence and unqueness result whch completely solved ths open problem. 2 4)

3 However, t was observed by Peng 9, Chen, L and Zhou 3 that there actually have some essental dfference between the determnstc and stochastc LQ problems. In fact, there do exst some non-trval examples n whch the control weghts N t are allowed to be ndefnte but the correspondng LQ problems are stll well-posed. The study of those ndefnte stochastc LQ problems possesses not only ts theoretcal merts but also broad-range applcatons. Some examples nclude the mean-varance portfolo selecton problems studed by Lm and Zhou 7 where the control weght N s equal to zero; the polluton control model gven by Chen, L and Zhou 3 where N s negatve defnte. The solvablty of ndefnte stochastc LQ problem s closely lnked to the solvablty of ndefnte SREs. There are many works focusng on ths ssue and we menton a few as follows. If the control weght N s ndefnte, Chen, L and Zhou 3, Theorem 4.6 gave a necessary and suffcent condton for the exstence and unqueness of SRE when C =, S = and all the other matrces are determnstc. Chen and Zhou 5 extended the above work by lettng C but stll n the determnstc framework. A suffcent condton for the solvablty of SRE s proved there. In case of random coeffcents, Hu and Zhou 6 establshed the unqueness of solutons of SRE n generalty, but the exstence result s proved only for some specal cases. Recently, Qan and Zhou 11 mproved the results of 6 by usng some technques of BSDEs. However, all these works are stll far away to a complete soluton of the solvablty problem of ndefnte SRE. In the paper of Yu 15, a new approach whch we named the equvalent cost functonal method, was ntroduced to deal wth the ndefnte LQ problems n the context of Hamltonan systems. The present paper explores the solvablty of ndefnte SRE see Eq.3)) by applyng the equvalent cost functonal method. The man dea s the ntroducton of so-called equvalent functonal whch can be nterpreted n the followng rough sense. Two dfferent cost functonals are sad to be equvalent f they are used to evaluate the performance of same controlled system but always lead to the same evaluaton result. In other words, two functonals are equvalent f they always lead to the same decson makng for a gven controlled system. Such equvalence has some nterestng mplcatons: the orgnal stochastc LQ problem wth ndefnte control weght can be transformed nto some postve defnte stochastc LQ problem, provded we can fnd some equvalent but postve cost functonals. In fact, as we wll demonstrate later, ths s always the case. Relyng on such transformaton, we can nvestgate the solvablty property of ndefnte SREs by vrtue of the solvablty of postve SREs. Furthermore, we can get some results of ndefnte stochastc LQ problems based on the exstng results of postve-defnte LQ problems. Instead of handlng the more dffcult ndefnte SRE drectly whch s the man method n the lterature, see for example 3, 5, 6, 7, 11), our method provdes some alternatve but more effectve way va the brdge of equvalent cost functonals, whch makes our analyss more smpler n many cases see the example at the paper end). As mentoned by above ntroducton, t s always the NC-LQ problems S = ) to be nvestgated n most exstng lterature and there exst consderable related results. On the other hand, to dscuss the equvalent cost functonals, t s more preferable to study the LQ problems wth nonzero cross terms namely, S ) but the related studes seems relatvely few. Among them, Yong and Zhou 14 dd some research n smlar framework but ther results can not be drectly appled to our setup here. In ths paper, as a prelmnary result, we dscuss the non-zero cross term LQ problems wth postve control weght whch we called the standard LQ problem). Dfferent from Yong and Zhou 14, we ntroduce an nvertble lnear transform see Lemma 3.2) whch lnks the standard LQ problems wth the correspondng NC-LQ problems. Based on t, by such transform and the exstng results of NC-LQ problems n the lterature, we obtan the desred result of our standard LQ problems. Ths result see Theorem 3.5 below) s new n lterature and can be vewed as another contrbuton of our paper. The rest of ths paper s structured as follows. In Secton 2, we ntroduce some notatons and formulate the stochastc LQ problem. Secton 3 ams to study the LQ problem wth unformly 3

4 postve control weght N and nonzero cross tem S. We reduce the general standard stochastc LQ problem to a stochastc NC-LQ problem by a lnear transformaton. As the man result, Secton 4 s devoted to study the ndefnte SRE and ndefnte LQ problem wth the help of equvalent cost functonals. Some example s also dscussed. Secton 5 concludes our paper. 2 Notatons and problem formulaton Let R n be n-dmensonal Eucldean space wth Eucldean norm and Eucldean nner product,. Let R n m be the Hlbert space consstng of all n m) matrces wth nner product A, B := tr{ab }, for any A, B R n m, 5) where the superscrpt denotes the transpose of vectors or matrces. The norm A of A nduced by the nner product s A = traa. In partcular, we denote by S n the set of all n n) symmetrc matrces, S n + the set of all n n) nonnegatve defnte matrces, and Ŝn + the set of all n n) postve defnte matrces. Let T > be a fxed tme horzon and Ω, F, F, P) be a complete fltered probablty space on whch a d-dmensonal standard Brownan moton {W t := W 1 t,..., W d t ), t T } s defned, F = {F t, t T } s the natural fltraton of W augmented by all P-null sets. Let M denote a Eucldean space or a set of matrces except Ŝ n +. Now we ntroduce the followng notatons. L Ω, F T, P; M), the set of all M-valued F T -measurable bounded random varables; L F, T ; M), the set of all M-valued F-adapted bounded processes; L 2 F, T ; M), the set of all M-valued F-adapted processes u such that E T u t 2 dt < ; 6) SF 2, T ; M), the set of all M-valued F-adapted processes x whch have contnuous paths such that E sup x t 2 < ; 7) t,t L F, T ; Ŝn +), the set of all Ŝ n +-valued F-adapted bounded processes N. Moreover, N s unformly postve,.e., there exsts a constant δ > such that N t v, v δ v 2 for any v R n, a.s. a.e. In ths paper, we consder the followng lnear controlled stochastc dfferental equaton SDE, for short): dx t = A t x t + B t u t ) dt + C t x t + D ) tu t dw t, t, T, 8) x = h, where the ntal condton h R n, A, C L F, T ; Rn n ), B, D L F, T ; Rn m ), = 1, 2,..., d. Clearly, for any u L 2 F, T ; Rm ), there exsts a unque strong soluton x SF 2, T ; Rn ) to equaton 8). u L 2 F, T ; Rm ) s called an admssble control, x s called the correspondng admssble state process, and x, u) s called an admssble par. In addton, we are gven a quadratc cost functonal: Ju) := 1 T } { Qx 2 E T, x T + R t x t, x t + 2 S t u t, x t + N t u t, u t dt, 9) 4

5 where R L F, T ; Sn ), S L, T ; R n m ), N L F, T ; Sm ) and Q L Ω, F T, P; S n ). Suppose the controller wants to mnmze the cost functonal J ) by selectng an approprate admssble control u. Our problem s to fnd an admssble control ū L 2 F, T ; Rm ) such that Jū) = nf Ju). 1) u L 2 F,T ;Rm ) We call the above problem the stochastc lnear quadratc optmal control problem. For smplcty, we call t LQ problem 8)-9). If we fnd an admssble control ū satsfyng 1), then we call t an optmal control of LQ problem 8)-9). The correspondng state process x and x, ū) are called an optmal state process and an optmal par, respectvely. In the theory of LQ problem, t s very natural and appealng to connect the LQ problem 8)- 9) wth the stochastc Rccat equaton SRE, for short) 3) for the possble feedback regulator desgn. To conclude ths secton, we gve the defnton of soluton of SRE 3) whch s smlar to that of Tang 12. Defnton 2.1. A soluton of SRE 3) s a par of adapted matrx processes K, L) such that ) T ) N + d D ) KD s a.s.a.e. postve; moreover T ) K, L) satsfes the backward SRE 3). L s 2 ds <, a.s.; 11) GA t, B t, C t, D t ; R t, N t, S t ; K t, L t ) dt <, a.s.; 12) 3 LQ problem wth postve control weght cost In ths secton, we study the LQ problem 8)-9) under the followng standard assumptons. ) R S Assumpton STN). Q L Ω, F T, P; S+), n S L N F, T ; Sn+m + ) and N L F, T ; Ŝm + ). Remark 3.1. From ) the basc operatons of nonnegatve matrces, we know f N L F, T ; Ŝm + ), R S then S L N F Ω, F T, P; S+ n+m ) s equvalent to R SN 1 S L F Ω, F T, P; S+). n By contrast to the NC-LQ problems, an addtonal tem 2 S t u t, x t appears n the cost functonal 9) n our settng. Next we wll reduce our LQ problem to the NC-LQ problem as below: where Mnmze Jũ) := 1 Subject to d x t = { 2 E x = h, Q x T, x T + T Ãt x t + B t ũ t ) dt + R } t x t, x t + N t ũ t, ũ t dt C t x t + D tũ t ) dw t, t, T, R t := R t S t N 1 t S t, Ã t := A t B t N 1 t S t, C t := C t D tn 1 t S t, = 1,..., d. 15) It s worth notng that, n vew of Remark 3.1, Assumpton STN) s exactly the usual postve assumpton when we study the NC-LQ problem13)-14). 5 13) 14)

6 Lemma 3.2. Let Assumpton STN) hold true. For any two process pars x, u) and x, ũ), ntroduce the followng nvertble lnear transformaton: for t, T, ) ) ) xt I O xt = ũ t Nt 1 St 16) I u t or ) ) ) xt I O xt = u t Nt 1 St. 17) I ũ t Then the followng two statements are equvalent: ) x, u) s an admssble optmal) par of the LQ problem 8)-9); ) x, ũ) s an admssble optmal) par of the NC-LQ problem 13)-14). Moreover, we have Ju) = Jũ). Proof. The admssble part. Through drect calculaton, t s easy to verfy the statement ) s equvalent to the statement ), and Ju) = Jũ). The optmal part. Let x, u) be an optmal par of the LQ problem 8)-9), then the correspondng x, ũ) s an admssble par of the NC-LQ problem 13)-14). For any admssble par x 1, ũ 1 ) of NC-LQ problem 13)-14), denote x 1, u 1 ) the correspondng admssble par of the LQ problem 8)-9). Then t follows that Jũ 1 ) = Ju 1 ) Ju) = Jũ). 18) From the arbtrarness of ũ 1, we know x, ũ) s an optmal par of the NC-LQ problem 13)- 14). The above lemma tells us that there exsts some equvalent relatonshp between these two LQ problems. We would lke to analyze ther relatonshp n terms of sutable SREs. Lemma 3.3. Under Assumpton STN), the SREs correspondng to LQ problem 8)-9) and NC-LQ problem 13)-14) are the same one,.e. where GA, B, C, D; R, N, S; K, L) = GÃ, B, C, D; R, N, O; K, L), 19) R := R SN 1 S, Ã := A BN 1 S, C := C D N 1 S, = 1,..., d. 2) Proof. For smplcty of notatons, we denote by 1 V := N + D ) KD S + KB + Ṽ := N + 1 D ) KD KB + We calculate Ṽ N 1 S 1 = N + D ) KD KB + = V. N + 1 D ) KD N + C ) KD, 21) C ) KD. 22) C D N 1 S ) KD D ) KD N 1 S 6 23)

7 Now, from the defntons 4), 2), 21), 22) and the relatonshp between V and Ṽ 23), we have GA, B, C, D; R, N, S; K, L) and = KA + A K + + S + KB + L C + C ) L ) + C ) KC + R C ) KD V, GÃ, B, C, D; R, N, O; K, L) = K A BN 1 S ) + A BN 1 S ) K 24) L C D N 1 S ) + C D N 1 S ) L ) C D N 1 S ) K C D N 1 S ) + R SN 1 S ) KB + The dfference between 24) and 25) s gven as follows: C D N 1 S ) KD V + N 1 S ). GÃ, B, C, D; R, N, O; K, L) GA, B, C, D; R, N, S; K, L) = , 25) 26) where 1 := KBN 1 S 2 := SN 1 B K 3 := 4 := 5 := S + KB + S + L D N 1 S C ) KD N 1 S SN 1 S, 27) SN 1 D ) L SN 1 D ) K C D N 1 S ), 28) C ) KD V + N 1 S ), 29) SN 1 D ) KD V + N 1 S ), 3) S + KB + C ) KD V. 31) We notce that, here we wrte the last tem of 25) as We have = 1 = S + KB + S + KB + C ) KD N 1 S, 32) C ) KD N 1 S. 33) 7

8 Therefore, =. Moreover 2 = SN 1 KB + 4 = SN 1 N + Then, from 23) and 2), we have = SN 1 N + C D N 1 S ) KD, 34) D ) KD V + N 1 S ). 35) D ) KD Ṽ + KB + By 22), we get =. Consequently, we obtan the desred concluson: and we fnsh the proof. C ) KD. 36) GÃ, B, C, D; R, N, O; K, L) = GA, B, C, D; R, N, S; K, L), 37) The NC-LQ problem 13)-14) has been well studed by varous lterature. In partcular, Tang 12 gave the solvablty of the assocated SRE under Assumpton STN). Now, for the convenence of readers, we state the followng results. Lemma 3.4 Tang 12). Under Assumpton STN), the SRE dk t = GÃt, B t, C t, D t ; R t, N t, O; K t, L t )dt K T = Q L tdwt, 38) admts a unque adapted soluton K, L) L F, T ; Sn +) L 2 F, T ; Sn ) d ). Moreover, the NC-LQ problem13)-14) admts a unque optmal par x, ũ) whch s determned by 1 ũ t = N t + Dt) K t Dt K t B t + L tdt + C t) K t Dt x t, d x t = x = h, Ãt x t + B t ũ t ) dt + C t x t + D tũ t ) dw t, t, T, and the value of optmal cost s gven by Jũ) = 1/2) K h, h. We note that the SRE 38) s separated off from the control and state, so ts soluton K, L) s also ndependent of them. One can frst solves K, L), and then apples 39) to construct the optmal feedback control. For the purpose of practcal applcatons, one may use the numercal smulaton of K, L). Due to the SRE s a specal BSDE, the nterested readers may refer the lterature on numercal smulaton of BSDEs, for example Zhao, Chen and Peng 16. Wth the help of above prelmnary results, we are ready to state the man result of ths secton. 39) 8

9 Theorem 3.5. Under Assumpton STN), the SRE 3) admts a unque adapted soluton K, L) L F, T ; Sn +) L 2 F, T ; Sn ) d ). Consequently, N + d D ) KD L F, T ; Ŝm + ). Moreover, the LQ problem 8)-9) admts a unque optmal par x, u) gven by 1 u t = N t + Dt) K t Dt S t + K t B t + L tdt + Ct) K t Dt x t, dx t = A t x t + B t u t ) dt + C t x t + Dtu ) 4) t dw t, t, T, x = h, and the value of optmal cost s Ju) = 1/2) K h, h. Proof. We need only verfy the representaton of optmal control u, and other statements n the theorem follow drectly from the above lemmas. By the lnear transformaton ntroduced n Lemma 3.2, and the defnton of optmal control ũ for the NC-LQ problem 13)-14) n Lemma 3.4, we have u = ũ N 1 S x 1 = N + D ) KD KB + = N + N + 1 D ) KD N + D ) KD N 1 S x 1 D ) KD S + KB + Ths completes the proof. C D N 1 S ) KD x C ) KD x. When all the coeffcents A, B, C, D, R, S, N, Q are determnstc, SRE 3) turns out to be some matrx-valued ordnary dfferental equaton wthout randomness: dk t = GA t, B t, C t, D t ; R t, S t, N t ; K t, ), dt 42) K T = Q. Wonham 13 proved the exstence and unqueness for 42). Moreover the soluton K s nonnegatve. Corollary 3.6. Let Assumpton STN) hold true and suppose all coeffcents A, B, C, D, R, S, N, Q are determnstc, then the Rccat equaton 42) admts a unque soluton K. Moreover K s nonnegatve. Consequently, N + d D ) KD s unformly postve. Furthermore, the LQ problem 8)-9) admts a unque optmal par x, u) determned by 1 u t = N t + Dt) K t Dt S t + K t B t + Ct) K t Dt x t, dx t = A t x t + B t u t ) dt + C t x t + Dtu ) 43) t dw t, t, T, x = h, and the value of optmal cost functonal s Ju) = 1/2) K h, h. 41) 9

10 4 LQ problem wth ndefnte control weght cost In case the Assumpton STN) doesn t hold true for nstance, the control weght N s ndefnte), t s stll possble for the LQ problem 8)-9) to be well-posed and the optmal par exsts. In ths secton, we wll apply the equvalent cost functonal method proposed n Yu 15 to deal wth the LQ problem 8)-9) wthout Assumpton STN). Let us frst recall the defnton of equvalent cost functonal ntroduced n 15. Defnton 4.1. For a gven controlled system, f there exst two cost functonals J ) and J ) satsfyng: for any admssble controls u 1 and u 2, Ju 1 ) < Ju 2 ) f and only f Ju 1 ) < Ju 2 ), then we say J ) s equvalent to J ). Remark 4.2. It s not dffcult to see the followng two statements are equvalent: 1) the cost functonal J ) s equvalent to J ); 2) for any admssble controls u 1 and u 2, ) Ju 1 ) < Ju 2 ) f and only f Ju 1 ) < Ju 2 ); ) Ju 1 ) = Ju 2 ) f and only f Ju 1 ) = Ju 2 ); ) Ju 1 ) > Ju 2 ) f and only f Ju 1 ) > Ju 2 ). Obvously, when we use two equvalent cost functonals J ) and J ) to evaluate the same controlled system, we wll get the same results. Especally, for LQ problem wth cost functonal J ) and LQ problem wth J ), the exstence and unqueness of ther optmal pars are equvalent, and the optmal pars concde. The dea to deal wth LQ problem J ) wthout Assumpton STN) s as follows: f we can fnd a cost functonal J ) whch s equvalent to orgnal J ) but the matrces n J ) satsfy Assumpton STN), then we can study LQ problem J ) through the LQ problem J ). In ths sense, the equvalent cost functonals provde some new and more flexble approach to deal wth LQ problem J ) wthout Assumpton STN). Let us denote by { Θ := H L F, T ; t t Sn ) H t = H + Γ s ds + Λ sdws for all t, T, } where Γ, Λ L F, T ; Sn ), = 1,..., d. For any H Θ, we apply Itô s formula to H t x t, x t on the nterval, T : 44) H h, h = E H T x T, x T { + E + 2 T HB + HA + A H + Λ D + Λ C + C ) Λ ) + C ) HC + Γ x t, x t C ) HD u t, x t + D ) HD u t, u t }dt. 45) It s worth notng the constant H h, h s represented by any admssble par x, u) n a quadratc form. Therefore we can add H h, h /2 to orgnal cost functonal J ) to get some equvalent one, denoted by J H ). Through ths, we may transform J ) wthout Assumpton 1

11 STN) to J H ) satsfyng Assumpton STN). Especally, when H s nonnegatve, then nonnegatve tem d D ) HD u, u n 45) may transform a nonpostve control weght N n J ) to a postve one n J H ). The detals can be llustrated as follows. For each H Θ, we defne J H u) := Ju) 1 2 H h, h = 1 2 E { Q H x T, x T + T R H t x t, x t + 2 S H t u t, x t + N H t u t, u t dt}, 46) where R H = R + HA + A H + S H = S + HB + N H = N + Λ D + Λ C + C ) Λ ) + C ) HC + Γ, 47) C ) HD, 48) D ) HD, 49) Q H = Q H T. Snce J H ) and J ) dffer by only a constant H h, h /2, so they are equvalent. In other words, we get a famly of equvalent cost functonals {J H ), H Θ}. Through a straghtforward calculaton, we have Lemma 4.3. For any H Θ, the exstence and unqueness of SREs assocated wth LQ problem 8), 46) and LQ problem 8)-9) are equvalent. Moreover, f K H, L H ) s a soluton of the SRE assocated wth LQ problem 8), 46), then 5) K t = K H t + H t, L t = L H, t + Λ t, = 1,..., d, t, T 51) s a soluton of the SRE assocated wth LQ problem 8)-9). Here, the LQ problem 8), 46) means the LQ problem wth state gven by 8) and cost functonal gven by 46). The above lemma reveals an nterestng fact that there s a nce structure between the set of SREs and the set of Θ: the sum of an SRE and a gven process n Θ s stll an SRE. Theorem 4.4. If there exsts some H Θ such that R H, S H, N H, Q H ) satsfes Assumpton STN), then the SRE assocated wth LQ problem 8)-9) admts a unque soluton K, L) L F, T ; Sn ) L 2 F, T ; Sn ) d ). In addton, N + d D ) KD L F, T ; Ŝm + ). Moreover, the LQ problem 8)-9) admts a unque optmal par x, u) determned by 1 u t = N t + Dt) K t Dt S t + K t B t + L tdt + Ct) K t Dt x t, dx t = A t x t + B t u t ) dt + C t x t + Dtu ) 52) t dw t, t, T, x = h, and the value of optmal cost functonal s gven by Ju) = 1/2) K h, h. 11

12 Proof. For H Θ, by Theorem 3.5, the SRE assocated wth LQ problem 8), 46) admts a unque soluton K H, L H ) L F, T ; Sn +) L 2 F, T ; Sn ) d ). By Lemma 4.3, the SRE assocated wth LQ problem 8)-9) admts a unque soluton K, L) L F, T ; Sn ) L 2 F, T ; Sn ) d ). In addton, N + D ) KD = N H + D ) K H D L F, T ; Ŝm + ). 53) By Theorem 3.5 agan, the LQ problem 8), 46) admts a unque optmal par x, u) determned by 1 u t = Nt H + Dt) Kt H Dt St H + Kt H B t + L H, t Dt + Ct) Kt H Dt x t, dx t = A t x t + B t u t ) dt + C t x t + Dtu ) t dw t, t, T, x = h. 54) Snce J H ) s equvalent to J ), then x, u) s also the unque optmal par of LQ problem8)-9). A drect calculaton leads to another representaton of u as 1 u t = N t + Dt) K t Dt S t + K t B t + L tdt + Ct) K t Dt x t. 55) At the last step, let us calculate the optmal cost functonal for LQ problem 8)-9): Ju) = J H u) H h, h = 1 2 KH h, h H h, h = 1 2 K h, h, 56) where the second equaton s also from Theorem 3.5. The proof s completed. Theorem 4.5. For LQ problem 8)-9), f the assocated SRE admts a soluton K, L) L F, T ; Sn ) L F, T ; Sn ) d ) and N + d D ) KD L F, T ; Ŝm + ), then there exsts an equvalent cost functonal J H ), H Θ such that R H, S H, N H, Q H ) satsfes Assumpton STN). Proof. For the frst component K of the soluton of SRE, we consder the equvalent cost functonal J K ). It s easy to verfy Q K =, 57) N K = N + D ) KD, 58) S K = S + KB + C ) KD, 59) R K = S K N K) 1 S K ), 6) and R K, S K, N K, Q K ) satsfes Assumpton STN). When all the coeffcents A, B, C, D, R, S, N, Q are determnstc, we consder the followng set nstead of Θ, { ˆΘ := H L, T ; S n t ) H t = H + Γ s ds for all t, T, } 61) where Γ L, T ; S n ). 12

13 The same argument leads to Theorem 4.6. Suppose all the coeffcents A, B, C, D, R, S, N, Q are determnstc, then for the LQ problem 8)-9), the followng two statements are equvalent. ) There exsts an equvalent cost functonal J H ), H ˆΘ such that R H, S H, N H, Q H ) satsfes Assumpton STN); ) The Rccat equaton 42) admts a unque soluton K. Moreover N + d D ) KD s unformly postve. Example 4.7. Let the dmenson of state process x s one. Consder the followng LQ problem: Mnmze Ju) = 1 2 E x 2 T, 62) ) dx t = r t x t + θt u t dt + e u t dwt, Subject to 63) x = h, where r, θ are F-adapted bounded processes, and {e ; = 1, 2,..., d} s an orthogonal bass of R d. Obvously, Assumpton STN) does not hold true for J ). Now we ntroduce an equvalent cost functonal J H ) satsfyng Assumpton STN). Because r and θ are bounded, there exsts a constant K > such that 2r t θ t θ t K for any t, T. We defne H t = e KT t 2r s θ s θs)ds, t, T. 64) It s easy to check that H Θ wth e 2KT H t 1, Γ t = 2r t θ t θ t )H t and Λ t, = 1, 2..., d, for any t, T. We calculate Q H = 1 H T, N H t = H t I d, S H t = H t θ t, R H t = 2H t r t + Γ t, 65) where I d denotes the d d dentty matrx. Then we verfy Assumpton STN) holds true for J H ) thus LQ problem 62)-63) s solvable. In partcular, the correspondng SRE ) dk t = 2r t θt θ t K t 2θt L t L t L t dt L K tdwt, t 66) K T = 1 admts a unque soluton K, L) wth K beng unformly bounded and unformly postve, and L beng square ntegrable. The unque optmal control u s of the followng feedback form: u t = θ t + L t x t. 67) K t At the end of ths example, we note that the SRE 66) s just the one studed by Lm and Zhou 7 wheren they consdered the mean-varance portfolo selecton problem arsng from mathematcal fnance. Here we use the equvalent cost functonal method to revst the solvablty of 66), and the proof here s new and rather quck than the one used n 7. 13

14 5 Concluson The solvablty of ndefnte stochastc Rccat equatons has mportant values for both theoretcal analyss and real applcatons. Nevertheless, the study of ths ssue s very complcated hence only very few cases have been treated to date and the assumptons mposed there are strong. In ths paper, we propose a dfferent method to study ths ssue by the ntroducton of some equvalent cost functonal. Ths connects the ndefnte Rccat equatons to postve-defnte Rccat equatons. Through ths connecton, we obtan more general solvablty of ndefnte Rccat equatons under weak assumptons. Our method also provdes some alternatve and useful vewpont to consder other mportant optmzaton problems: for example, the lnear quadratc mean-feld control or dfferental game wth ndefnte control weghts). Ths wll be dscussed n our future works. References 1 B.D.O. Anderson and J.B. Moore, Optmal control-lnear quadratc methods, Prentce- Hall, New York, J. M. Bsmut, Controle des systems lnears quadratques: applcatons de l ntegrale stochastque, n Sémnare de Probabltés XII, Lecture Notes n Math. 649, C. Dellachere, P.A. Meyer, and M. Wel, eds., Sprnger-Verlag, Berln 1978), pp S. Chen, X. L and X. Zhou, Stochastc lnear quadratc regulators wth ndefnte control weght costs, SIAM J. Control Optm., ), pp S. Chen and J. Yong, Stochastc lnear quadratc optmal control problems, Appl. Math. Optm, 4321), pp S. Chen and Z. Zhou, Stochastc lnaer quadratc regulators wth ndefnte control weght costs. II, SIAM J. Control Optm., 392), pp Y. Hu and X. Zhou, Indefnte stochastc Rccat equatons, SIAM J. Control Optm., 4223), pp A.E.B. Lm and X.Y. Zhou, Mean-varance portfolo selecton wth random parameters n a complete market, Math. Oper. Res., 2722), pp E. Pardoux and S. Peng, Adapted soluton of a backward stochastc dfferental equaton, Systems Control Lett., 14199), pp S. Peng, New development n stochastc maxmum prncple and related backward stochastc dfferental equatons, n proceedngs of 31st CDC Conference, Tucson S. Peng, Open problems on backward stochastc dfferental equatons, n Control of Dstrbuted Parameter and Stochastc Systems Hangzhou, 1998), S. Chen, et al., eds., Kluwer Academc Publshers, Boston, pp , Z. Qan and X. Zhou, Exstence of solutons to a class of ndefnte stochastc Rccat equatons, SIAM J. Control Optm., 51213), pp S. Tang, General lnear quadratc optmal stochastc control problems wth random coeffcents: lnear stochastc Hamlton systems and backward stochastc Rccat equatons, SIAM J. Control Optm., 4223), pp

15 13 W.M. Wonham, On a matrx Rccat equaton of stochastc control, SIAM J. Control, 61968), pp J. Yong and Z. Zhou, Stochastc controls: Hamltonan systems and HJB equatons, Sprnger-Verlag, New York, Z. Yu, Equvalent cost functonals and stochastc lnear quadratc optmal control problems, ESAIM Control Optm. Calc. Var., 19213), pp W. Zhao, L. Chen and S. Peng, A new knd of accurate numercal method for backward stochastc dfferental equatons, SIAM J. Sc. Comput. 2826), pp

16 LaTeX Source Fles Clck here to download LaTeX Source Fles: Solvablty of ndefnte SREs 2nd revson).tex

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

A new Approach for Solving Linear Ordinary Differential Equations

A new Approach for Solving Linear Ordinary Differential Equations , ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 ) Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often

More information

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

General viscosity iterative method for a sequence of quasi-nonexpansive mappings Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

Inexact Newton Methods for Inverse Eigenvalue Problems

Inexact Newton Methods for Inverse Eigenvalue Problems Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Linear Feature Engineering 11

Linear Feature Engineering 11 Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19

More information

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2 Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to

More information

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of

More information

Deriving the X-Z Identity from Auxiliary Space Method

Deriving the X-Z Identity from Auxiliary Space Method Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA 92697 chenlong@math.uc.edu 1 Iteratve Methods In ths paper we dscuss teratve

More information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all

More information

Lecture 4: September 12

Lecture 4: September 12 36-755: Advanced Statstcal Theory Fall 016 Lecture 4: September 1 Lecturer: Alessandro Rnaldo Scrbe: Xao Hu Ta Note: LaTeX template courtesy of UC Berkeley EECS dept. Dsclamer: These notes have not been

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

More information

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

Integrals and Invariants of Euler-Lagrange Equations

Integrals and Invariants of Euler-Lagrange Equations Lecture 16 Integrals and Invarants of Euler-Lagrange Equatons ME 256 at the Indan Insttute of Scence, Bengaluru Varatonal Methods and Structural Optmzaton G. K. Ananthasuresh Professor, Mechancal Engneerng,

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton

More information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars

More information

The Finite Element Method: A Short Introduction

The Finite Element Method: A Short Introduction Te Fnte Element Metod: A Sort ntroducton Wat s FEM? Te Fnte Element Metod (FEM) ntroduced by engneers n late 50 s and 60 s s a numercal tecnque for solvng problems wc are descrbed by Ordnary Dfferental

More information

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed

More information

The lower and upper bounds on Perron root of nonnegative irreducible matrices

The lower and upper bounds on Perron root of nonnegative irreducible matrices Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College

More information

A Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function

A Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function A Local Varatonal Problem of Second Order for a Class of Optmal Control Problems wth Nonsmooth Objectve Functon Alexander P. Afanasev Insttute for Informaton Transmsson Problems, Russan Academy of Scences,

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

More information

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

COMPLEX NUMBERS AND QUADRATIC EQUATIONS COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not

More information

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

Formulas for the Determinant

Formulas for the Determinant page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use

More information

Group Analysis of Ordinary Differential Equations of the Order n>2

Group Analysis of Ordinary Differential Equations of the Order n>2 Symmetry n Nonlnear Mathematcal Physcs 997, V., 64 7. Group Analyss of Ordnary Dfferental Equatons of the Order n> L.M. BERKOVICH and S.Y. POPOV Samara State Unversty, 4430, Samara, Russa E-mal: berk@nfo.ssu.samara.ru

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

An Introduction to Morita Theory

An Introduction to Morita Theory An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory

More information

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan

More information

FREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced,

FREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced, FREQUENCY DISTRIBUTIONS Page 1 of 6 I. Introducton 1. The dea of a frequency dstrbuton for sets of observatons wll be ntroduced, together wth some of the mechancs for constructng dstrbutons of data. Then

More information

Remarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence

Remarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information

be a second-order and mean-value-zero vector-valued process, i.e., for t E

be a second-order and mean-value-zero vector-valued process, i.e., for t E CONFERENCE REPORT 617 DSCUSSON OF TWO PROCEDURES FOR EXPANDNG A VECTOR-VALUED STOCHASTC PROCESS N AN ORTHONORMAL WAY by R. GUTkRREZ and M. J. VALDERRAMA 1. ntroducton Snce K. Karhunen [l] and M. Lo&e [2]

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue

More information

On a direct solver for linear least squares problems

On a direct solver for linear least squares problems ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear

More information

Appendix B. The Finite Difference Scheme

Appendix B. The Finite Difference Scheme 140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton

More information

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

More information

Perfect Competition and the Nash Bargaining Solution

Perfect Competition and the Nash Bargaining Solution Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.

763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1. 7636S ADVANCED QUANTUM MECHANICS Soluton Set 1 Sprng 013 1 Warm-up Show that the egenvalues of a Hermtan operator  are real and that the egenkets correspondng to dfferent egenvalues are orthogonal (b)

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Canonical transformations

Canonical transformations Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,

More information

12. The Hamilton-Jacobi Equation Michael Fowler

12. The Hamilton-Jacobi Equation Michael Fowler 1. The Hamlton-Jacob Equaton Mchael Fowler Back to Confguraton Space We ve establshed that the acton, regarded as a functon of ts coordnate endponts and tme, satsfes ( ) ( ) S q, t / t+ H qpt,, = 0, and

More information

Report on Image warping

Report on Image warping Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.

More information

LECTURE 9 CANONICAL CORRELATION ANALYSIS

LECTURE 9 CANONICAL CORRELATION ANALYSIS LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of

More information

Lecture 5 Decoding Binary BCH Codes

Lecture 5 Decoding Binary BCH Codes Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture

More information

1 Matrix representations of canonical matrices

1 Matrix representations of canonical matrices 1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:

More information

Time-Varying Systems and Computations Lecture 6

Time-Varying Systems and Computations Lecture 6 Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy

More information

Strong Markov property: Same assertion holds for stopping times τ.

Strong Markov property: Same assertion holds for stopping times τ. Brownan moton Let X ={X t : t R + } be a real-valued stochastc process: a famlty of real random varables all defned on the same probablty space. Defne F t = nformaton avalable by observng the process up

More information

Lecture 17 : Stochastic Processes II

Lecture 17 : Stochastic Processes II : Stochastc Processes II 1 Contnuous-tme stochastc process So far we have studed dscrete-tme stochastc processes. We studed the concept of Makov chans and martngales, tme seres analyss, and regresson analyss

More information

Determinants Containing Powers of Generalized Fibonacci Numbers

Determinants Containing Powers of Generalized Fibonacci Numbers 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 19 (2016), Artcle 1671 Determnants Contanng Powers of Generalzed Fbonacc Numbers Aram Tangboonduangjt and Thotsaporn Thanatpanonda Mahdol Unversty Internatonal

More information

Random Walks on Digraphs

Random Walks on Digraphs Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

Homework Notes Week 7

Homework Notes Week 7 Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we

More information

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems

More information

Fixed point method and its improvement for the system of Volterra-Fredholm integral equations of the second kind

Fixed point method and its improvement for the system of Volterra-Fredholm integral equations of the second kind MATEMATIKA, 217, Volume 33, Number 2, 191 26 c Penerbt UTM Press. All rghts reserved Fxed pont method and ts mprovement for the system of Volterra-Fredholm ntegral equatons of the second knd 1 Talaat I.

More information

Feature Selection: Part 1

Feature Selection: Part 1 CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?

More information

Modelli Clamfim Equazioni differenziali 7 ottobre 2013

Modelli Clamfim Equazioni differenziali 7 ottobre 2013 CLAMFIM Bologna Modell 1 @ Clamfm Equazon dfferenzal 7 ottobre 2013 professor Danele Rtell danele.rtell@unbo.t 1/18? Ordnary Dfferental Equatons A dfferental equaton s an equaton that defnes a relatonshp

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

Binomial transforms of the modified k-fibonacci-like sequence

Binomial transforms of the modified k-fibonacci-like sequence Internatonal Journal of Mathematcs and Computer Scence, 14(2019, no. 1, 47 59 M CS Bnomal transforms of the modfed k-fbonacc-lke sequence Youngwoo Kwon Department of mathematcs Korea Unversty Seoul, Republc

More information

A SURVEY OF PROPERTIES OF FINITE HORIZON DIFFERENTIAL GAMES UNDER ISAACS CONDITION. Contents

A SURVEY OF PROPERTIES OF FINITE HORIZON DIFFERENTIAL GAMES UNDER ISAACS CONDITION. Contents A SURVEY OF PROPERTIES OF FINITE HORIZON DIFFERENTIAL GAMES UNDER ISAACS CONDITION BOTAO WU Abstract. In ths paper, we attempt to answer the followng questons about dfferental games: 1) when does a two-player,

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

5 The Rational Canonical Form

5 The Rational Canonical Form 5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces

More information

Affine and Riemannian Connections

Affine and Riemannian Connections Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons

More information

The Feynman path integral

The Feynman path integral The Feynman path ntegral Aprl 3, 205 Hesenberg and Schrödnger pctures The Schrödnger wave functon places the tme dependence of a physcal system n the state, ψ, t, where the state s a vector n Hlbert space

More information

The L(2, 1)-Labeling on -Product of Graphs

The L(2, 1)-Labeling on -Product of Graphs Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh

More information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information

Vector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.

Vector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence. Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm

More information

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18-023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18-023 Copyrght 2017

More information

SL n (F ) Equals its Own Derived Group

SL n (F ) Equals its Own Derived Group Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu

More information

10. Canonical Transformations Michael Fowler

10. Canonical Transformations Michael Fowler 10. Canoncal Transformatons Mchael Fowler Pont Transformatons It s clear that Lagrange s equatons are correct for any reasonable choce of parameters labelng the system confguraton. Let s call our frst

More information

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran

More information

Modelli Clamfim Equazione del Calore Lezione ottobre 2014

Modelli Clamfim Equazione del Calore Lezione ottobre 2014 CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g

More information

k t+1 + c t A t k t, t=0

k t+1 + c t A t k t, t=0 Macro II (UC3M, MA/PhD Econ) Professor: Matthas Kredler Fnal Exam 6 May 208 You have 50 mnutes to complete the exam There are 80 ponts n total The exam has 4 pages If somethng n the queston s unclear,

More information

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16 STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

CHAPTER III Neural Networks as Associative Memory

CHAPTER III Neural Networks as Associative Memory CHAPTER III Neural Networs as Assocatve Memory Introducton One of the prmary functons of the bran s assocatve memory. We assocate the faces wth names, letters wth sounds, or we can recognze the people

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0 Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of

More information

Uniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity

Uniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity Int. Journal of Math. Analyss, Vol. 6, 212, no. 22, 195-114 Unqueness of Weak Solutons to the 3D Gnzburg- Landau Model for Superconductvty Jshan Fan Department of Appled Mathematcs Nanjng Forestry Unversty

More information