v2007.09.13 - Convex Optimization

v2007.09.13 - Convex Optimization v2007.09.13 - Convex Optimization

convexoptimization.com
from convexoptimization.com More from this publisher
10.07.2015 Views

336 CHAPTER 5. EUCLIDEAN DISTANCE MATRIXBecause (826) and (827) translate,R n ⊇ A −α = aff(X − α1 T ) = aff(P − α) ⊇ P − α ⊇ {x l − α} (831)where from the previous relations it is easily shownaff(P − α) = aff(P) − α (832)Translating A neither changes its dimension or the dimension of theembedded polyhedron P ; (66)r ∆ = dim A = dim(A − α) ∆ = dim(P − α) = dim P (833)For any α ∈ R n , (829)-(833) remain true. [228, p.4, p.12] Yet when α ∈ A ,the affine set A − α becomes a unique subspace of R n in which the {x l − α}and their convex hull P − α are embedded (831), and whose dimension ismore easily calculated.5.7.1.0.1 Example. Translating first list-member to origin.Subtracting the first member α = ∆ x 1 from every list member will translatetheir affine hull A and their convex hull P and, in particular, x 1 ∈ P ⊆ A tothe origin in R n ; videlicet,X − x 1 1 T = X − Xe 1 1 T = X(I − e 1 1 T ) = X[0 √ ]2V N ∈ R n×N (834)where V N is defined in (711), and e 1 in (721). Applying (831) to (834),R n ⊇ R(XV N ) = A−x 1 = aff(X −x 1 1 T ) = aff(P −x 1 ) ⊇ P −x 1 ∋ 0(835)where XV N ∈ R n×N−1 . Hencer = dim R(XV N ) (836)Since shifting the geometric center to the origin (5.5.1.0.1) translates theaffine hull to the origin as well, then it must also be truer = dim R(XV ) (837)

5.7. EMBEDDING IN AFFINE HULL 337For any matrix whose range is R(V )= N(1 T ) we get the same result; e.g.,becauser = dim R(XV †TN ) (838)R(XV ) = {Xz | z ∈ N(1 T )} (839)and R(V ) = R(V N ) = R(V †TN) (E). These auxiliary matrices (B.4.2) aremore closely related;V = V N V † N(1435)5.7.1.1 Affine dimension r versus rankNow, suppose D is an EDM as defined byD(X) ∆ = δ(X T X)1 T + 1δ(X T X) T − 2X T X ∈ EDM N (705)and we premultiply by −V T N and postmultiply by V N . Then because V T N 1=0(712), it is always true that−V T NDV N = 2V T NX T XV N = 2V T N GV N ∈ S N−1 (840)where G is a Gram matrix.(confer (727))Similarly pre- and postmultiplying by V−V DV = 2V X T XV = 2V GV ∈ S N (841)always holds because V 1=0 (1425). Likewise, multiplying inner-productform EDM definition (770), it always holds:−V T NDV N = Θ T Θ ∈ S N−1 (774)For any matrix A , rankA T A = rankA = rankA T . [149,0.4] 5.30 So, by(839), affine dimensionr = rankXV = rankXV N = rankXV †TN= rank Θ= rankV DV = rankV GV = rankVN TDV N = rankVN TGV N(842)5.30 For A∈R m×n , N(A T A) = N(A). [247,3.3]

5.7. EMBEDDING IN AFFINE HULL 337For any matrix whose range is R(V )= N(1 T ) we get the same result; e.g.,becauser = dim R(XV †TN ) (838)R(XV ) = {Xz | z ∈ N(1 T )} (839)and R(V ) = R(V N ) = R(V †TN) (E). These auxiliary matrices (B.4.2) aremore closely related;V = V N V † N(1435)5.7.1.1 Affine dimension r versus rankNow, suppose D is an EDM as defined byD(X) ∆ = δ(X T X)1 T + 1δ(X T X) T − 2X T X ∈ EDM N (705)and we premultiply by −V T N and postmultiply by V N . Then because V T N 1=0(712), it is always true that−V T NDV N = 2V T NX T XV N = 2V T N GV N ∈ S N−1 (840)where G is a Gram matrix.(confer (727))Similarly pre- and postmultiplying by V−V DV = 2V X T XV = 2V GV ∈ S N (841)always holds because V 1=0 (1425). Likewise, multiplying inner-productform EDM definition (770), it always holds:−V T NDV N = Θ T Θ ∈ S N−1 (774)For any matrix A , rankA T A = rankA = rankA T . [149,0.4] 5.30 So, by(839), affine dimensionr = rankXV = rankXV N = rankXV †TN= rank Θ= rankV DV = rankV GV = rankVN TDV N = rankVN TGV N(842)5.30 For A∈R m×n , N(A T A) = N(A). [247,3.3]

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!