Control of Uncertain Bilinear Systems using Linear Controllers: Stability Region Estimation and Controller Design
|
|
- Gertrude Shelton
- 5 years ago
- Views:
Transcription
1 Control of Uncertan Blnear Systems usng Lnear Controllers: Stablty Regon Estmaton Controller Desgn Shoudong Huang Department of Engneerng Australan Natonal Unversty Canberra, ACT 2, Australa James Lam Department of Mechancal Engneerng Unversty of Hong Kong Pokfulam Road, Hong Kong Abstract Ths paper studes the problem of stablty regon estmaton controller desgn for uncertan blnear systems when lnear controllers are used. Iteratve lnear matrx nequalty (ILMI) algorthms are presented to estmate the closed-loop stablty regon desgn the controllers. No tunng of parameters s needed n the desgn methods. The desgn ams to optmze between the sze of the stablty regon, dampng of the state varables, the feedback gan.. Introducton Blnear system s a specal knd of nonlnear systems whch could represent a varety of mportant physcal processes [8]. A great amount of lterature related to the control problems of such systems has been developed over the past decades. Among them, some results were concerned wth blnear systems wth only multplcatve control [2, 9]. For blnear systems wth both addtve multplcatve control nputs, some control desgns, such as bang-bang control [7] or optmal control [], obtan global asymptotc stablty under the assumpton that the open-loop system s ether stable or neutrally stable. When the open-loop system s unstable, t s dffcult to obtan global asymptotc stablty except when ndependent addtve multplcatve control nputs exst [4]. Though much attenton has been pad to the study of blnear systems, lttle research work was devoted to the control problems for blnear systems wth uncertantes. Recently, the quadratc stablzaton problem of uncertan blnear systems was studed n [] a suffcent condton for the system to be quadratcally stablzable by quadratc feedback control was presented. In some practcal control system desgns, local closedloop stablty may be enough lnear controllers are preferred. In [5], Gutman suggested that a nonlnear controller be used frstly forced the trajectory of a blnear system suffcently near the orgn, then swtch to a lnear controller such that the closed-loop system s asymptotcally stable. Hence the study of local stablzaton usng lnear controller the estmaton of the closed-loop stablty regon are useful n practce. Such a problem had been studed n [3] but the results n there are not easy to be appled because t needs tunng of parameters. Moreover, [3] dd not consdered the robustness of the controller to model uncertantes. Ths paper consders the stablty regon estmaton controller desgn for uncertan blnear systems, where the controls act addtvely multplcatvely smultaneously. The uncertantes are assumed to have a polytopc form. No assumpton on the open-loop stablty s made lnear state feedback control s studed. As compared wth [3], the results n ths paper has the followng advantage. Frstly, we estmate the dervatve of the Lyapunov functon n a dfferent way, our results are less conservatve than that n [3]. Secondly, our results are presented n the form of teratve lnear matrx nequalty (ILMI) algorthms. It needs no tunng of parameters can be effcently solved numercally usng LMI toolbox n MATLAB. Thrdly, three desgn specfcatons, closed-loop system stablty regon, feedback gan, dampng of the state varables, are all taken nto account n the controller desgn. Three desgn algorthms are presented to optmze one specfcaton when the other two specfcatons are gven. Fnally, our results are sutable for blnear systems wth polytopc uncertantes. Ths paper s organzed as follows. Secton 2 gves the problems statement. The stablty regon estmaton method controller desgn methods are presented n Sectons 3 4, respectvely. Two examples are gven n Secton 5 to llustrate our methods. Secton 6 concludes the paper. *ThsworkssupportednpartbytheRGCGrantHKU 73/P the Wllam Mong Post-doctoral Research Fellowshp
2 2. Problem Statement The followng notatons are used n ths paper. Ω denotes the boundary of a set Ω R n. e denotes the th stard bass of R n. (P ) denotes the element n the th column the th row of a matrx P. σ(a) denotes the spectrum of matrx A. For a real symmetrc matrx M, M >( ) means that M s postve (sem-)defnte. If not explctly stated, I denote the dentty matrx the zero matrx of approprate dmensons, respectvely. Besdes, all matrces are assumed to have compatble dmensons. Consder the blnear system S : ẋ = A(t)x + x N (t)u + B(t)u () where x(t) R n s the state vector, x (t) R s the -th element of x(t), u(t) R m s the control nput. Suppose the system under consderaton has polytopc uncertantes. That s, the system matrces belong to matrx polytopes A(t) Co {A,...,A na }, (2) B(t) Co {B,...,B nb }, (3) N (t) Co ª N,...,N nn,,...,n. (4) where Co denotes the convex hull. Consder a lnear state feedback u = Kx, the closed-loop system s S c : ẋ =[A(t)+B(t)K] x + x N (t)kx (5) The frst problem consdered n ths paper s to estmate the stablty regon of S c for a gven K. The second problem s to desgn K such that S c satsfes certan specfcatons. The specfcatons consdered n ths paper nclude the sze of the stablty regon, the dampng of the state varables, the magntude of the feedback gan. 3. Estmaton of Stablty Regon Snce there are uncertantes n system (5), we wll consder ts local quadratc stablty. Consder the Lyapunov functon V (x) =x T Px wth P>. The dervatve of V (x) along the trajectores of S c s V n o (x) = x T P [A(t)+B(t)K]+[A(t)+B(t)K] T P x à n T X +x T P x N (t)k + K T x N (t)! P x = x T {P [A(t)+B(t)K]+[A(t)+B(t)K] T P + x PN (t)k + K T N T (t)p }x. Defne a set Ω R n as follows. For any x R n, x Ω f only f P [A(t)+B(t)K]+[A(t)+B(t)K] T P + x PN (t)k + K T N T (t)p < for all A(t),B(t) N (t) ( =,...,n) that satsfy (2), (3), (4), respectvely, where x s the -th element of x. Further defne a set D R n as D = {x R n : V (x) <V } (6) where V =mn x Ω xt Px. From Lyapunov stablty theorem, D s contaned n the stablty regon of S c. The followng lemma gves a method to compute D for gven K P. Lemma Suppose K P>are gven, r R > s the soluton of LMI problem max r subject to P (A la + B lb K)+(A la + B lb K) T P p ³ +r (P ) PN ln K + K T Nl T N P < x j for all l A =,...,n A, l B =,...,n B, l N =,...,n N (7) ( =,...n), j =,...,2 n, where x j = hx j,...,xj n (j =,...,2 n ) are the 2 n vectors whose elements x j canonlytakethevalueof or, then an estmate of the stablty regon can be obtaned by D = x R n : x T Px < r 2ª. (8) Proof. For any r>, snce x = r p (P ) ( =,...,n) are tangental to the ellpsod x T Px = r 2, we consder the polyhedron q ¾ Ω r = x R n : x <r (P ), =,...,n (9) that contans the ellpsod x R n : x T Px < r 2ª.Snce Ω r s convex, P [A(t)+B(t)K]+[A(t)+B(t)K] T P + x PN (t)k + K T N T (t)p () < for all x n Ω r f only f () holds for all the 2 n vertces of Ω r,thats, P [A(t)+B(t)K]+[A(t)+B(t)K] T P +r x j p (P ) PN (t)k + K T N T (t)p <, () for all j =,...,2 n. Snce A(t),B(t) N (t) ( =,...,n) satsfy (2), (3) (4), () s further equvalent to (7). After the largest r that satsfes (7) s obtaned, from the fact about quadratc functons (see e.g. Lemma n T
3 [6]), the estmated stablty regon D can be computed by (6) where V = mn n V ¾ V = mn x T Px : x R n, x = r q(p ) ¾ = mn x T Px : x R n, e T x = r q(p ) r p (P ) 2 = e T P e = r 2. Generally speakng, t s not easy to solve the above optmzaton problem drectly. However, when p (P ) Hence (8) holds. The proof s completed. ( =,...,n) are fxed, the problem becomes a generalzed Now suppose K s gven, we consder the problem to egenvalue mnmzaton problem whch can be choose P such that D s the largest. The problem s to solved by the LMI toolbox. The followng teratve LMI choose P r satsfyng (7) such that D n (8) s the (ILMI) algorthm s provded. largest. Algorthm ESTIMATION: For any scalar α >, ˆP = αp mples ˆP = α r P ³ Step Choose a small tolerance scalar η >. Let P ˆP p = α (P ). Snce (7) s equvalent ε I R n n for a suffcently small ε ( > ε > ). q P to Step 2 Compute ( =,...,n). αp (A la + B lb K)+(A la + B lb K) T αp Step 3 Solve LMI problem + αr x j p α (P ) ³αPN ln K + K T Nl T mn λ subject to N αp < P I for all l A =,...,n A, l B =,...,n B, l N =,...,n N P P ( =,...n), j =,...,2 n, or equvalently, q P x j ³ ˆP (A la + B lb K)+(A la + B lb K) T PN ln K + K T Nl T N P ˆP h + ³ ³ αr xr j ˆP ˆPNlN K + < λ P (A KT Nl T la + B lb K) (A la + B lb K) T P, N ˆP <, for all l A =,...,n A,l B =,...,n B,l N =,...,n N ( =,...n), j =,...,2 n,obtanp λ. for all l A =,...,n A, l B =,...,n B, l N =,...,n N ( =,...n), j =,...,2 n. Hence ˆP kp Pk = αp ˆr = Step 4 If kp k < η, go to Step 6, else go to Step 5. αr also satsfy (7). Notce that D s kept unchanged Step 5 Let P = P, go to Step 2. when substtutng P r by ˆP ˆr, re- Step 6 The estmated stablty regon s gven by (3). spectvely. Wthout loss of generalty, we can suppose P I. In order to obtan a larger D, we can maxmze r (maxmze the largest ball contaned n D ). The Remark 2 TheLMIproblemnStep3sfeasbleprovded problem becomes that there exsts a P>such that max r subject to (7) P (A la + B lb K)+(A la + B lb K) T P< P I wth varables r P. Denote λ = r, then we have the followng theorem. Theorem Suppose P R n n > λ R > are the solutons of the followng optmzaton problem mn λ subject to P I, x j p ³ (P ) PN ln K + K T Nl T N P h (2) < λ P (A la + B lb K) (A la + B lb K) T P for all l A =,...,n A, l B =,...,n B,l N =,...,n N ( =,...n), j =,...,2 n, then an estmate of the closed-loop stablty regon s D = x R n : x T Px < λ ¾ 2, (3) whch contans the largest ball x R n : x T x< λ 2 ª. Remark Dependng on applcatons, we can also consder maxmzng the volume of D nstead of maxmzng the largest ball contaned n D a smlar result can be obtaned. for all l A =,...,n A l B =,...,n B (P can be chosen suffcently q small such that P P ). Snce P P P mples p (P ), the P λ obtaned n Step 3 satsfy (2). Moreover, once the LMI problem n Step 3 s feasble, t s also feasble for the next terate defned n Step 5 because at least the new P tself s a soluton. Furthermore, the postve defnte matrx sequences {P } wth P I obtaned n Algorthm ESTIMATION s non-decreasng (n the sense of postve sem-defnteness), the postve sequence {λ} obtaned n Algorthm ESTIMATION s non-ncreasng, thus {P } {λ} wll converge the algorthm wll converge.
4 4. Controller Desgn Now we consder the controller desgn problems. Three desgn specfcatons wll be consdered: closed-loop system stablty regon, feedback gan dampng of the state varables. Certanly, we want to desgn a controller to obtan a larger stablty regon, a better dampng of the state varables, a smaller feedback gan. However, a desgn should compromse the above three specfcatons. In ths secton, we wll consder the problems of optmzng one specfcaton when the other two specfcatons are gven. Frst consder the problem of maxmzng the stablty regon. Suppose a lnear feedback controller u = Kx should be desgned such that () for all l A =,...,n A l B =,...,n B,thereal parts of the egenvalues of A la + B lb K s less than δ for a gven δ >, thats,σ (A la + B lb K) C δ where C δ = {s C :Re(s) < δ } s a subset of the complex plane; () the feedback gan s constraned by KK T k I for agvenk >. From Theorem, the problem of obtanng the largest stablty regon can be stated as mn λ subject to x j p ³ (P ) PN ln K + K T Nl T N P h < λ P (A la + B lb K) (A la + B lb K) T P, for all l A =,...,n A, l B =,...,n B,l N =,...,n N ( =,...n), j =,...,2 n, P (A la + B lb K)+(A la + B lb K) T P +2δ P<, (4) for all l A =,...,n A l B =,...,n B, KK T k I, P I where (4) mples that σ (A la + B lb K) C δ, for all l A =,...,n A l B =,...,n B. In the above problem, varables are K, P λ. Denote P = P, the problem s converted nto mn λ subject to ³ xr j P ³N ln K P + PK T N T ln h < λ (A la + B lb K) P P (A la + B lb K) T, for all l A =,...,n A, l B =,...,n B,l N =,...,n N ( =,...n), j =,...,2 n, (A la + B lb K) P + P (A la + B lb K) T +2δ P <, for all l A =,...,n A l B =,...,n B, KK T k I, P I. Further denote W = K P, then K = W P. Snce P I, the constrant KK T k I can be substtuted by WW T k I. Hence the followng theorem holds. Theorem 2 Suppose P R n n >,W R m n λ R are the solutons of the followng optmzaton problem mn λ subject to ³ xr j P ³N ln W + W T N T ln < λ h A la P T PAlA B lb W W T B T, lb for all l A =,...,n A, l B =,...,n B,l N =,...,n N ( =,...n), j =,...,2 n, A la P + T PA la + B lb W + W T Bl T B +2δ P <, (5) for all l A =,...,n A l B =,...,n B, k I W W T (6) I P I (7) then the controller whch can obtan the largest closedloop system stablty regon s u = Kx = W P x. (8) Moreover, an estmate of the closed-loop system stablty regon s D = x R n : x T P x< λ ¾ 2, (9) whch contans the ball x R n : x T x< λ 2 ª. The optmzaton problem n Theorem 2 can be solved usng the followng algorthm, whch s smlar to Algorthm ESTIMATION. Algorthm DESIGN: Step Choose a small tolerance scalar η >. Let P = ρ I R n n for a suffcently large ρ >. r ³ Step 2 Compute P ( =,...,n). Step 3 Solve LMI problem mn λ subject to (5), (6), (7) r ³ P ³N ln W + W T N T ln x j < λ h A la P T PAlA B lb W W T B T, lb for all l A =,...,n A,l B =,...,n B,l N =,...,n N ( =,...n), j =,...,2 n, P P to obtan P,W λ. Step 4 If k P P k k P < η, go to Step 6, else go to Step 5. k Step 5 Let P = P, go to Step 2. Step 6 The controller the estmated stablty regon are obtaned by (8) (9). Smlar to Theorem 2, when consderng the problems of maxmzng the dampng rate of the state varables mnmzng the feedback gan, the followng results
5 hold. Theorem 3 Among all the controllers satsfyng KK T k I n such that the closed-loop o stablty regon contans x R n : x T x<, the controller n (8) has the maxmal dampng rate of the state varables, λ 2 σ (A la + B lb K) C δ for all l A =,...,n A l B =,...,n B,where P R n n >,W R m n δ R > are the solutons of the followng optmzaton problem mn δ subject to ³ xr j P ³N ln W + W T N T ln h < λ A la P T PAlA B lb W W T Bl T B, for all l A =,...,n A, l B =,...,n B, l N =,...,n N ( =,...n), j =,...,2 n, 2 P < δ ³ A la P T PA la B lb W W T BlB T, for all l A =,...,n A l B =,...,n B, k I W W T, I P I. Theorem 4 Among all the controllers satsfyng σ (A la + B lb K) C δ for all l A =,...,n A l B =,...,n B, such that the closed-loop stablty regon contans x R n : x T x< ¾ λ 2, the controller n (8) has the smallest feedback gan, KK T ki, where P R n n >,W R m n k R > are the solutons of the followng optmzaton problem mn k subject to ³ xr j P ³N ln W + W T N T ln h < λ A la P T PAlA B lb W W T Bl T B, for all l A =,...,n A, l B =,...,n B, l N =,...,n N ( =,...n), j =,...,2 n, A la P + T PA la + B lb W + W T Bl T B +2δ P <, for all l A =,...,n A l B =,...,n B, ki W W T, I P I. r ³ Remark 3 When P ( =,...,n) are fxed, the optmzaton problems n Theorems 3 4 become a generalzed egenvalue mnmzaton problem a mnmzaton of a lnear objectve under LMI constrants, respectvely, whch can be solved by the LMI toolbox n MATLAB. Hence, two ILMI algorthms smlar to Algorthm DESIGN can be establshed to desgn a controller such that a better dampng of state varables or a smaller feedback gan can be obtaned. 5. Examples 5. Example Consder the example used n [3]. The system s expressed by () where A(t) =A, B(t) =B, N (t) =N,N 2 (t) =N 2 A = 5 2,B=,N = 2,N 2 = We frst estmate the closed-loop stablty regon for the followng three controllers gven by [3]: K =[ 3.9,.4],K 2 =[ 4.35,.44],K 3 =[2.87,.47]. Usng Algorthm ESTIMATION, we obtan the followng stablty regon estmates: D = D 2 = D 3 = x R n : x T x R n : x T x R n : x T ¾ x<.69, ¾ x<.627, ¾ x<.59 respectvely. The regons are compared wth those obtaned n [3] n the three fgures. Itcanbeseenthatour estmates are much better than those n [3]. 5.2 Example 2 Consder an open-loop unstable system wth two-dmensonal controlnput(examplen[]). Thesystemsexpressed by () where A(t) =Co {A,A 2 },B(t) =B, N (t) =N,N 2 (t) =N 2 A = 6,A 2 = 2, B =,N 2 2 =,N =. 4 We consder the controller desgn problems. For δ = k =5, usng Algorthm DESIGN we obtan λ =.323 the controller u = K x = x, the estmaton of stablty regon s ¾ D = x R n : x T x< For λ = k =5,usngTheorem3anILMI.
6 algorthm, we obtan δ =.9632 the controller u = K x = x For λ = δ =,usngtheorem4anilmi algorthm, we obtan k = the controller u = K x = x The results are summarzed n the followng table. controller λ λ δ k K K K Concluson Ths paper studed the stablty regon estmaton lnear controller desgn problems for uncertan blnear systems. Iteratve lnear matrx nequalty (ILMI) algorthms were presented to estmate the stablty regon desgn the controllers. Three closed-loop specfcatons, closed-loop system stablty regon, feedback gan dampng of the state varables were consdered n the controller desgn problems. The controllers desgned are such that one specfcaton s enhanced whle the other two specfcatons are constraned at a certan level. Examples show that our stablty regon estmaton method s less conservatve than that n [3], our controller desgn methods are more effectve. References [] A. Benallou, D. A. Mellchamp, D. E. Seborg. Optmal stablzng controllers for blnear systems. Int. J. Control, 48(4):487 5, 988. [2] M. S. Chen S. T. Tsao. Exponental stablzaton of a class of unstable blnear systems. IEEE Transactons on Automatc Control, 45(5): , 2. [3] I. Derese E. Noldus. Desgn of lnear feedback laws for blnear systems. Int. J. Control, 3(2):29 237, 98. [4] I. Derese E. Noldus. Optmzaton of blnear control systems. Int. J. Systems Scence, 3(3): , 982. [5] P. O. Gutman. Stablzng controllers for blnear systems. IEEE Transactons on Automatc Control, 26(4):97 922, 98. [6] H. Hnd S. Boyd. Analyss of lnear systems wth saturaton usng convex optmzaton. In Proc. of the 37th IEEE Conference on Decson Control, pages 93 98, Tampa, 998. [7] R. Longchamp. Controller desgn for blnear systems. IEEE Transactons on Automatc Control, 25(3): , 98. [8] R.R.Mohler.Nonlnear Systems,volume2.Prentce- Hall, Inc., Englewood Clffs, N.J., 99. [9] C. D. Rahn. Stablzablty condtons for strctly blnear systems wth purely magnary spectra. IEEE Transactons on Automatc Control, 4(9): , 996. [] H. D. Tuan S. Hosoe. On robust H controls for a class of lnear blnear systems wth nonlnear uncertanty. Automatca, 33(7): , ths paper [DN8] K =[ 3.9,.4] ths paper [DN8] K 2 =[ 4.35,.44] ths paper [DN8] K 3 =[2.87,.47]
LocalReliableControlforLinearSystems with Saturating Actuators
LocalRelableControlforLnearSystems wth Saturatng Actuators Shoudong Huang James Lam Bng Chen Dept. of Engneerng Dept. of Mechancal Engneerng Dept. of Mathematcs Australan Natonal Unversty Unversty of Hong
More informationU.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 informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationRobust observed-state feedback design. for discrete-time systems rational in the uncertainties
Robust observed-state feedback desgn for dscrete-tme systems ratonal n the uncertantes Dmtr Peaucelle Yosho Ebhara & Yohe Hosoe Semnar at Kolloquum Technsche Kybernetk, May 10, 016 Unversty of Stuttgart
More informationTHE GUARANTEED COST CONTROL FOR UNCERTAIN LARGE SCALE INTERCONNECTED SYSTEMS
Copyrght 22 IFAC 5th rennal World Congress, Barcelona, Span HE GUARANEED COS CONROL FOR UNCERAIN LARGE SCALE INERCONNECED SYSEMS Hroak Mukadan Yasuyuk akato Yoshyuk anaka Koch Mzukam Faculty of Informaton
More informationYong 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 informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationThe 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 informationAPPENDIX 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 informationStability and Stabilization for Discrete Systems with Time-varying Delays Based on the Average Dwell-time Method
Proceedngs of the 29 IEEE Internatonal Conference on Systems, an, and Cybernetcs San Antono, TX, USA - October 29 Stablty and Stablzaton for Dscrete Systems wth Tme-varyng Delays Based on the Average Dwell-tme
More informationSolutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.
Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationThe 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 informationLecture 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 informationStability Analysis and Anti-windup Design of Switched Systems with Actuator Saturation
Internatonal Journal of Automaton and Computng 14(5), October 2017, 615-625 DOI: 101007/s11633-015-0920-z Stablty Analyss and Ant-wndup Desgn of Swtched Systems wth Actuator Saturaton Xn-Quan Zhang 1 Xao-Yn
More informationIntroduction. - The Second Lyapunov Method. - The First Lyapunov Method
Stablty Analyss A. Khak Sedgh Control Systems Group Faculty of Electrcal and Computer Engneerng K. N. Toos Unversty of Technology February 2009 1 Introducton Stablty s the most promnent characterstc of
More informationDecentralized robust control design using LMI
Acta Montanstca Slovaca Ročník 3 (28) číslo -4 Decentralzed robust control desgn usng LMI Anna Flasová and Dušan Krokavec ávrh robustného decentralzovaného radena pomocou LMI he paper deals wth applcaton
More informationA 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 informationLecture 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 informationAssortment 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 informationChapter 2 A Class of Robust Solution for Linear Bilevel Programming
Chapter 2 A Class of Robust Soluton for Lnear Blevel Programmng Bo Lu, Bo L and Yan L Abstract Under the way of the centralzed decson-makng, the lnear b-level programmng (BLP) whose coeffcents are supposed
More informationFeature 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 informationGeneral 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 informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More information8.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 informationThe equation of motion of a dynamical system is given by a set of differential equations. That is (1)
Dynamcal Systems Many engneerng and natural systems are dynamcal systems. For example a pendulum s a dynamcal system. State l The state of the dynamcal system specfes t condtons. For a pendulum n the absence
More informationMaximizing 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 informationLectures - 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 informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationAffine 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 informationSELECTED SOLUTIONS, SECTION (Weak duality) Prove that the primal and dual values p and d defined by equations (4.3.2) and (4.3.3) satisfy p d.
SELECTED SOLUTIONS, SECTION 4.3 1. Weak dualty Prove that the prmal and dual values p and d defned by equatons 4.3. and 4.3.3 satsfy p d. We consder an optmzaton problem of the form The Lagrangan for ths
More informationBOUNDEDNESS 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 informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationInexact 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 informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationRobust control for uncertain linear systems with State and Control Constraints
Proceedngs of the 17th World Congress The Internatonal Federaton of Automatc Control Robust control for uncertan lnear systems wth State and Control Constrants Hassan AYAD Fouad MESUINE Mustapha AIT RAMI
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationModule 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 information10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)
0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes
More informationSTAT 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 informationLecture 17: Lee-Sidford Barrier
CSE 599: Interplay between Convex Optmzaton and Geometry Wnter 2018 Lecturer: Yn Tat Lee Lecture 17: Lee-Sdford Barrer Dsclamer: Please tell me any mstake you notced. In ths lecture, we talk about the
More informationPerron 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 informationOn the Global Linear Convergence of the ADMM with Multi-Block Variables
On the Global Lnear Convergence of the ADMM wth Mult-Block Varables Tany Ln Shqan Ma Shuzhong Zhang May 31, 01 Abstract The alternatng drecton method of multplers ADMM has been wdely used for solvng structured
More informationResearch Article Global Sufficient Optimality Conditions for a Special Cubic Minimization Problem
Mathematcal Problems n Engneerng Volume 2012, Artcle ID 871741, 16 pages do:10.1155/2012/871741 Research Artcle Global Suffcent Optmalty Condtons for a Specal Cubc Mnmzaton Problem Xaome Zhang, 1 Yanjun
More informationCSci 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 informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationEstimation: Part 2. Chapter GREG estimation
Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the
More informationChapter 7 Generalized and Weighted Least Squares Estimation. In this method, the deviation between the observed and expected values of
Chapter 7 Generalzed and Weghted Least Squares Estmaton The usual lnear regresson model assumes that all the random error components are dentcally and ndependently dstrbuted wth constant varance. When
More informationChapter 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 informationStability analysis for class of switched nonlinear systems
Stablty analyss for class of swtched nonlnear systems The MIT Faculty has made ths artcle openly avalable. Please share how ths access benefts you. Your story matters. Ctaton As Publshed Publsher Shaker,
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationSolving the Quadratic Eigenvalue Complementarity Problem by DC Programming
Solvng the Quadratc Egenvalue Complementarty Problem by DC Programmng Y-Shua Nu 1, Joaqum Júdce, Le Th Hoa An 3 and Pham Dnh Tao 4 1 Shangha JaoTong Unversty, Maths Departement and SJTU-Parstech, Chna
More informationMODE-INDEPENDENT GUARANTEED COST CONTROL OF SINGULAR MARKOVIAN DELAY JUMP SYSTEMS WITH SWITCHING PROBABILITY RATE DESIGN
Internatonal Journal of Innovatve Computng, Informaton and Control ICIC Internatonal c 214 ISSN 1349-4198 Volume 1, Number 4, August 214 pp. 1291 133 MODE-INDEPENDENT GUARANTEED COST CONTROL OF SINGULAR
More informationAppendix 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 informationInner 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 informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationAdaptive sliding mode reliable excitation control design for power systems
Acta Technca 6, No. 3B/17, 593 6 c 17 Insttute of Thermomechancs CAS, v.v.. Adaptve sldng mode relable exctaton control desgn for power systems Xuetng Lu 1, 3, Yanchao Yan Abstract. In ths paper, the problem
More informationConvexity 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 informationON 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 informationA RELAXED SUFFICIENT CONDITION FOR ROBUST STABILITY OF AFFINE SYSTEMS
Доклади на Българската академия на науките Comptes rendus de l Académe bulgare des Scences Tome 60 No 9 2007 SCIENCES ET INGENIERIE Théore des systèmes A RELAXED SUFFICIENT CONDITION FOR ROBUST STABILITY
More informationLecture 10: May 6, 2013
TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,
More informationTransition Probability Bounds for the Stochastic Stability Robustness of Continuous- and Discrete-Time Markovian Jump Linear Systems
Transton Probablty Bounds for the Stochastc Stablty Robustness of Contnuous- and Dscrete-Tme Markovan Jump Lnear Systems Mehmet Karan, Peng Sh, and C Yalçın Kaya June 17, 2006 Abstract Ths paper consders
More informationCOS 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 informationEstimating the Fundamental Matrix by Transforming Image Points in Projective Space 1
Estmatng the Fundamental Matrx by Transformng Image Ponts n Projectve Space 1 Zhengyou Zhang and Charles Loop Mcrosoft Research, One Mcrosoft Way, Redmond, WA 98052, USA E-mal: fzhang,cloopg@mcrosoft.com
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationStabilization and Performance Analysis for a Class of Switched Systems
43rd IEEE Conference on Decson and Control December 14-17, 2004 Atlants, Paradse Island, Bahamas ThB02.6 Stablzaton and Performance Analyss for a Class of Swtched Systems Le Fang, Ha Ln, and Panos J. Antsakls
More informationA NOVEL DESIGN APPROACH FOR MULTIVARIABLE QUANTITATIVE FEEDBACK DESIGN WITH TRACKING ERROR SPECIFICATIONS
A OVEL DESIG APPROACH FOR MULTIVARIABLE QUATITATIVE FEEDBACK DESIG WITH TRACKIG ERROR SPECIFICATIOS Seyyed Mohammad Mahd Alav, Al Khak-Sedgh, Batool Labb Department of Electronc and Computer Engneerng,
More informationErrors 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 informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationLinear 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 informationCanonical 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 informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationLecture 10 Support Vector Machines. Oct
Lecture 10 Support Vector Machnes Oct - 20-2008 Lnear Separators Whch of the lnear separators s optmal? Concept of Margn Recall that n Perceptron, we learned that the convergence rate of the Perceptron
More informationOutput Feedback Stabilization of Networked Control Systems With Packet Dropouts
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 52, NO. 9, SEPTEMBER 2007 705 Output Feedback Stablzaton of Networked Control Systems Wth Packet Dropouts Wen-An Zhang and L Yu Abstract In ths paper, we dscuss
More informatione - c o m p a n i o n
OPERATIONS RESEARCH http://dxdoorg/0287/opre007ec e - c o m p a n o n ONLY AVAILABLE IN ELECTRONIC FORM 202 INFORMS Electronc Companon Generalzed Quantty Competton for Multple Products and Loss of Effcency
More informationMATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)
1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationSEMI-GLOBAL EXPONENTIAL STABILIZATION OF LINEAR SYSTEMS SUBJECT TO \INPUT SATURATION" VIA LINEAR FEEDBACKS. Zongli Lin & Ali Saberi
Appeared n Systems & Control Letters, vol 1, pp-9, 199 SEMI-GLOBAL EXPONENTIAL STABILIZATION OF LINEAR SYSTEMS SUBJECT TO \INPUT SATURATION" VIA LINEAR FEEDBACKS Zongl Ln & Al Saber School of Electrcal
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationCollege 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 informationFinite Element Modelling of truss/cable structures
Pet Schreurs Endhoven Unversty of echnology Department of Mechancal Engneerng Materals echnology November 3, 214 Fnte Element Modellng of truss/cable structures 1 Fnte Element Analyss of prestressed structures
More informationMore 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 informationNumerical 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 informationBé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 informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More informationApplication of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems
Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &
More informationOn the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros
Appled Mathematcal Scences, Vol. 5, 2011, no. 75, 3693-3706 On the Interval Zoro Symmetrc Sngle-step Procedure for Smultaneous Fndng of Polynomal Zeros S. F. M. Rusl, M. Mons, M. A. Hassan and W. J. Leong
More informationPower law and dimension of the maximum value for belief distribution with the max Deng entropy
Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationSupplement: 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 informationCRITICAL POINT ANALYSIS OF JOINT DIAGONALIZATION CRITERIA. Gen Hori and Jonathan H. Manton
CRITICAL POINT ANALYSIS OF JOINT DIAGONALIZATION CRITERIA Gen Hor and Jonathan H Manton Bran Scence Insttute, RIKEN, Satama 351-0198, Japan hor@bspbranrkengojp Department of Electrcal and Electronc Engneerng,
More informationCHALMERS, GÖTEBORGS UNIVERSITET. SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS. COURSE CODES: FFR 135, FIM 720 GU, PhD
CHALMERS, GÖTEBORGS UNIVERSITET SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS COURSE CODES: FFR 35, FIM 72 GU, PhD Tme: Place: Teachers: Allowed materal: Not allowed: January 2, 28, at 8 3 2 3 SB
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationImproved delay-dependent stability criteria for discrete-time stochastic neural networks with time-varying delays
Avalable onlne at www.scencedrect.com Proceda Engneerng 5 ( 4456 446 Improved delay-dependent stablty crtera for dscrete-tme stochastc neural networs wth tme-varyng delays Meng-zhuo Luo a Shou-mng Zhong
More informationMEM Chapter 4b. LMI Lab commands
1 MEM8-7 Chapter 4b LMI Lab commands setlms lmvar lmterm getlms lmedt lmnbr matnbr lmnfo feasp dec2mat evallm showlm setmvar mat2dec mncx dellm delmvar gevp 2 Intalzng the LMI System he descrpton of an
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More information