QUADRATIC FORMS AND DEFINITE MATRICES. a 11 a 1n. a n1 a nn a 1i x i
|
|
- Roland Watkins
- 6 years ago
- Views:
Transcription
1 QUADRATIC FORMS AND DEFINITE MATRICES 1 DEFINITION AND CLASSIFICATION OF QUADRATIC FORMS 11Definitionofaquadraticform LetAdenoteannxnsymmetricmatrixwithrealentriesand letxdenoteanncolumnvectorthenq=x AxissaidtobeaquadraticformNotethat For example, consider the matrix andthevectorxqisgivenby Q =x Ax = (x 1 x n ) = (x 1,x,,x n ) a 11 a 1n a n1 a nn a 1i x i a ni x i =a 11 x 1 +a 1x 1 x + +a 1n x 1 x n +a 1 x x 1 +a x + +a nx x n a n1 x n x 1 +a n x n x + +a nn x n = i j a ij x i x j A = [ 1 1 ] [ ] [ ] Q =x 1 Ax = [x 1 x ] 1 [ ] x = [x 1 +x x 1 + x ] x = +x 1x +x 1 x +x = +4x 1x +x ( x n ) (1) 1ClassificationofthequadraticformQ=x Ax:Aquadraticformissaidtobe: a:negativedefinite:q<whenx = b:negativesemidefinite:q forallxandq =forsomex = c:positivedefinite:q>whenx = d:positivesemidefinite:q forallxandq=forsomex = e:indefinite:q>forsomexandq<forsomeotherx Date: February 19, 8 1
2 QUADRATIC FORMS AND DEFINITE MATRICES Considerasanexamplethe3x3diagonalmatrixDbelowandageneral3elementvectorx D = 1 4 The general quadratic form is given by Q =x Ax = [x 1 x x 3 ] 1 x 1 x 4 x 3 = [x 1 x 4x 3 ] x 1 x x 3 = +x +4x 3 Notethatforanyrealvectorx =,thatqwillbepositive,becausethesquareofanynumber is positive, the coefficients of the squared terms are positive and the sum of positive numbers is always positive Also consider the following matrix E = The general quadratic form is given by Q =x Ax = [x 1 x x 3 ] x 1 x x 3 = [ x 1 +x x 1 x x 3 ] = x 1 + x 1x +x 1 x x x 3 = x 1 + x 1x x x 3 = [x 1 x 1x ] x x 3 = x 1 [x x 1x ] x 3 x 1 x x 3 Notethatindependentofthevalueofx 3,thiswillbenegativeifx 1 andx areofoppositesignor equaltooneanothernowconsiderthecasewhere x 1 > x WriteQas Q = x 1 + x 1x x x 3 Thefirst,third,andfourthtermsareclearlynegativeButwith x 1 > x, x 1 > x 1x sothatthefirsttermismorenegativethanthesecondtermispositive,andsothewholeexpression isnegativenowconsiderthecasewhere x 1 < x WriteQas Q = x 1 + x 1x x x 3 Thefirst,third,andfourthtermsareclearlynegativeButwith x 1 < x, x > x 1x sothatthethirdtermismorenegativethanthesecondtermispositive,andsothewholeexpression isnegativethusthisquadraticformisnegativedefiniteforanyandallrealvaluesofx =
3 QUADRATIC FORMS AND DEFINITE MATRICES 3 13GraphicalanalysisWhenxhasonlytwoelements,wecangraphicallyrepresentQin3dimensions A positive definite quadratic form will always be positive except at the point where x =Thisgivesanicegraphicalrepresentationwheretheplaneatx=boundsthefunctionfrom below Figure 1 shows a positive definite quadratic form FIGURE1 PositiveDefiniteQuadraticForm3x 1 +3x 1 x Q Similarly,anegativedefinitequadraticformisboundedabovebytheplanex=Figureshows a negative definite quadratic form
4 4 QUADRATIC FORMS AND DEFINITE MATRICES FIGURE NegativeDefiniteQuadraticForm x 1 x 1 x Q Apositivesemi-definitequadraticformisboundedbelowbytheplanex=butwilltouchthe planeatmorethanthesinglepoint(,),itwilltouchtheplanealongaline Figure3showsa positive semi-definite quadratic form Anegativesemi-definitequadraticformisboundedabovebytheplanex=butwilltouchthe planeatmorethanthesinglepoint(,) Itwilltouchtheplanealongaline Figure4showsa negative-definite quadratic form Anindefinitequadraticformwillnotliecompletelyaboveorbelowtheplanebutwilllieabove forsomevaluesofxandbelowforothervaluesofxfigure5showsanindefinitequadraticform 14 Note on symmetry The matrix associated with a quadratic form B need not be symmetric However, no loss of generality is obtained by assuming B is symmetric We can always take definite and semidefinite matrices to be symmetric since they are defined by a quadratic form Specifically consideranonsymmetricmatrixbanddefineaas 1 (B +B ),Aisnowsymmetricandx Ax = x Bx DEFINITE AND SEMIDEFINITE MATRICES 1Definitionsofdefiniteandsemi-definitematricesLetAbeasquarematrixofordernand letxbeannelementvectorthenaissaidtobepositivesemidefiniteiffforallvectorsx
5 QUADRATIC FORMS AND DEFINITE MATRICES 5 FIGURE3 PositiveSemi-DefiniteQuadraticForm +4x 1x +x x Q FIGURE4 NegativeSemi-DefiniteQuadraticForm +4x 1x x x Q ThematrixAissaidtobepositivedefiniteiffornonzerox x Ax () x Ax > (3)
6 6 QUADRATIC FORMS AND DEFINITE MATRICES FIGURE5 IndefiniteQuadraticForm +4x 1x +x x Q LetAbeasquarematrixofordernThenAissaidtobenegative(semi)definiteiff-Aispositive (semi)definite Diagonal elements of positive definite matrices Theorem1LetAbeapositivedefinitematrixofordermThen If A is only positive semidefinite then a ii >,i = 1,,,m a ii,i = 1,,,m ProofLete i bethem-elementvectorallofwhoseelementsarezerossavetheith,whichisunity Forexampleifm=5andi=thene = [,1,,, ]IfAispositivedefinite,becausee i isnot thenullvector,wemusthave But e i Ae i >,i = 1,,,m (4) e i Ae i = a ii,i = 1,,,m (5) If A is positive semidefinite but not positive definite then repeating the argument above we find a ii = e i Ae i,i = 1,,,m (6)
7 QUADRATIC FORMS AND DEFINITE MATRICES 7 3 Factoring positive definite matrices(cholesky factorization) Theorem LetAbeapositivedefinitematrixofordernThenthereexistsalowertriangularmatrixT such that A = TT (7) Proof Define T as follows T = t 11 t 1 t t 31 t 3 t 33 t n1 t n t n3 t nn (8) NowdefineTT = TT = t 11 t 1 t t 31 t 3 t 33 t n1 t n t n3 t nn t 11 t 1 t 31 t n1 t t 3 t n t 33 t n3 t nn t 11 t 11 t 1 t 11 t 31 t 11 t n1 t 1 t 11 t 1 +t t 1 t 31 +t t 3 t 1 t n1 +t t n t 31 t 11 t 31 t 1 +t 3 t t 31 +t 3 +t 33 t 31 t n1 +t 3 t n +t 33 t n3 t n1 t 11 t n1 t 1 +t n t t n1 t 31 +t n t 3 +t n3 t 33 Σ n i=1 t ni (9) NowdefineA=TT andcomparelikeelements A =TT a 11 a 1 a 13 a 1n a 1 a a 3 a n a 31 a 3 a 33 a 3n = a n1 a n a n3 a nn t 11 t 11 t 1 t 11 t 31 t 11 t n1 t 1 t 11 t 1 +t t 1 t 31 +t t 3 t 1 t n1 +t t n t 31 t 11 t 31 t 1 +t 3 t t 31 +t 3 +t 33 t 31 t n1 +t 3 t n +t 33 t n3 t n1 t 11 t n1 t 1 +t n t t n1 t 31 +t n t 3 +t n3 t 33 Σ n i=1 t ni (1) Solvethesystemnowforeacht ij asfunctionsofthea ij Thesystemisobviouslyrecursive becausewecansolvefirstfort 11,thent 1,etcAschematicalgorithmisgivenbelow
8 8 QUADRATIC FORMS AND DEFINITE MATRICES t = ± t 11 = ± a 11,t 1 = a 1 t 11,t 31 = a 13 t 11,,t n1 = a 1n t 11 a a 1 a 11,t 3 = a 3 t 1 t 31 t,,t n = a n t 1 t n1 t 33 = ± a 33 t 31 t 3 = ± a 33 a 13 a 11 t ( a3 t 1 t 31 t 43 = a 34 t 31 t 41 t 3 t 4,,t n3 = a 3n t 31 t n1 t 3 t n (11) t 33 t 33 This matrix is not unique because the square roots involve two roots The standard procedure is to make the diagonal elements positive Consider the following matrix as an example F = 4 9 WecanfactoritintothefollowingmatrixT T = 1 anditstransposet ThenTT =F TT = 1 1 = Characteristic roots of positive definite matrices Theorem3LetAbeasymmetricmatrixofordernLet λ i,i=1,,nbeitscharacteristicrootsthenifais positivedefinite, λ i >,foralli ProofBecauseAissymmetric,chooseanorthonormalsetofeigenvectorsQClearlyQ AQ = Λ, where ΛisadiagonalmatrixwiththeeigenvaluesofAonthediagonalNowconsideranyoneof therowsofq ThisisoneoftheeigenvectorsofADenoteitbyq i Thenclearly 5 Nonsingularity of positive definite matrices q i Aq i = λ i > (1) Theorem4LetAbeasymmetricmatrixofordernIfAispositivedefinitethenr(A)=n ProofBecauseAissymmetric,chooseanorthonormalsetofeigenvectorsQClearlyQ AQ = Λ, where ΛisadiagonalmatrixwiththeeigenvaluesofAonthediagonalBecauseQisorthogonal itsinverseisitstransposeandwealsoobtainthataq=qλnowbecauseaispositivedefinite, allthecharacteristicrootsonthediagonalof ΛarepositiveThustheinverseof Λisjustamatrix with the reciprocal of each characteristic root on its diagonal Thus Λ is invertible Because QΛ istheproductoftwoinvertiblematrices,itisinvertiblethusaqisinvertible,andbecauseqis invertible, this means A is invertible and of full rank See Dhrymes[1, Proposition 61] or Horn and Johnson[4] t )
9 QUADRATIC FORMS AND DEFINITE MATRICES 9 Theorem5IfAintheabovetheoremismerelypositivesemidefinitethenr(A) <n ProofBecauseAispositivesemidefinite,weknowthat λ i,i=1,,,ntheproofisbasedon showingthatatleastoneoftherootsiszerowecandiagonalizeaas Consequently, for any vector y, Q AQ = Λ (13) y Q AQy = Σ n i=1 λ iy i (14) Now,ifxisanynonnullvector,bythesemidefinitenessofAwehave wherenowweset x Ax = x QQ AQQ x = x QΛQ x = Σ n i=1 λ iy i, (15) y = Q x (16) Because x is nonnull then y is also nonnull, because Q is orthogonal and thus non-singular Ifnoneofthe λ i iszero,15impliesthatforanynonnullx x Ax >, (17) thusshowingatobepositivedefiniteconsequently,atleastoneofthe λ i,i=1,,,n,mustbe zeroandtheremustexistatleastonenonnullxsuchthat But this shows that x Ax = Σ n i=1 λ iy i = (18) 6 Factoring symmetric positive definite matrices r(a) < n (19) Theorem6LetAbeasymmetricmatrix,ofordermThenAispositivedefiniteifandonlyifthereexists amatrixsofdimensionnxmandrankm(n m)suchthat Itispositivesemidefiniteifandonlyif A = S S r(s) < m Proof(Dhrymes[1, Proposition 61] or Horn and Johnson[4]) If A is positive(semi)definite then, asintheproofoftheorem56,wehavetherepresentation A = QΛQ HereQisanorthonormalsetofeigenvectorsand Λisadiagonalmatrixwiththeeigenvaluesof A on the diagonal Taking we have S = Λ 1/ Q
10 1 QUADRATIC FORMS AND DEFINITE MATRICES A = S S If A is positive definite, Λ is nonsingular and thus r(s) = m IfAismerelypositivesemidefinitethenr(Λ) <mandhence Thisprovesthefirstpartofthetheorem On the other hand suppose r(s) < m A = S S () andsisnxmmatrix(n m)ofrankmletxbeanynonnullvectorandnote x Ax = xs Sx (1) Therightsideoftheequationaboveisasumofsquaresandthusiszeroifandonlyif Sx = () IftherankofSism,equationcanbesatisfiedonlywithnullxHenceAispositivedefinite Soforanyx x Ax = x S Sx, andifsisofranklessthanm,thereexistsatleastonenonnullxsuchthat Sx = Consequently, there exists at least one nonnull x such that x Ax = which shows that A is positive semidefinite but not positive definite 7 Using naturally ordered principal minors to test for positive definiteness 71 Definition of naturally ordered(leading) principal minors The naturally ordered principle minorsofamatrixaaredefinedasdeterminantsofthematrices a 11 a 1 a 1 a a k1 a k a 1k a k a kk k = 1,,,n (3) AprincipalminoristheminorofaprincipalsubmatrixofAwhereaprincipalsubmatrixisa matrixformedfromasquarematrixabytakingasubsetconsistingofnrowsandcolumnelements from the same numbered columns The natural ordering considers only those principal minors that fall along the main diagonal Specifically for a matrix A, the naturally ordered principal minors are
11 QUADRATIC FORMS AND DEFINITE MATRICES 11 a 11, or schematically a 11 a 1 a 1 a, a 11 a 1 a 13 a 1 a a 3 a 31 a 3 a 33, a 11 a 1 a 1 a a n1 a n a 1n a n a nn (4) FIGURE 6 Naturally Ordered Principle Minors of a Matrix Theorem7 LetAbeasymmetricmatrixofordermThenAispositivedefiniteiffitsnaturallyordered principal minors are all positive Foraproof,seeGantmacher[,p36]orHadley[3,p6-6] As an example consider the matrix G1
12 1 QUADRATIC FORMS AND DEFINITE MATRICES G1 = 4 9 Elementa 11 =4>Nowconsiderthefirstnaturallyoccurringprincipalxsubmatrix 4 9 = 36 4 = 3 > Now consider the determinant of the entire matrix 4 9 = (4)(9)() + () () () + () () () (9) () () () () () (4) () () = = = 64 > This matrix is then positive definite 8 Characteristic roots of positive semi-definite matrices Let A be a symmetric matrix of order nlet λ i,i=1,,nbeitscharacteristicrootsifaispositivesemi-definitethen λ i i = 1,,,nandatleastone λ i = 9 Using principal minors to test for positive definiteness and positive semidefiniteness 91Definitionofprincipalminors Aprincipalminoroforderrisdefinedasthedeterminantofa principalsubmatrixaprincipalsubmatrixisdefinedasfollowsifaisamatrixofordern,and wewipeoutroftherowsandthecorrespondingrcolumnsaswell,theresulting(n-r)x(n-r) submatrix is called a principal submatrix of A The determinant of this matrix is called a principal minorofaanotherwaytowriteaprincipalminoroforderpis Note:Amatrixofordermhas principal minors of order p where ( ) i1,i A,i 3,,i p = i 1,i,i 3,,i p ( ) m = p ( ) m p a i1 i 1, a i1 i, a i i 1, a i i, a ip i 1, a ip i m! p! (m p)! Forexamplea4x4matrixhas1principalminoroforder4,(thematrixitself),4principalminors oforder3,6principleminorsoforder,and4principleminorsoforder1foratotalof15principal minors a i1 i p a i i p a ip i p (5)
13 QUADRATIC FORMS AND DEFINITE MATRICES 13 Asanexample,considerthefollowingmatrixoforder3whichhas1principalminoroforder3, 3principalminorsoforder, ( ) 3 3! (3) () = =! (3 )! (1) () (1) (1) = 6 = 3 and3principleminorsoforder1foratotalof7principalminors G = Order Order Order14 9 Nowconsiderthegeneral4x4matrixAandsomeofitsprincipalminors A = a 11 a 1 a 13 a 14 a 1 a a 3 a 4 a 31 a 3 a 33 a 34 a 41 a 4 a 43 a 44 A ( ) = a 11 a 13 a 31 a 33 A (14 14 ) = a 11 a 1 a 14 a 1 a a 4 a 41 a 4 a 44 A (4 4 ) = a a 4 a 4 a 44 A (3 3 ) = a 33 (6) 9 A test for for positive definiteness and positive semidefiniteness using principle minors Theorem 8 A matrix A is positive semidefinite iff all the principal minors of A are non-negative ForaproofseeGantmacher[,p37] As an example consider the matrix G G = Thediagonalelementsareallpositivesothe1testispassedNowconsidertheprincipalx minors 4 =8 = 8 > 6 = 1 4 = 8 > = 4 16 = 8 > TheseareallpositiveandsowepassthextestNowconsiderthedeterminantoftheentire matrix
14 14 QUADRATIC FORMS AND DEFINITE MATRICES = ()(4)(6) + () (4) () + () (4) () () (4) () (4) (4) () (6) () () = = = This determinant is zero and so the matrix is positive semidefinite but not positive definite 93 Some characteristics of negative semidefinite matrices The results on positive definite and positive semidefinite matrices have counterparts for negative definite and semidefinite matrices a: A negative semidefinite matrix is negative definite only if it is non-singular b:letabeanegativedefinitematrixofordermthen c:ifaisonlynegativesemidefinitethen a ii < i = 1,,m a ii i = 1,,m d:letabeasymmetricmatrixofordermthenaisnegativedefiniteiffitsnaturallyordered (leading)principal minors alternate in sign starting with a negative number The naturally ordered principle minors of a matrix A are defined as determinants of matrices a 11 a 1 a 1k a 1 a a k k = 1,,,m (7) a k1 a k a kk As an example consider the matrix E = 1 1 Elementa 11 =- <Nowconsiderthefirstnaturallyoccurringprincipalxsubmatrix 1 1 = 4 1 = 3 > Now consider the determinant of the entire matrix 1 1 = ( )( )( ) + (1) () () + (1) () () ( ) () () ( ) () () ( ) (1) (1) = = 6 < This matrix is then negative definite e:letabeasymmetricmatrixoforderm Aisnegativesemidefiniteiffthefollowinginequalities hold: ( ) ( 1) p i1, i A,, i p (8) i 1, i,, i p [1 i 1 i,, i p m,p = 1,,,m]
15 QUADRATIC FORMS AND DEFINITE MATRICES 15 HereA()isthedeterminantofthesubmatrixofAwithprowsandcolumnsofA,ie,it isaprincipleminorofa ( ) i1,i,,i p A i 1,i,,i p = a i1 i 1 a i1 i a i i 1 a i i a ip i 1 a ip i (9) Fora3x3matrixthismeansthatallthediagonalelementsarenon-positive,allxprincipal minors are non-negative and the determinant of the matrix is non-positive Consider asanexamplethematrixg3 G3 = Thediagonalelementsareallnegativesothe1testispassedNowconsidertheprincipal x minors 1 1 =4 1 = 3 > 1 1 = 4 1 = 3 > 1 1 = 4 1 = 3 > TheseareallpositiveandsowepassthextestNowconsiderthedeterminantofthe entire matrix G3 = = [( )( )( )] + [(1) ( 1) ( 1)] + [(1) ( 1) ( 1)] [( 1) ( ) ( 1)] [( 1) ( 1) ( )] [(1) (1) ( )] = ( ) ( ) ( ) = This determinant is zero and so the matrix is negative semidefinite but not negative definite f: Characteristic roots of negative definite matrices LetAbeasymmetricmatrixofordermandlet λ i,i=1,,mbeitsrealcharacteristic rootsifaisnegativedefinitethen λ i < i =1,,,m g: Characteristic roots of negative semi-definite matrices LetAbeasymmetricmatrixofordermandlet λ i,i=1,,mbeitsrealcharacteristic roots If A is negative semi-definite then λ i i = 1,,,mandatleastone λ i =
16 16 QUADRATIC FORMS AND DEFINITE MATRICES 1 Example problems Determine whether the following matrices are positive definite, positive semidefinite, negative definite, negative semidefinite, or indefinite 1 A = B = C = D = E = SECOND ORDER CONDITIONS FOR OPTIMIZATION PROBLEMS AND DEFINITENESS CONDITIONS ON MATRICES 31 Restatement of second order conditions for optimization problems with variables Theorem9Supposethatf(x 1,x )anditsfirstandsecondpartialderivativesarecontinuousthroughouta diskcenteredat(a,b)andthat f x 1 (a,b) = f x (a,b) = Then a:fhasalocalmaximumat(a,b)if f (a, b) < and f canalsowritethisasf 11 < andf 11 f f 1 f x > at (a, b) b:fhasalocalminimumat(a,b)if f (a, b) > and f canalsowritethisasf 11 > andf 11 f f c:fhasasaddlepointat(a,b)if f f 11 f f1 < at (a, b) f x d:thetestisinconclusiveat(a,b)if f f x someotherwaytodeterminethebehavioroffat(a,b) Theexpression f x 1 f x f x [ f x 1 x ] > at (a, b)we [ f x 1 x ] > at (a, b)we 1 > at (a, b) [ ] f x 1 x < at (a, b)wecanalsowritethisas [ f x 1 x ] iscalledthediscriminantoff [ f x 1 x ] = at (a, b)ifthiscasewemustfind 3 Expressing the second order conditions in terms of the definiteness of the Hessian of the objective function
17 QUADRATIC FORMS AND DEFINITE MATRICES 17 31SecondorderconditionsforalocalmaximumTheHessianofafunctionfisthenxnmatrixof second order partial derivatives, that is f 11 f 1 f 1n f 1 f f n H = (3) f n1 f n f nn We can write the discriminant condition as the determinant of the Hessian of the objective functionfwhentherearejustvariablesinthefunctionas f [ f x ] f = f 11 f 1 x 1 x f 1 f = H (31) Thesecondorderconditionforalocalmaximumisthenthat f 11 < and f 11 f 1 f 1 f > which is just the condition that H is negative definite 3 Second order conditions for a local minimum The second order condition for a local minimum is that f 11 > and f 11 f 1 f 1 f > which is just the condition that H is positive definite 33 Extension of condition on Hessian to more than two variables The second order conditions, for localmaximaandminimabasedonthesignoff 11 andthediscriminantwrittenintermsofwhether the Hessian of the objective function is positive or negative, extend to problems involving objective functions with more than variables 4 CONVEXITY AND CONCAVITY AND DEFINITENESS CONDITIONS ON HESSIAN MATRICES 41DefinitionofconcavityLetSbeanonemptyconvexsetinR n Thefunctionf:S R 1 issaid tobeconcaveonsiff(λx 1 +(1-λ)x ) λf(x 1 )+(1-λ)(x )foreachx 1,x Sandforeach λ [,1] Thefunctionfissaidtobestrictlyconcaveiftheaboveinequalityholdsasastrictinequalityfor eachdistinctx 1 x Sandforeach λ (,1) 4 Characterizations of concave functions a:thefunctionfiscontinuousontheinteriorofs b:thefunctionfisconcaveonsifandonlyiftheset {(x,y):x S,y f(x)}isconvexthis setiscalledthehypographoff ItisasubsetofR Thusconcavityoffisequivalentto convexity of its hypograph c:theset {x S,f(x) α }isconvexforeveryreal α d:adifferentiablefunctionfisconcaveonsifandonlyif f (x) f ( x) + f ( x) (x x)foreachdistinctx, x S This implies that tangent line is above the graph e: A twice differentiable function f is concave iff the Hessian H(x) is negative semidefinite for eachx S
18 18 QUADRATIC FORMS AND DEFINITE MATRICES f:letfbetwicedifferentiable TheniftheHessianH(x)isnegativedefiniteforeachx S,fisstrictlyconcave Furtheriffisstrictlyconcave,thentheHessianH(x)isnegative semidefinite for each x S g:everylocalmaximumoffoveraconvexsetw Sisaglobalmaximum h:iff ( x) =foraconcavefunctionthen, xistheglobalmaximumoffovers 43DefinitionofconvexityLetSbeanonemptyconvexsetinR n Thefunctionf:S R 1 issaid tobeconvexonsiff ( λx 1 + (1 λ)x ) λf(x 1 ) + (1 λ )f (x )foreachx 1,x Sandfor each λ [,1]Thefunctionfissaidtobestrictlyconvexiftheaboveinequalityholdsasastrict inequalityforeachdistinctx 1,x, Sandforeach λ (,1) 44 Characteristics of convex functions a:thefunctionfiscontinuousontheinteriorofs b:thefunctionfisconvexonsifandonlyiftheset {(x,y):x S,y f(x)}isconvexthisset iscalledtheepigraphoffitisasubsetofr Thusconcavityoffisequivalenttoconvexity of its epigraph c:theset {x S,f(x) α }isconvexforeveryreal α d:adifferentiablefunctionfisconvexonsifandonlyif f(x) f ( x ) + f ( x) (x x)foreachdistinctx, x S This implies that tangent line is below the graph e: A twice differentiable function f is convex iff the Hessian H(x) is positive semidefinite for eachx S f:letfbetwicedifferentiablethenifthehessianh(x)ispositivedefiniteforeachx S,fis strictly concave Further if f is strictly concave, then the Hessian H(x) is positive semidefiniteforeachx S g:everylocalminimumoffoveraconvexsetw Sisaglobalminimum h:iff ( x) =foraconvexfunctionthen, xistheglobalminimumoffovers 5 LINEAR CONSTRAINTS AND BORDERED MATRICES 51 Definition of a quadratic form with linear constraints Let the quadratic form be given by Q =x Ax = (x 1 x n ) with a set of m linear constraints represented by x B = a 11 a 1n a n1 a nn ( x n ) (3) (x 1 x x n ) b 11 b 1 b 1 b b n1 b n b 1m b m b nm = (33)
19 QUADRATIC FORMS AND DEFINITE MATRICES 19 5 Graphical analysis Consider the indefinite matrix A given by [ ] A = Thequadraticformisgivenby [ ] [ ] Q =x Ax = [x 1 x ] [ x ] = [ x 1 +x x 1 + x ] x = +x 1x +x 1 x +x = +4x 1x +x =4x ( x 1 ) (34) (35) Thegraphin3dimensionsincontainedinfigure7 FIGURE7 IndefiniteQuadraticForm x 1 +4x 1x x Q x 5 5 whereitisclearthatqtakesbothpositiveandnegativevalues ( ) 1 Ifwerestrictourattentiontovaluesofx 1 andx wherex 1 =x oramatrixb = then 1 thefunctionwillbepositiveforallvaluesofx =asisobviousfromthelastlineofequation35to seethismoreclearly,drawaverticalplanethroughthegraphabovealongthex 1 =x lineinfigure 8
20 QUADRATIC FORMS AND DEFINITE MATRICES FIGURE 8 Indefinite Quadratic Form with Restrictions 5 Q x 4 If we combine figure 8 with the plane divding the positive and negative orthants, the positive definiteness of the quadratic from subject to the constraint is even more obvious as shown in figure 9 FIGURE 9 Indefinite Quadratic Form with Restrictions 5 Q x 5 5 Nowalongthesetofpointswherex 1 =x,thefunctionisalwayspositiveexceptwherex 1 =x =Sothisfunctionispositivedefinitesubjecttotheconstraintthatx 1 =x 53DefinitionofaborderedmatrixwithconstraintsDefinetheborderedmatrixH B asfollows
21 QUADRATIC FORMS AND DEFINITE MATRICES 1 H B = a 11 a 1 a 1n b 11 b 1 b 1m a 1 a a n b 1 b b m a n1 a n a nn b n1 b n b nm b 11 b 1 b n1 b 1 b b n b 1m b m b nm (36) OntherightoftheAmatrixweappendthecolumnsoftheBmatrixIftherearethreeconstraints, thenthematrixh B willhaven+3columnsoringeneraln+mcolumns BelowtheAmatrixwe appendthetransposeofthebmatrix,onerowatatimeasweaddconstraintssoifm=,thenh B willhaven+rowsforthecaseofonelinearconstraintweobtain H B = a 11 a 1 b 11 a 1 a b 1 (37) b 11 b 1 54 Definiteness of a quadratic form subject to linear constraints 541ConstructingminorsofH B Todeterminethedefinitenessofthequadraticforminequation 3subjecttoequation33constructthematrixH B inequation36 Thedefinitenessischeckedby analyzingthesignsofthenaturallyorderprincipalminorsofh B startingwiththeminorthathas m+1rowsandcolumnsofthematrixaalongwiththebordersforthoserowsandcolumns For example,ifm=1,thenthefirstminorwecheckis a 11 a 1 b 11 a 1 a b 1 b 11 b 1 (38) Then we check a 11 a 1 a 13 b 11 a 1 a a 3 b 1 a 31 a 3 a 33 b 31 b 11 b 1 b 31 (39) andsoforthingeneralwearecheckingthesignsofminorswithp+mrows,wherepgoesfrom m+1tontheminorswecheckcanbewrittenasbelowwhentherearemconstraints
22 QUADRATIC FORMS AND DEFINITE MATRICES a 11 a 1 a 1p b 11 b 1 b 1m a 1 a a p b 1 b b m a p1 a p a pp b p1 b p b pm b 11 b 1 b p1 b 1 b b p b 1m b m b pm 54 Definiteness of a quadratic form subject to one linear constraint Construct the(n+1)x(n+1) matrix H B asin37wheretheconstraintequationisnowgivenby b 11 x 1 +b 1 x + +b n1 x n = (41) Supposethatb 1 =IfthelastnleadingprincipalminorsofH B havethesamesign,qispositive definite on the constraint set Ifthelastnleadingprincipalminorsalternateinsign,thenQisnegativedefiniteontheconstraint(Simon[5, Section 163]) 543GeneralconditionforamatrixtobepositivedefinitesubjecttoasetoflinearconstaintsIfthedeterminantofH B andtheselastn-mleadingprincipalminorsallhavethesamesignas ( 1) m,thenq ispositivedefiniteontheconstraintsetx B =Withoneconstraint,m=1,sothatthefirstminor is negative as are all subsequent ones 544 General condition for a matrix to be negative definite subject to a set of linear constaints If determinantofh B hasthesamesignas ( 1) p andiftheselastn-mleadingprincipalminorsalternate insign,thenthequadraticformqisnegativedefiniteontheconstraintsetx B = Withone constraint,m=1,andsopstartsat,sothatthefirstminorispositive,thesecondnegativeandso forth 545 If both of these conditions 543 and 544 are violated by nonzero leading principal minors, then Q isindefiniteontheconstraintsetx B = (4)
23 QUADRATIC FORMS AND DEFINITE MATRICES 3 REFERENCES [1] Dhrymes,PJMathematicsforEconometrics-3 r deditionnewyork:springer-verlag, [] Gantmacher, FR The Theory of Matrices Vol I New York: Chelsea Publishing Company, 1977 [3] Hadley, G Linear Algebra Reading: Addison Wesley Publishing Company, 1961 [4] Horn, RA and CR Johnson Matrix Analysis Cambridge: Cambridge University Press, 1985 [5] Simon, CP, and L Blume Mathematics for Economists New York: WW Norton and Company, 1994
Sufficiency of Signed Principal Minors for Semidefiniteness: A Relatively Easy Proof
Sufficiency of Signed Principal Minors for Semidefiniteness: A Relatively Easy Proof David M. Mandy Department of Economics University of Missouri 118 Professional Building Columbia, MO 65203 USA mandyd@missouri.edu
More informationMath (P)refresher Lecture 8: Unconstrained Optimization
Math (P)refresher Lecture 8: Unconstrained Optimization September 2006 Today s Topics : Quadratic Forms Definiteness of Quadratic Forms Maxima and Minima in R n First Order Conditions Second Order Conditions
More informationSymmetric Matrices and Eigendecomposition
Symmetric Matrices and Eigendecomposition Robert M. Freund January, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 2 1 Symmetric Matrices and Convexity of Quadratic Functions
More information1 Overview. 2 A Characterization of Convex Functions. 2.1 First-order Taylor approximation. AM 221: Advanced Optimization Spring 2016
AM 221: Advanced Optimization Spring 2016 Prof. Yaron Singer Lecture 8 February 22nd 1 Overview In the previous lecture we saw characterizations of optimality in linear optimization, and we reviewed the
More informationMath Matrix Algebra
Math 44 - Matrix Algebra Review notes - (Alberto Bressan, Spring 7) sec: Orthogonal diagonalization of symmetric matrices When we seek to diagonalize a general n n matrix A, two difficulties may arise:
More information2. Linear algebra. matrices and vectors. linear equations. range and nullspace of matrices. function of vectors, gradient and Hessian
FE661 - Statistical Methods for Financial Engineering 2. Linear algebra Jitkomut Songsiri matrices and vectors linear equations range and nullspace of matrices function of vectors, gradient and Hessian
More information1 Convexity, concavity and quasi-concavity. (SB )
UNIVERSITY OF MARYLAND ECON 600 Summer 2010 Lecture Two: Unconstrained Optimization 1 Convexity, concavity and quasi-concavity. (SB 21.1-21.3.) For any two points, x, y R n, we can trace out the line of
More informationHere each term has degree 2 (the sum of exponents is 2 for all summands). A quadratic form of three variables looks as
Reading [SB], Ch. 16.1-16.3, p. 375-393 1 Quadratic Forms A quadratic function f : R R has the form f(x) = a x. Generalization of this notion to two variables is the quadratic form Q(x 1, x ) = a 11 x
More informationReview of Vectors and Matrices
A P P E N D I X D Review of Vectors and Matrices D. VECTORS D.. Definition of a Vector Let p, p, Á, p n be any n real numbers and P an ordered set of these real numbers that is, P = p, p, Á, p n Then P
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 3: Positive-Definite Systems; Cholesky Factorization Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical Analysis I 1 / 11 Symmetric
More informationMathematical Foundations -1- Convexity and quasi-convexity. Convex set Convex function Concave function Quasi-concave function Supporting hyperplane
Mathematical Foundations -1- Convexity and quasi-convexity Convex set Convex function Concave function Quasi-concave function Supporting hyperplane Mathematical Foundations -2- Convexity and quasi-convexity
More informationLinear Algebra: Characteristic Value Problem
Linear Algebra: Characteristic Value Problem . The Characteristic Value Problem Let < be the set of real numbers and { be the set of complex numbers. Given an n n real matrix A; does there exist a number
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationMATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018
MATH 57: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 18 1 Global and Local Optima Let a function f : S R be defined on a set S R n Definition 1 (minimizers and maximizers) (i) x S
More information5 More on Linear Algebra
14.102, Math for Economists Fall 2004 Lecture Notes, 9/23/2004 These notes are primarily based on those written by George Marios Angeletos for the Harvard Math Camp in 1999 and 2000, and updated by Stavros
More informationThe general programming problem is the nonlinear programming problem where a given function is maximized subject to a set of inequality constraints.
1 Optimization Mathematical programming refers to the basic mathematical problem of finding a maximum to a function, f, subject to some constraints. 1 In other words, the objective is to find a point,
More information. This matrix is not symmetric. Example. Suppose A =
Notes for Econ. 7001 by Gabriel A. ozada The equation numbers and page numbers refer to Knut Sydsæter and Peter J. Hammond s textbook Mathematics for Economic Analysis (ISBN 0-13- 583600-X, 1995). 1. Convexity,
More informationPaul Schrimpf. October 18, UBC Economics 526. Unconstrained optimization. Paul Schrimpf. Notation and definitions. First order conditions
Unconstrained UBC Economics 526 October 18, 2013 .1.2.3.4.5 Section 1 Unconstrained problem x U R n F : U R. max F (x) x U Definition F = max x U F (x) is the maximum of F on U if F (x) F for all x U and
More informationAn Introduction to Linear Matrix Inequalities. Raktim Bhattacharya Aerospace Engineering, Texas A&M University
An Introduction to Linear Matrix Inequalities Raktim Bhattacharya Aerospace Engineering, Texas A&M University Linear Matrix Inequalities What are they? Inequalities involving matrix variables Matrix variables
More informationNonlinear Programming Algorithms Handout
Nonlinear Programming Algorithms Handout Michael C. Ferris Computer Sciences Department University of Wisconsin Madison, Wisconsin 5376 September 9 1 Eigenvalues The eigenvalues of a matrix A C n n are
More informationSTAT200C: Review of Linear Algebra
Stat200C Instructor: Zhaoxia Yu STAT200C: Review of Linear Algebra 1 Review of Linear Algebra 1.1 Vector Spaces, Rank, Trace, and Linear Equations 1.1.1 Rank and Vector Spaces Definition A vector whose
More informationPositive Definite Matrix
1/29 Chia-Ping Chen Professor Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Positive Definite, Negative Definite, Indefinite 2/29 Pure Quadratic Function
More informationFunctions of Several Variables
Functions of Several Variables The Unconstrained Minimization Problem where In n dimensions the unconstrained problem is stated as f() x variables. minimize f()x x, is a scalar objective function of vector
More informationN. L. P. NONLINEAR PROGRAMMING (NLP) deals with optimization models with at least one nonlinear function. NLP. Optimization. Models of following form:
0.1 N. L. P. Katta G. Murty, IOE 611 Lecture slides Introductory Lecture NONLINEAR PROGRAMMING (NLP) deals with optimization models with at least one nonlinear function. NLP does not include everything
More informationARE211, Fall 2005 CONTENTS. 5. Characteristics of Functions Surjective, Injective and Bijective functions. 5.2.
ARE211, Fall 2005 LECTURE #18: THU, NOV 3, 2005 PRINT DATE: NOVEMBER 22, 2005 (COMPSTAT2) CONTENTS 5. Characteristics of Functions. 1 5.1. Surjective, Injective and Bijective functions 1 5.2. Homotheticity
More informationUNCONSTRAINED OPTIMIZATION PAUL SCHRIMPF OCTOBER 24, 2013
PAUL SCHRIMPF OCTOBER 24, 213 UNIVERSITY OF BRITISH COLUMBIA ECONOMICS 26 Today s lecture is about unconstrained optimization. If you re following along in the syllabus, you ll notice that we ve skipped
More informationMonotone Function. Function f is called monotonically increasing, if. x 1 x 2 f (x 1 ) f (x 2 ) x 1 < x 2 f (x 1 ) < f (x 2 ) x 1 x 2
Monotone Function Function f is called monotonically increasing, if Chapter 3 x x 2 f (x ) f (x 2 ) It is called strictly monotonically increasing, if f (x 2) f (x ) Convex and Concave x < x 2 f (x )
More informationLecture 2 - Unconstrained Optimization Definition[Global Minimum and Maximum]Let f : S R be defined on a set S R n. Then
Lecture 2 - Unconstrained Optimization Definition[Global Minimum and Maximum]Let f : S R be defined on a set S R n. Then 1. x S is a global minimum point of f over S if f (x) f (x ) for any x S. 2. x S
More informationELA
CONSTRUCTING COPOSITIVE MATRICES FROM INTERIOR MATRICES CHARLES R. JOHNSON AND ROBERT REAMS Abstract. Let A be an n by n symmetric matrix with real entries. Using the l -norm for vectors and letting S
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationChapter 1. Matrix Algebra
ST4233, Linear Models, Semester 1 2008-2009 Chapter 1. Matrix Algebra 1 Matrix and vector notation Definition 1.1 A matrix is a rectangular or square array of numbers of variables. We use uppercase boldface
More informationSCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE
SCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE BABHRU JOSHI AND M. SEETHARAMA GOWDA Abstract. We consider the semidefinite cone K n consisting of all n n real symmetric positive semidefinite matrices.
More informationChapter 13. Convex and Concave. Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44
Chapter 13 Convex and Concave Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44 Monotone Function Function f is called monotonically increasing, if x 1 x 2 f (x 1 ) f (x 2 ) It
More informationCHAPTER 4: HIGHER ORDER DERIVATIVES. Likewise, we may define the higher order derivatives. f(x, y, z) = xy 2 + e zx. y = 2xy.
April 15, 2009 CHAPTER 4: HIGHER ORDER DERIVATIVES In this chapter D denotes an open subset of R n. 1. Introduction Definition 1.1. Given a function f : D R we define the second partial derivatives as
More informationProblem 1. CS205 Homework #2 Solutions. Solution
CS205 Homework #2 s Problem 1 [Heath 3.29, page 152] Let v be a nonzero n-vector. The hyperplane normal to v is the (n-1)-dimensional subspace of all vectors z such that v T z = 0. A reflector is a linear
More informationLesson 9 Exploring Graphs of Quadratic Functions
Exploring Graphs of Quadratic Functions Graph the following system of linear inequalities: { y > 1 2 x 5 3x + 2y 14 a What are three points that are solutions to the system of inequalities? b Is the point
More informationSemidefinite Programming Basics and Applications
Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent
More informationAN ASYMPTOTIC BEHAVIOR OF QR DECOMPOSITION
Unspecified Journal Volume 00, Number 0, Pages 000 000 S????-????(XX)0000-0 AN ASYMPTOTIC BEHAVIOR OF QR DECOMPOSITION HUAJUN HUANG AND TIN-YAU TAM Abstract. The m-th root of the diagonal of the upper
More informationMarch 5, 2012 MATH 408 FINAL EXAM SAMPLE
March 5, 202 MATH 408 FINAL EXAM SAMPLE Partial Solutions to Sample Questions (in progress) See the sample questions for the midterm exam, but also consider the following questions. Obviously, a final
More informationHW3 - Due 02/06. Each answer must be mathematically justified. Don t forget your name. 1 2, A = 2 2
HW3 - Due 02/06 Each answer must be mathematically justified Don t forget your name Problem 1 Find a 2 2 matrix B such that B 3 = A, where A = 2 2 If A was diagonal, it would be easy: we would just take
More informationPLC Papers Created For:
PLC Papers Created For: Quadratics intervention Deduce quadratic roots algebraically 1 Grade 6 Objective: Deduce roots algebraically. Question 1. Factorise and solve the equation x 2 8x + 15 = 0 Question
More informationBasics of Calculus and Algebra
Monika Department of Economics ISCTE-IUL September 2012 Basics of linear algebra Real valued Functions Differential Calculus Integral Calculus Optimization Introduction I A matrix is a rectangular array
More informationConvex Functions and Optimization
Chapter 5 Convex Functions and Optimization 5.1 Convex Functions Our next topic is that of convex functions. Again, we will concentrate on the context of a map f : R n R although the situation can be generalized
More informationThe Multivariate Gaussian Distribution
The Multivariate Gaussian Distribution Chuong B. Do October, 8 A vector-valued random variable X = T X X n is said to have a multivariate normal or Gaussian) distribution with mean µ R n and covariance
More informationA A x i x j i j (i, j) (j, i) Let. Compute the value of for and
7.2 - Quadratic Forms quadratic form on is a function defined on whose value at a vector in can be computed by an expression of the form, where is an symmetric matrix. The matrix R n Q R n x R n Q(x) =
More informationLMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009
LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix
More informationThere are six more problems on the next two pages
Math 435 bg & bu: Topics in linear algebra Summer 25 Final exam Wed., 8/3/5. Justify all your work to receive full credit. Name:. Let A 3 2 5 Find a permutation matrix P, a lower triangular matrix L with
More informationGraduate Mathematical Economics Lecture 1
Graduate Mathematical Economics Lecture 1 Yu Ren WISE, Xiamen University September 23, 2012 Outline 1 2 Course Outline ematical techniques used in graduate level economics courses Mathematics for Economists
More information3 (Maths) Linear Algebra
3 (Maths) Linear Algebra References: Simon and Blume, chapters 6 to 11, 16 and 23; Pemberton and Rau, chapters 11 to 13 and 25; Sundaram, sections 1.3 and 1.5. The methods and concepts of linear algebra
More informationUndergraduate Mathematical Economics Lecture 1
Undergraduate Mathematical Economics Lecture 1 Yu Ren WISE, Xiamen University September 15, 2014 Outline 1 Courses Description and Requirement 2 Course Outline ematical techniques used in economics courses
More informationLecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min.
MA 796S: Convex Optimization and Interior Point Methods October 8, 2007 Lecture 1 Lecturer: Kartik Sivaramakrishnan Scribe: Kartik Sivaramakrishnan 1 Conic programming Consider the conic program min s.t.
More informationChapter 2 BASIC PRINCIPLES. 2.1 Introduction. 2.2 Gradient Information
Chapter 2 BASIC PRINCIPLES 2.1 Introduction Nonlinear programming is based on a collection of definitions, theorems, and principles that must be clearly understood if the available nonlinear programming
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationLecture Unconstrained optimization. In this lecture we will study the unconstrained problem. minimize f(x), (2.1)
Lecture 2 In this lecture we will study the unconstrained problem minimize f(x), (2.1) where x R n. Optimality conditions aim to identify properties that potential minimizers need to satisfy in relation
More informationSymmetric matrices and dot products
Symmetric matrices and dot products Proposition An n n matrix A is symmetric iff, for all x, y in R n, (Ax) y = x (Ay). Proof. If A is symmetric, then (Ax) y = x T A T y = x T Ay = x (Ay). If equality
More informationLinear Algebra: Linear Systems and Matrices - Quadratic Forms and Deniteness - Eigenvalues and Markov Chains
Linear Algebra: Linear Systems and Matrices - Quadratic Forms and Deniteness - Eigenvalues and Markov Chains Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 3, 3 Systems
More informationMathematical Economics. Lecture Notes (in extracts)
Prof. Dr. Frank Werner Faculty of Mathematics Institute of Mathematical Optimization (IMO) http://math.uni-magdeburg.de/ werner/math-ec-new.html Mathematical Economics Lecture Notes (in extracts) Winter
More informationMATH2070 Optimisation
MATH2070 Optimisation Nonlinear optimisation with constraints Semester 2, 2012 Lecturer: I.W. Guo Lecture slides courtesy of J.R. Wishart Review The full nonlinear optimisation problem with equality constraints
More informationJordan Normal Form. Chapter Minimal Polynomials
Chapter 8 Jordan Normal Form 81 Minimal Polynomials Recall p A (x) =det(xi A) is called the characteristic polynomial of the matrix A Theorem 811 Let A M n Then there exists a unique monic polynomial q
More informationSEMIDEFINITE PROGRAM BASICS. Contents
SEMIDEFINITE PROGRAM BASICS BRIAN AXELROD Abstract. A introduction to the basics of Semidefinite programs. Contents 1. Definitions and Preliminaries 1 1.1. Linear Algebra 1 1.2. Convex Analysis (on R n
More informationMath 118, Fall 2014 Final Exam
Math 8, Fall 4 Final Exam True or false Please circle your choice; no explanation is necessary True There is a linear transformation T such that T e ) = e and T e ) = e Solution Since T is linear, if T
More informationB553 Lecture 5: Matrix Algebra Review
B553 Lecture 5: Matrix Algebra Review Kris Hauser January 19, 2012 We have seen in prior lectures how vectors represent points in R n and gradients of functions. Matrices represent linear transformations
More information(Received: )
The Mathematics Student, Special Centenary Volume (2007), 123-130 SYLVESTER S MINORANT CRITERION, LAGRANGE-BELTRAMI IDENTITY, AND NONNEGATIVE DEFINITENESS SUDHIR R. GHORPADE AND BALMOHAN V. LIMAYE (Received:
More informationComputational Optimization. Convexity and Unconstrained Optimization 1/29/08 and 2/1(revised)
Computational Optimization Convexity and Unconstrained Optimization 1/9/08 and /1(revised) Convex Sets A set S is convex if the line segment joining any two points in the set is also in the set, i.e.,
More informationCHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.
1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function
More informationSign Patterns with a Nest of Positive Principal Minors
Sign Patterns with a Nest of Positive Principal Minors D. D. Olesky 1 M. J. Tsatsomeros 2 P. van den Driessche 3 March 11, 2011 Abstract A matrix A M n (R) has a nest of positive principal minors if P
More informationUNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems
UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems Robert M. Freund February 2016 c 2016 Massachusetts Institute of Technology. All rights reserved. 1 1 Introduction
More informationLinear algebra I Homework #1 due Thursday, Oct Show that the diagonals of a square are orthogonal to one another.
Homework # due Thursday, Oct. 0. Show that the diagonals of a square are orthogonal to one another. Hint: Place the vertices of the square along the axes and then introduce coordinates. 2. Find the equation
More informationOn Euclidean distance matrices
On Euclidean distance matrices R. Balaji and R. B. Bapat Indian Statistical Institute, New Delhi, 110016 November 19, 2006 Abstract If A is a real symmetric matrix and P is an orthogonal projection onto
More information1 Determinants. 1.1 Determinant
1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to
More informationLecture 2 INF-MAT : , LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky
Lecture 2 INF-MAT 4350 2009: 7.1-7.6, LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky Tom Lyche and Michael Floater Centre of Mathematics for Applications, Department of Informatics,
More informationMath 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
More information6 Optimization. The interior of a set S R n is the set. int X = {x 2 S : 9 an open box B such that x 2 B S}
6 Optimization The interior of a set S R n is the set int X = {x 2 S : 9 an open box B such that x 2 B S} Similarly, the boundary of S, denoted@s, istheset @S := {x 2 R n :everyopenboxb s.t. x 2 B contains
More informationFunctions of Several Variables
Jim Lambers MAT 419/519 Summer Session 2011-12 Lecture 2 Notes These notes correspond to Section 1.2 in the text. Functions of Several Variables We now generalize the results from the previous section,
More informationarxiv: v3 [math.ra] 10 Jun 2016
To appear in Linear and Multilinear Algebra Vol. 00, No. 00, Month 0XX, 1 10 The critical exponent for generalized doubly nonnegative matrices arxiv:1407.7059v3 [math.ra] 10 Jun 016 Xuchen Han a, Charles
More informationMath Camp Notes: Linear Algebra I
Math Camp Notes: Linear Algebra I Basic Matrix Operations and Properties Consider two n m matrices: a a m A = a n a nm Then the basic matrix operations are as follows: a + b a m + b m A + B = a n + b n
More informationLecture Note 5: Semidefinite Programming for Stability Analysis
ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State
More informationTBP MATH33A Review Sheet. November 24, 2018
TBP MATH33A Review Sheet November 24, 2018 General Transformation Matrices: Function Scaling by k Orthogonal projection onto line L Implementation If we want to scale I 2 by k, we use the following: [
More informationEC /11. Math for Microeconomics September Course, Part II Problem Set 1 with Solutions. a11 a 12. x 2
LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC400 2010/11 Math for Microeconomics September Course, Part II Problem Set 1 with Solutions 1. Show that the general
More informationPositive definite preserving linear transformations on symmetric matrix spaces
Positive definite preserving linear transformations on symmetric matrix spaces arxiv:1008.1347v1 [math.ra] 7 Aug 2010 Huynh Dinh Tuan-Tran Thi Nha Trang-Doan The Hieu Hue Geometry Group College of Education,
More informationSOLUTIONS FOR PROBLEMS 1-30
. Answer: 5 Evaluate x x + 9 for x SOLUTIONS FOR PROBLEMS - 0 When substituting x in x be sure to do the exponent before the multiplication by to get (). + 9 5 + When multiplying ( ) so that ( 7) ( ).
More informationEC /11. Math for Microeconomics September Course, Part II Lecture Notes. Course Outline
LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC400 20010/11 Math for Microeconomics September Course, Part II Lecture Notes Course Outline Lecture 1: Tools for
More information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationZ-Pencils. November 20, Abstract
Z-Pencils J. J. McDonald D. D. Olesky H. Schneider M. J. Tsatsomeros P. van den Driessche November 20, 2006 Abstract The matrix pencil (A, B) = {tb A t C} is considered under the assumptions that A is
More informationMathematical Economics (ECON 471) Lecture 3 Calculus of Several Variables & Implicit Functions
Mathematical Economics (ECON 471) Lecture 3 Calculus of Several Variables & Implicit Functions Teng Wah Leo 1 Calculus of Several Variables 11 Functions Mapping between Euclidean Spaces Where as in univariate
More informationC&O367: Nonlinear Optimization (Winter 2013) Assignment 4 H. Wolkowicz
C&O367: Nonlinear Optimization (Winter 013) Assignment 4 H. Wolkowicz Posted Mon, Feb. 8 Due: Thursday, Feb. 8 10:00AM (before class), 1 Matrices 1.1 Positive Definite Matrices 1. Let A S n, i.e., let
More informationSolvability of Linear Matrix Equations in a Symmetric Matrix Variable
Solvability of Linear Matrix Equations in a Symmetric Matrix Variable Maurcio C. de Oliveira J. William Helton Abstract We study the solvability of generalized linear matrix equations of the Lyapunov type
More informationUniversity of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm
University of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm Name: The proctor will let you read the following conditions
More informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More information10-701/ Recitation : Linear Algebra Review (based on notes written by Jing Xiang)
10-701/15-781 Recitation : Linear Algebra Review (based on notes written by Jing Xiang) Manojit Nandi February 1, 2014 Outline Linear Algebra General Properties Matrix Operations Inner Products and Orthogonal
More informationc c c c c c c c c c a 3x3 matrix C= has a determinant determined by
Linear Algebra Determinants and Eigenvalues Introduction: Many important geometric and algebraic properties of square matrices are associated with a single real number revealed by what s known as the determinant.
More informationMathematical Economics: Lecture 16
Mathematical Economics: Lecture 16 Yu Ren WISE, Xiamen University November 26, 2012 Outline 1 Chapter 21: Concave and Quasiconcave Functions New Section Chapter 21: Concave and Quasiconcave Functions Concave
More informationChap 3. Linear Algebra
Chap 3. Linear Algebra Outlines 1. Introduction 2. Basis, Representation, and Orthonormalization 3. Linear Algebraic Equations 4. Similarity Transformation 5. Diagonal Form and Jordan Form 6. Functions
More informationLinear Algebra & Analysis Review UW EE/AA/ME 578 Convex Optimization
Linear Algebra & Analysis Review UW EE/AA/ME 578 Convex Optimization January 9, 2015 1 Notation 1. Book pages without explicit citation refer to [1]. 2. R n denotes the set of real n-column vectors. 3.
More informationCompletions of P-Matrix Patterns
1 Completions of P-Matrix Patterns Luz DeAlba 1 Leslie Hogben Department of Mathematics Department of Mathematics Drake University Iowa State University Des Moines, IA 50311 Ames, IA 50011 luz.dealba@drake.edu
More informationUnit 3: HW3.5 Sum and Product
Unit 3: HW3.5 Sum and Product Without solving, find the sum and product of the roots of each equation. 1. x 2 8x + 7 = 0 2. 2x + 5 = x 2 3. -7x + 4 = -3x 2 4. -10x 2 = 5x - 2 5. 5x 2 2x 3 4 6. 1 3 x2 3x
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationLinear Algebra Primer
Linear Algebra Primer David Doria daviddoria@gmail.com Wednesday 3 rd December, 2008 Contents Why is it called Linear Algebra? 4 2 What is a Matrix? 4 2. Input and Output.....................................
More informationORIE 6300 Mathematical Programming I August 25, Recitation 1
ORIE 6300 Mathematical Programming I August 25, 2016 Lecturer: Calvin Wylie Recitation 1 Scribe: Mateo Díaz 1 Linear Algebra Review 1 1.1 Independence, Spanning, and Dimension Definition 1 A (usually infinite)
More informationHMH Fuse Algebra correlated to the. Texas Essential Knowledge and Skills for Mathematics High School Algebra 2
HMH Fuse Algebra 2 2012 correlated to the Texas Essential Knowledge and Skills for Mathematics High School Algebra 2 111.33. Algebra II (b) Knowledge and skills. (1) Foundations for functions. The student
More information