Research Article Global Sufficient Optimality Conditions for a Special Cubic Minimization Problem
|
|
- Willa Murphy
- 5 years ago
- Views:
Transcription
1 Mathematcal Problems n Engneerng Volume 2012, Artcle ID , 16 pages do: /2012/ Research Artcle Global Suffcent Optmalty Condtons for a Specal Cubc Mnmzaton Problem Xaome Zhang, 1 Yanjun Wang, 1 and Wemn Ma 2 1 Department of Appled Mathematcs, Shangha Unversty of Fnance and Economcs, Shangha , Chna 2 School of Economcs and Management, Tongj Unversty, Shangha , Chna Correspondence should be addressed to Wemn Ma, mawm@tongj.edu.cn Receved 9 February 2012; Accepted 11 June 2012 Academc Edtor: Janmng Sh Copyrght q 2012 Xaome Zhang et al. Ths s an open access artcle dstrbuted under the Creatve Commons Attrbuton Lcense, whch permts unrestrcted use, dstrbuton, and reproducton n any medum, provded the orgnal work s properly cted. We present some suffcent global optmalty condtons for a specal cubc mnmzaton problem wth box constrants or bnary constrants by extendng the global subdfferental approach proposed by V. Jeyakumar et al The present condtons generalze the results developed n the work of V. Jeyakumar et al. where a quadratc mnmzaton problem wth box constrants or bnary constrants was consdered. In addton, a specal dagonal matrx s constructed, whch s used to provde a convenent method for justfyng the proposed suffcent condtons. Then, the reformulaton of the suffcent condtons follows. It s worth notng that ths reformulaton s also applcable to the quadratc mnmzaton problem wth box or bnary constrants consdered n the works of V. Jeyakumar et al and Y. Wang et al Fnally some examples demonstrate that our optmalty condtons can effectvely be used for dentfyng global mnmzers of the certan nonconvex cubc mnmzaton problem. 1. Introducton Consder the followng cubc mnmzaton problem wth box constrants: mn f x b T x xt Ax a T x, n s.t. x D u,v, CP1 where u,v R, u v, 1, 2,...,n,anda a 1,...,a n T R n,b b 1,...,b n T R n, A S n, where S n s the set of all symmetrc n n matrces. x 3 that means x 3 1,...,x3 n T.
2 2 Mathematcal Problems n Engneerng The cubc optmzaton problem has spawned a varety of applcatons, especally n cubc polynomal approxmaton optmzaton 1, convex optmzaton 2, engneerng desgn, and structural optmzaton 3. Moreover, research results about cubc optmzaton problem can be appled to quadratc programmng problems, whch have been wdely studed because of ther broad applcatons, to enrch quadratc programmng theory. Several general approaches can be used to establsh optmalty condtons for solutons to optmzaton problems. These approaches can be broadly classfed nto three groups: convex dualty theory 4, local subdfferentals by lnear functons 5 7, and global L- subdfferental and L-normal cone by quadratc functons The thrd approach, whch we extend n ths paper, s often adopted to develop optmalty condtons for specal optmzaton forms: quadratc mnmzatons wth box or bnary constrants, quadratc mnmzaton wth quadratc constrants, bvalent quadratc mnmzaton wth nequalty constrants, and so forth. In ths paper, we consder the cubc mnmzaton problem, whch generalzes the quadratc functons frequently consdered n the mentoned papers. The proof method s based on extendng the global L-subdfferentals by quadratc functons 8, 12 to cubc functons. We show how an L-subdfferental can be explctly calculated for cubc functons and then develop the global suffcent optmalty condtons for CP1. We also derve the global optmalty condtons for specal cubc mnmzaton problems wth bnary constrants. But when we use the suffcent condtons, we have to determne whether a dagonal matrx Q exsts. It s hard to dentfy whether the matrx Q exsts. So we rewrte the suffcent condtons n an other way through constructng a certan dagonal matrx. Ths method s applcable to the quadratc mnmzaton problem wth box or bnary constrants consdered n 8, 12. Ths paper s organzed as follows. Secton 2 presents the notons of L-subdfferentals and develops the suffcent global optmalty condton for CP1. The global optmalty condton for specal cubc mnmzaton wth bnary constrants s presented n Secton 3. In Secton 4, numercal examples s gven to llustrate the effectveness of the proposed global optmalty condtons. 2. L-Subdfferentals and Suffcent Condtons In ths secton, basc defntons and notatons that wll be used throughout the paper are gven. The real lne s denoted by R and the n-dmensonal Eucldean space s denoted by R n. For vectors x, y R n, x y means that x y,for 1,...,n. A B means that the matrx A B s a postve semdefnte. A dagonal matrx wth dagonal elements α 1,...,α n s denoted by dag α 1,...,α n.letl be a set of real-valued functons defned on R n. Defnton 2.1 L-subdfferentals 13. LetL be a set of real-valued functons. Let f : R n R. An element l L s called an L-subgradent of f at a pont x 0 R n f f x f x 0 l x l x 0, x R n. 2.1 x 0. The set L f x of all L-subgradents of f at x 0 s referred to as L-subdfferental of f at Throughout the rest of the paper, we use the specfc choce of L defned by L {b T x 3 12 } xt Qx β T x Q dag α 1,...,α n,α R, β R n. 2.2
3 Mathematcal Problems n Engneerng 3 Proposton 2.2. Let f x b T x 3 1/2 x T Ax a T x and x x 1,...,x n T R n.then { L f x b T x xt Qx β T x A Q 0, Q dag α 1,...,α n β AQ x a, α R }. 2.3 Proof. Suppose that there exsts a dagonal matrx Q dag α 1,...,α n, such that A Q 0. Let l x b T x xt Qx β T x, β A Q x a. 2.4 Then t suffces to prove that l x L f x.let φ x f x l x 1 2 xt A Q x ( a β ) T x. 2.5 Snce 2 φ x A Q 0, for all x R n, we know that φ x s a convex functon on R n.note that φ x A Q x a β 0, and so x s a global mnmzer of φ x,thats,φ x φ x, for all x R n. Ths means that l x L f x. Next we prove the converse. Let l x L f x, l x b T x 3 1/2 x T Qx β T x. By defnton, f x f x l x l x, x R n. 2.6 Hence φ x f x l x 1 2 xt A Q x ( a β ) T x f x l x, x R n. 2.7 Thus, x s a global mnmzer of φ x. So, φ x 0and 2 φ x 0, that s, A Q 0, A Q x ( a β ) 0, 2.8 hence β A Q x a. For x x 1,...,x n T D, defne 1 f x u, x 1 f x v, Ax a f x u,v. 2.9 X dag x 1,..., x n.
4 4 Mathematcal Problems n Engneerng For Q dag α 1,...,α n,α R, 1,...,n, defne α mn{0,α }, Q dag α 1,..., α n By Proposton 2.2, we obtan the followng suffcent global optmalty condton for CP1. Theorem 2.3. For CP1, letx x 1,...,x n T D and u u 1,...,u n T,v v 1,...,v n T. Suppose that there exsts a dagonal matrx Q dag α 1,...,α n,α R, 1,...,n, such that A Q 0, and for all x D, b x x 0, 1,...,n. If X Ax a 1 2 Q v u 0, 2.11 then x s a global mnmzer of problem CP1. Proof. Suppose that condton 2.11 holds. Let l x b T x xt Qx β T x, β A Q x a Then, by Proposton 2.2, l x L f x, thats, f x f x l x l x, x R n Obvously f l x l x 0 for each x D, then x s a global mnmzer of CP1. Note that l x l x n α 2 x x 2 Ax a T x x b T( x 3 x 3) If each term n the rght sde of the above equaton satsfes α ( ) 2 x x 2 Ax a x x b x 3 x3 0, 1,...,n, x u,v, 2.15 then, from 2.14, t holds that l x l x 0. So x s a global mnmzer of l x over box constrants. On the other hand, suppose that x s a global mnmzer of l x, x D. Then t holds that l x l x n α 2 x x 2 Ax a T x x b T( x 3 x 3) 0, x D. 2.16
5 Mathematcal Problems n Engneerng 5 When x s chosen as a specal pont x D as follows: x x 1, x 2,...,x 1,x, x,...,x n, x u,v,x / x, 1,...,n, 2.17 we stll have l x l x α 2 x x 2 Ax a T x x b T( x 3 x 3) 0, 1,...,n Ths means that f x s a global mnmzer of l x over box constrants. Then 2.15 holds. Combnng the above dscusson, we can conclude that x s a global mnmzer of l x over box constrants f and only f 2.15 holds. So next, we just need to prove 2.15 n order to show that x s a global mnmzer of l x. We frst see from 2.11, for each 1,...,n,that α 2 v u x Ax a Snce α 0, then for each x u,v, 1,...,n, α 2 x u x Ax a 0, 2.20 and α 2 x v x Ax a For each 1,...,n, we consder the followng three cases. Case 1. If x u,v, then x Ax a.by 2.20, α 2 x u Ax a So, α 0and Ax a 0, and then α ( ) 2 x x 2 Ax a x x b x 3 x3 α ( ) 2 x x 2 b x 3 x3 ( ) b x x x 2 x x x
6 6 Mathematcal Problems n Engneerng Case 2. If x u, then x 1. By 2.20, α 2 x u Ax a So we have α ( ) 2 x x 2 Ax a x x b x 3 x3 α ) 2 x u 2 Ax a x u b (x 3 u3 { α ( ) 2 x u Ax a } x u b x 3 u Case 3. If x v, then x 1.By 2.21, α 2 x v Ax a Then α ( ) 2 x x 2 Ax a x x b x 3 x3 α ) 2 x v 2 Ax a x v b (x 3 v So, f condton 2.11 holds, then 2.15 holds. And, from 2.14, we can conclude that x s a global mnmzer of CP1. Theorem 2.3 shows that the exstence of dagonal matrx Q plays a crucal role because f ths dagonal matrx Q does not exst, then we have no way to use ths theorem. If the dagonal matrx Q exsts, then the key problem s how to fnd t. These questons also exst n 8, 12. The followng corollary wll answer the questons above. Corollary 2.4. For CP1, letx D. Assume that, for all x D, t holds that b x x 0 1,...,n. Then one has the followng concluson. 1 When A s a postve semdefnte matrx, f X Ax a 0, 2.28 then x s a global mnmzer of CP1.
7 Mathematcal Problems n Engneerng 7 2 When A s not a postve semdefnte matrx, f there exsts an ndex 0, 1 0 n, such that x 0 Ax a 0 > 0, 2.29 then there s no such dagonal matrx Q that meets the requrements of the Theorem Let α 2 x Ax a, 1,...,n, v u Q dag α 1,...,α n When A s not a postve semdefnte matrx and the condton X Ax a 0 holds, f A Q 0 holds, then x s a global mnmzer of CP1. Otherwse, one can conclude that there s no such dagonal matrx Q that meets the requrements of the Theorem 2.3. Proof. 1 Suppose that A 0 and the condton X Ax a 0 holds. Choosng Q Q 0, by Theorem 2.3, we can conclude that x s a global mnmzer of CP1. 2 When A s not a postve semdefnte matrx, f there exsts an ndex 0, 1 0 n, such that x 0 Ax a 0 > 0, 2.31 then 2 x 0 Ax a 0 v 0 u 0 > Suppose there exsts a dagonal matrx Q that meets all condtons n Theorem 2.3. Condton 2.11 can be rewrtten n the followng form: x Ax a 1 2 α v u 0, 1,...,n Then t follows that α 2 x Ax a v u, 1,...,n For the ndex 0, we stll have the followng nequalty: α 0 2 x 0 Ax a 0 v 0 u 0 > Ths conflcts wth the fact that α mn{0,α } 0, 1,...,n.
8 8 Mathematcal Problems n Engneerng 3 Next we wll consder the case that A s not a postve semdefnte matrx, and condton X Ax a 0 holds. We construct a dagonal matrx Q dag α 1,...,α n where α 2 x Ax a / v u, 1,...,n,andA Q 0. Then t suffces to show that condton 2.11 n Theorem 2.3 hold. Note that x Ax a 0, 1,...,n, and then α 2 x Ax a v u 0, 1,...,n Snce α 0, we have α α.so α 2 x Ax a v u 0, 1,...,n Rewrtng the above nequalty, we have x Ax a 1 2 α v u 0, 1,...,n Apparently ths means that the constructed dagonal matrx Q also satsfes condton Accordng to Theorem 2.3, we can conclude that x s a global mnmzer of CP1. If the constructed dagonal matrx Q does not meet the condton A Q 0, then we can conclude that there s no such dagonal matrx Q that can meet the requrements of Theorem 2.3. To show ths, suppose that there exsts a dagonal matrx Q dag α 1,...,α n, whch satsfes A Q 0and From 2.11, we have 0 α 2 x Ax a v u α, 1,...,n Obvously f A Q 0, then there must exst a dagonal matrx Q dag α 1,...,α n such that A Q 0. Ths conflcts the assumpton. We now consder a specal case of CP1 : mn s.t. f x n n b x 3 r n 2 x2 a x n x D u,v, CP2 where u,v,a,b,r R and u v, 1, 2,...,n.
9 Mathematcal Problems n Engneerng 9 Corollary 2.5. For CP2,letx D. If, for each 1,...,n, x r x a 1 2 r v u 0, b x x 0, 2.40 then x s a global mnmzer of CP2, where r mn{0,r }. Proof. For CP2, choose Q A dag r 1,...,r n.if 2.40 holds, then, by Theorem 2.3, x s a global mnmzer of CP2. 3. Suffcent Condtons of Bvalent Programmng In ths secton, we wll consder the followng bvalent programmng: mn s.t. f x b T x xt Ax a T x n x D B {u,v }, CP3 where A, a, b,andu, v, 1,...,nare the same as n CP1. Smlar to Theorem 2.3, we wll obtan the global suffcent optmalty condtons for CP3. Theorem 3.1. For CP3, letx x 1,...,x n T D B. Suppose that there exsts a dagonal matrx Q dag α 1,...,α n,α R, 1,...,nsuch that A Q 0, and for all x D B, b x x 0 1,...,n.If X Ax a 1 Q v u 0, then x s a global mnmzer of problem CP3. Proof. Suppose that condton 3.1 holds. Let l x b T x xt Qx β T x, β A Q x a. 3.2 Then f x f x l x l x, x R n. 3.3 Obvously f l x l x 0 for each x D B, then x s a global mnmzer of CP3.
10 10 Mathematcal Problems n Engneerng Note that l x l x n α 2 x x 2 Ax a T x x b T( x 3 x 3). 3.4 Thus, x s a global mnmzer of l x wth bnary constrants f and only f, for each 1,...,n, x {u,v }, α ( ) 2 x x 2 Ax a x x b x 3 x Frstly, we note from 3.1, for each 1,...,n,that Next we only show t from the followng two cases. Case 1. If x u, then 3.6 s equvalent to α 2 v u x Ax a α 2 v u Ax a It s obvous that, for each x {u,v }, α ) 2 x u 2 b (x 3 u3 Ax a x u So 3.5 holds. Case 2. If x v, then 3.6 s equvalent to α 2 v u Ax a It s obvous that, for each x {u,v }, α ) 2 v x 2 b (v 3 x 3 Ax a v x So 3.5 holds. From 3.5, we can conclude that x s a global mnmzer of problem CP3 Smlar to Corollary 2.4, we have the followng corollary. Corollary 3.2. For CP3,letx D B. Suppose that, for all x D B, b x x 0 1,...,n. (1) When A s a postve semdefnte matrx, f X Ax a 0, 3.11 then x s a global mnmzer of CP3.
11 Mathematcal Problems n Engneerng 11 (2) Let α 2 x Ax a, 1,...,n, v u Q dag α 1,...,α n When A s not a postve semdefnte matrx, f A Q 0 holds, then x s a global mnmzer of CP3. Otherwse, one can conclude that there s no such dagonal matrx Q that meets the requrements of Theorem 3.1. We just show the proof of 2. Proof. We construct the dagonal matrx Q dag α 1,...,α n, where α 2 x Ax a / v u, 1,...,n.IfA Q 0, we just need to test condton 3.1. Because then rewrtng the above equatons, we have α 2 x Ax a v u, 1,...,n, 3.13 x Ax a 1 2 α v u 0, 1,...,n It obvously means that the dagonal matrx Q also satsfes condton 3.1. Accordng to Theorem 3.1, x s a global mnmzer of CP3. Note that there s dfference between formula 3.1 and formula In formula 3.1, the dagonal elements α of a dagonal matrx Q are allowed to be postve or nonpostve. But n formula 2.11, the dagonal elements α of a dagonal matrx Q must meet the condtons α 0. So we have to dscuss the sgn of the terms x Ax a 1,...,n n Corollary 3.2. We now consder a specal case of CP3 : mn s.t. f x n n b x 3 r n 2 x2 a x n x D B {u,v }, CP4 where b,r,a,u,v R and u v, 1,...,n. Corollary 3.3. For CP4,letx D B. If, for each 1,...,n, x r x a r 2 v u 0, b x x 0, 3.15 then x s a global mnmzer of CP4.
12 12 Mathematcal Problems n Engneerng Proof. For CP4, choose Q A dag r 1,...,r n. If condtons 3.15 hold, then, by Theorem 3.1, x s a global mnmzer of CP4. 4. Numercal Examples In ths secton, sx examples are gven to test the proposed global suffcent optmalty condton. Example 4.1. Consder the followng problem: mn s.t. 7 3 x3 1 5x3 2 2x x2 1 x x2 3 2x 1x 2 x 1 x 3 x 2 x x 1 5x 2 3x 3 x D 3 1, Let A and a 3/2, 5, 3 T,b 7/3, 5, 2 T. Obvously A s a postve semdefnte matrx. Consderng x 1, 1, 1 T, obvously we have, for each x 1, 2, b x x 0 1, 2, 3. NotethatAx a 15/2, 10, 6 T and X dag 1, 1, 1, andso 15 2 X Ax a 10 < Accordng to Corollary 2.4 1, x 1, 1, 1 s a global mnmzer. Example 4.2. Consder the followng problem: mn x 3 1 3x x3 4 x2 1 x x x2 4 2x 1x 2 x 1 x 4 2x 2 x 4 x 1 4x 2 5x 4 4 s.t. x D 1,
13 Mathematcal Problems n Engneerng 13 Let A and a 1, 4, 0, 5 T,b 1, 3, 0, 1/2 T. Obvously A not s a postve semdefnte matrx. Consderng x 1, 1, 0, 1 T, obvously we have, for each x 1, 1, b x x 0 1, 2, 3, 4. Note that Ax a 6, 10, 0, 9 T. Then lettng X dag 1, 1, 0, 1, we have X Ax a 6, 10, 0, 9 T 0. Letα 1 2 x 1 Ax a 1 / v 1 u 1 6, α 2 10,α 3 0andα 4 9. Then Q dag 6, 10, 0, 9, whch satsfes A Q 0. Accordng to Corollary 2.4 3, x 1, 1, 0, 1 s a global mnmzer. Example 4.3. Consder the followng problem: mn x x3 2 3x3 3 2x x2 2 4x x2 4 2x 1 5x 2 3x 3 4 s.t. x D 1, Let A dag 4, 6/5, 8, 1 and a 2, 5, 3, 0 T, b 1, 2/3, 3, 0 T,r 4, 6/5, 8, 1 T. Consder x 1, 1, 1, 0 T. Let X dag 1, 1, 1, 0, r 4, 6/5, 8, 0 T. Then x 1 r 1 x 1 a r 1 v 1 u 1 2 < 0, x 2 r 2 x 2 a r 2 v 2 u 2 5 < 0, x 3 r 3 x 3 a r 3 v 3 u 3 3 < 0, 4.7 x 4 r 4 x 4 a r 4 v 4 u 4 0, x 1, 1, b x x 0, 1, 2, 3, 4. Accordng to Corollary 2.5, x 1, 1, 1, 0 s a global mnmzer.
14 14 Mathematcal Problems n Engneerng Example 4.4. Consder the followng problem: mn 4x x3 2 3x x x x2 2 3x2 3 x2 4 2x 1x 2 x 1 x 4 x 2 x 3 x 3 x 4 5x x 2 2x 3 2x s.t. x D B 4 { 1, 1}. Let A and a 5, 9/2, 2, 2 T, b 4, 5/2, 3, 8/3 T. Obvously A not s a postve semdefnte matrx. Consderng x 1, 1, 1, 1 T, t follows that, for each x D B, b x x 0 1, 2, 3, 4. NotethatAx a 7, 13/2, 2, 6 T and X dag 1, 1, 1, 1. Letα 1 2 x 1 Ax a 1 / v 1 u 1 7. Smlarly we have, α 2 13/2, α 3 2andα 4 6. Then Q dag 7, 13/2, 2, 6, whch satsfes A Q 0. Accordng to Theorem 3.1 2, x 1, 1, 1, 1 s a global mnmzer. Example 4.5. Consder the followng problem: mn 3x 3 1 8x3 2 5x x3 4 x2 1 4x x2 3 3x2 4 x 1 2x 2 3x 3 4x 4 4 s.t. x D B { 1, 0} Let a 1, 2, 3, 4 T,b 3, 8, 5, 1/2 T,andr 2, 8, 10/3, 6 T. Consder x 1, 0, 1, 1 T. Let X dag 1, 1, 1, 1. Then x 1 r 1 x 1 a r 1 v 1 u 1 2 < 0, x 2 r 2 x 2 a r 2 v 2 u 2 6 < 0, x 3 r 3 x 3 a r 3 v 3 u < 0,
15 Mathematcal Problems n Engneerng 15 x 4 r 4 x 4 a r 4 v 4 u 4 7 < 0, x D B, b x x 0, 1, 2, 3, Accordng to Corollary 3.3, x 1, 0, 1, 1 s a global mnmzer. Example 4.6. Consder the followng problem: mn 3x 3 1 8x3 2 5x x3 4 x2 1 4x x2 3 3x2 4 x 1 2x 2 3x 3 4x 4 4 s.t. x D B { 1, 0} Let a 1, 2, 3, 4 T,b 3, 8, 5, 1/2 T and r 2, 8, 10/3, 6 T. Consder x 1, 0, 1, 1 T. Let X dag 1, 1, 1, 1. Then x 1 r 1 x 1 a r 1 v 1 u 1 0, x 2 r 2 x 2 a r 2 v 2 u 2 6 > 0, x 3 r 3 x 3 a r 3 v 3 u < 0, 4.13 x 4 r 4 x 4 a r 4 v 4 u 4 7 < 0. We can see that the condtons are not true n x 1, 0, 1, 1 T n Corollary 3.3. But x 1, 0, 1, 1 s a global mnmzer. Ths fact exactly shows that the condtons are just suffcent. Acknowledgment Ths research was supported by Innovaton Program of Shangha Muncpal Educaton Commsson 12ZZ071, Shangha Pujang Program 11PJC059, and the Natonal Natural Scence Foundaton of Chna References 1 R. A. Canfed, Multpont cubc surrogate functon for sequental approxmate optmzaton, Structural and Multdscplnary Optmzaton, vol. 27, pp , Y. Nesterov, Acceleratng the cubc regularzaton of Newton s method on convex problems, Mathematcal Programmng, vol. 112, no. 1, pp , 2008.
16 16 Mathematcal Problems n Engneerng 3 C. S. Ln, P.-R. Chang, and J. Y. S. Luh, Formulaton and optmzaton of cubc polynomal jont trajectores for ndustral robots, IEEE Transactons on Automatc Control, vol. 28, no. 12, pp , A. Beck and M. Teboulle, Global optmalty condtons for quadratc optmzaton problems wth bnary constrants, SIAM Journal on Optmzaton, vol. 11, no. 1, pp , J.-B. Hrart-Urruty, Global optmalty condtons n maxmzng a convex quadratc functon under convex quadratc constrants, Journal of Global Optmzaton, vol. 21, no. 4, pp , J.-B. Hrart-Urruty, Condtons for global optmalty 2, Journal of Global Optmzaton, vol. 13, no. 4, pp , A. Strekalovsky, Global optmalty condtons for nonconvex optmzaton, Journal of Global Optmzaton, vol. 12, no. 4, pp , V. Jeyakumar, A. M. Rubnov, and Z. Y. Wu, Suffcent global optmalty condtons for non-convex quadratc mnmzaton problems wth box constrants, Journal of Global Optmzaton, vol.36,no.3, pp , Z. Y. Wu, V. Jeyakumar, and A. M. Rubnov, Suffcent condtons for global optmalty of bvalent nonconvex quadratc programs wth nequalty constrants, Journal of Optmzaton Theory and Applcatons, vol. 133, no. 1, pp , V. Jeyakumar, A. M. Rubnov, and Z. Y. Wu, Non-convex quadratc mnmzaton problems wth quadratc constrants: global optmalty condtons, Mathematcal Programmng A, vol. 110, no. 3, pp , Z. Y. Wu, Suffcent global optmalty condtons for weakly convex mnmzaton problems, Journal of Global Optmzaton, vol. 39, no. 3, pp , Y. Wang and Z. Lang, Global optmalty condtons for cubc mnmzaton problem wth box or bnary constrants, Journal of Global Optmzaton, vol. 47, no. 4, pp , D. Pallaschke and S. Rolewcz, Foundatons of Mathematcal Optmzaton, Convex Analyss wthout Lnearty, Kluwer Academc Publshers, Dordrecht, The Netherlands, 1997.
17 Advances n Operatons Research Advances n Decson Scences Journal of Appled Mathematcs Algebra Journal of Probablty and Statstcs The Scentfc World Journal Internatonal Journal of Dfferental Equatons Submt your manuscrpts at Internatonal Journal of Advances n Combnatorcs Mathematcal Physcs Journal of Complex Analyss Internatonal Journal of Mathematcs and Mathematcal Scences Mathematcal Problems n Engneerng Journal of Mathematcs Dscrete Mathematcs Journal of Dscrete Dynamcs n Nature and Socety Journal of Functon Spaces Abstract and Appled Analyss Internatonal Journal of Journal of Stochastc Analyss Optmzaton
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 informationResearch Article Green s Theorem for Sign Data
Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of
More informationThe 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 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 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 informationCase Study of Markov Chains Ray-Knight Compactification
Internatonal Journal of Contemporary Mathematcal Scences Vol. 9, 24, no. 6, 753-76 HIKAI Ltd, www.m-har.com http://dx.do.org/.2988/cms.24.46 Case Study of Marov Chans ay-knght Compactfcaton HaXa Du and
More informationResearch Article Stochastic Methods Based on VU-Decomposition Methods for Stochastic Convex Minimax Problems
Mathematcal Problems n Engneerng, Artcle ID 894248, 5 pages http://dx.do.org/10.1155/2014/894248 Research Artcle Stochastc Methods Based on VU-Decomposton Methods for Stochastc Convex Mnmax Problems Yuan
More informationSharp integral inequalities involving high-order partial derivatives. Journal Of Inequalities And Applications, 2008, v. 2008, article no.
Ttle Sharp ntegral nequaltes nvolvng hgh-order partal dervatves Authors Zhao, CJ; Cheung, WS Ctaton Journal Of Inequaltes And Applcatons, 008, v. 008, artcle no. 5747 Issued Date 008 URL http://hdl.handle.net/07/569
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 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 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 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 informationResearch Article An Extension of Stolarsky Means to the Multivariable Case
Internatonal Mathematcs and Mathematcal Scences Volume 009, Artcle ID 43857, 14 pages do:10.1155/009/43857 Research Artcle An Extenson of Stolarsky Means to the Multvarable Case Slavko Smc Mathematcal
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 informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationResearch Article On the Open Problem Related to Rank Equalities for the Sum of Finitely Many Idempotent Matrices and Its Applications
e Scentfc World Journal Volume 204, Artcle ID 70243, 7 pages http://dxdoorg/055/204/70243 Research Artcle On the Open roblem Related to Ran Equaltes for the Sum of Fntely Many Idempotent Matrces and Its
More informationLecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.
prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove
More informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationA 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 informationAsymptotics 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 informationThe Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method
Journal of Electromagnetc Analyss and Applcatons, 04, 6, 0-08 Publshed Onlne September 04 n ScRes. http://www.scrp.org/journal/jemaa http://dx.do.org/0.46/jemaa.04.6000 The Exact Formulaton of the Inverse
More informationGames 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 informationOn the spectral norm of r-circulant matrices with the Pell and Pell-Lucas numbers
Türkmen and Gökbaş Journal of Inequaltes and Applcatons (06) 06:65 DOI 086/s3660-06-0997-0 R E S E A R C H Open Access On the spectral norm of r-crculant matrces wth the Pell and Pell-Lucas numbers Ramazan
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 informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
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 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 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 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 informationPerfect 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 informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationVoting Games with Positive Weights and. Dummy Players: Facts and Theory
Appled Mathematcal Scences, Vol 10, 2016, no 53, 2637-2646 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/ams201667209 Votng Games wth Postve Weghts and Dummy Players: Facts and Theory Zdravko Dmtrov
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 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 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 informationDeterminants 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 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 informationResearch Article Cubic B-Spline Collocation Method for One-Dimensional Heat and Advection-Diffusion Equations
Appled Mathematcs Volume 22, Artcle ID 4587, 8 pages do:.55/22/4587 Research Artcle Cubc B-Splne Collocaton Method for One-Dmensonal Heat and Advecton-Dffuson Equatons Joan Goh, Ahmad Abd. Majd, and Ahmad
More informationResearch Article A Generalized Sum-Difference Inequality and Applications to Partial Difference Equations
Hndaw Publshng Corporaton Advances n Dfference Equatons Volume 008, Artcle ID 695495, pages do:0.55/008/695495 Research Artcle A Generalzed Sum-Dfference Inequalty and Applcatons to Partal Dfference Equatons
More informationLecture 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 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 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 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 information1 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 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 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 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 informationUsing 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 informationDETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM
Ganj, Z. Z., et al.: Determnaton of Temperature Dstrbuton for S111 DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM by Davood Domr GANJI
More informationOn Graphs with Same Distance Distribution
Appled Mathematcs, 07, 8, 799-807 http://wwwscrporg/journal/am ISSN Onlne: 5-7393 ISSN Prnt: 5-7385 On Graphs wth Same Dstance Dstrbuton Xulang Qu, Xaofeng Guo,3 Chengy Unversty College, Jme Unversty,
More informationExistence of Two Conjugate Classes of A 5 within S 6. by Use of Character Table of S 6
Internatonal Mathematcal Forum, Vol. 8, 2013, no. 32, 1591-159 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.12988/mf.2013.3359 Exstence of Two Conjugate Classes of A 5 wthn S by Use of Character Table
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 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 informationResearch Article Relative Smooth Topological Spaces
Advances n Fuzzy Systems Volume 2009, Artcle ID 172917, 5 pages do:10.1155/2009/172917 Research Artcle Relatve Smooth Topologcal Spaces B. Ghazanfar Department of Mathematcs, Faculty of Scence, Lorestan
More informationAn explicit solution to polynomial matrix right coprime factorization with application in eigenstructure assignment
Journal of Control Theory Applcatons () 147 14 An explct soluton to polynomal matrx rght coprme factorzaton wth applcaton n egenstructure assgnment Bn ZHOU Guangren DUAN ( Center for Control Theory Gudance
More informationMonotonic Interpolating Curves by Using Rational. Cubic Ball Interpolation
Appled Mathematcal Scences, vol. 8, 204, no. 46, 7259 7276 HIKARI Ltd, www.m-hkar.com http://dx.do.org/0.2988/ams.204.47554 Monotonc Interpolatng Curves by Usng Ratonal Cubc Ball Interpolaton Samsul Arffn
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
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 informationAPPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14
APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce
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 information3.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 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 information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mt.edu 6.854J / 18.415J Advanced Algorthms Fall 2008 For nformaton about ctng these materals or our Terms of Use, vst: http://ocw.mt.edu/terms. 18.415/6.854 Advanced Algorthms
More informationA Note on Bound for Jensen-Shannon Divergence by Jeffreys
OPEN ACCESS Conference Proceedngs Paper Entropy www.scforum.net/conference/ecea- A Note on Bound for Jensen-Shannon Dvergence by Jeffreys Takuya Yamano, * Department of Mathematcs and Physcs, Faculty of
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
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 informationLinear Algebra and its Applications
Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler
More informationAlgebraic Solutions to Multidimensional Minimax Location Problems with Chebyshev Distance
Recent Researches n Appled and Computatonal Mathematcs Algebrac Solutons to Multdmensonal Mnmax Locaton Problems wth Chebyshev Dstance NIKOLAI KRIVULIN Faculty of Mathematcs and Mechancs St Petersburg
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 information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
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 informationOn 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 informationOrientation Model of Elite Education and Mass Education
Proceedngs of the 8th Internatonal Conference on Innovaton & Management 723 Orentaton Model of Elte Educaton and Mass Educaton Ye Peng Huanggang Normal Unversty, Huanggang, P.R.Chna, 438 (E-mal: yepeng@hgnc.edu.cn)
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 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 informationValuated Binary Tree: A New Approach in Study of Integers
Internatonal Journal of Scentfc Innovatve Mathematcal Research (IJSIMR) Volume 4, Issue 3, March 6, PP 63-67 ISS 347-37X (Prnt) & ISS 347-34 (Onlne) wwwarcournalsorg Valuated Bnary Tree: A ew Approach
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 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 informationInternational Journal of Algebra, Vol. 8, 2014, no. 5, HIKARI Ltd,
Internatonal Journal of Algebra, Vol. 8, 2014, no. 5, 229-238 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.12988/ja.2014.4212 On P-Duo odules Inaam ohammed Al Had Department of athematcs College of Educaton
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 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 informationRemarks 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 informationExistence results for a fourth order multipoint boundary value problem at resonance
Avalable onlne at www.scencedrect.com ScenceDrect Journal of the Ngeran Mathematcal Socety xx (xxxx) xxx xxx www.elsever.com/locate/jnnms Exstence results for a fourth order multpont boundary value problem
More informationKernel 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 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 informationDifference 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 informationLagrange Multipliers Kernel Trick
Lagrange Multplers Kernel Trck Ncholas Ruozz Unversty of Texas at Dallas Based roughly on the sldes of Davd Sontag General Optmzaton A mathematcal detour, we ll come back to SVMs soon! subject to: f x
More informationThe Quadratic Trigonometric Bézier Curve with Single Shape Parameter
J. Basc. Appl. Sc. Res., (3541-546, 01 01, TextRoad Publcaton ISSN 090-4304 Journal of Basc and Appled Scentfc Research www.textroad.com The Quadratc Trgonometrc Bézer Curve wth Sngle Shape Parameter Uzma
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 informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationResearch Article Stability Analysis of an In-Host Viral Model with Cure of Infected Cells and Humoral Immunity
Appled Mathematcs Volume 203, Artcle ID 02757, 5 pages http://dx.do.org/0.55/203/02757 Research Artcle Stablty Analyss of an In-Host Vral Model wth Cure of Infected Cells and Humoral Immunty Hu Wang, Rong
More informationA Solution of Porous Media Equation
Internatonal Mathematcal Forum, Vol. 11, 016, no. 15, 71-733 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.1988/mf.016.6669 A Soluton of Porous Meda Equaton F. Fonseca Unversdad Naconal de Colomba Grupo
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 informationALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul LIX, 013, f.1 DOI: 10.478/v10157-01-00-y ALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION BY ION
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 informationSolvability of Indefinite Stochastic Riccati Equations and Linear Quadratic Optimal Control Problems
*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,
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More information10) Activity analysis
3C3 Mathematcal Methods for Economsts (6 cr) 1) Actvty analyss Abolfazl Keshvar Ph.D. Aalto Unversty School of Busness Sldes orgnally by: Tmo Kuosmanen Updated by: Abolfazl Keshvar 1 Outlne Hstorcal development
More information