v2007.09.13 - Convex Optimization
v2007.09.13 - Convex Optimization v2007.09.13 - Convex Optimization
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]
- Page 285 and 286: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 287 and 288: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 289 and 290: Chapter 5Euclidean Distance MatrixT
- Page 291 and 292: 5.2. FIRST METRIC PROPERTIES 291cor
- Page 293 and 294: 5.3. ∃ FIFTH EUCLIDEAN METRIC PRO
- Page 295 and 296: 5.3. ∃ FIFTH EUCLIDEAN METRIC PRO
- Page 297 and 298: 5.4. EDM DEFINITION 297The collecti
- Page 299 and 300: 5.4. EDM DEFINITION 2995.4.2 Gram-f
- Page 301 and 302: 5.4. EDM DEFINITION 301D ∈ EDM N
- Page 303 and 304: 5.4. EDM DEFINITION 3035.4.2.2.1 Ex
- Page 305 and 306: 5.4. EDM DEFINITION 305ten affine e
- Page 307 and 308: 5.4. EDM DEFINITION 307spheres:Then
- Page 309 and 310: 5.4. EDM DEFINITION 309By eliminati
- Page 311 and 312: 5.4. EDM DEFINITION 311whereΦ ij =
- Page 313 and 314: 5.4. EDM DEFINITION 3135.4.2.2.5 De
- Page 315 and 316: 5.4. EDM DEFINITION 315105ˇx 4ˇx
- Page 317 and 318: 5.4. EDM DEFINITION 317corrected by
- Page 319 and 320: 5.4. EDM DEFINITION 319aptly be app
- Page 321 and 322: 5.4. EDM DEFINITION 321As before, a
- Page 323 and 324: 5.4. EDM DEFINITION 323where ([√t
- Page 325 and 326: 5.4. EDM DEFINITION 325because (A.3
- Page 327 and 328: 5.5. INVARIANCE 3275.5.1.0.1 Exampl
- Page 329 and 330: 5.6. INJECTIVITY OF D & UNIQUE RECO
- Page 331 and 332: 5.6. INJECTIVITY OF D & UNIQUE RECO
- Page 333 and 334: 5.6. INJECTIVITY OF D & UNIQUE RECO
- Page 335: 5.7. EMBEDDING IN AFFINE HULL 3355.
- Page 339 and 340: 5.7. EMBEDDING IN AFFINE HULL 3395.
- Page 341 and 342: 5.8. EUCLIDEAN METRIC VERSUS MATRIX
- Page 343 and 344: 5.8. EUCLIDEAN METRIC VERSUS MATRIX
- Page 345 and 346: 5.8. EUCLIDEAN METRIC VERSUS MATRIX
- Page 347 and 348: 5.8. EUCLIDEAN METRIC VERSUS MATRIX
- Page 349 and 350: 5.9. BRIDGE: CONVEX POLYHEDRA TO ED
- Page 351 and 352: 5.9. BRIDGE: CONVEX POLYHEDRA TO ED
- Page 353 and 354: 5.9. BRIDGE: CONVEX POLYHEDRA TO ED
- Page 355 and 356: 5.9. BRIDGE: CONVEX POLYHEDRA TO ED
- Page 357 and 358: 5.10. EDM-ENTRY COMPOSITION 357(ii)
- Page 359 and 360: 5.11. EDM INDEFINITENESS 3595.11.1
- Page 361 and 362: 5.11. EDM INDEFINITENESS 361(confer
- Page 363 and 364: 5.11. EDM INDEFINITENESS 363we have
- Page 365 and 366: 5.11. EDM INDEFINITENESS 365For pre
- Page 367 and 368: 5.12. LIST RECONSTRUCTION 367where
- Page 369 and 370: 5.12. LIST RECONSTRUCTION 369(a)(c)
- Page 371 and 372: 5.13. RECONSTRUCTION EXAMPLES 371D
- Page 373 and 374: 5.13. RECONSTRUCTION EXAMPLES 373Th
- Page 375 and 376: 5.13. RECONSTRUCTION EXAMPLES 375wh
- Page 377 and 378: 5.14. FIFTH PROPERTY OF EUCLIDEAN M
- Page 379 and 380: 5.14. FIFTH PROPERTY OF EUCLIDEAN M
- Page 381 and 382: 5.14. FIFTH PROPERTY OF EUCLIDEAN M
- Page 383 and 384: 5.14. FIFTH PROPERTY OF EUCLIDEAN M
- Page 385 and 386: 5.14. FIFTH PROPERTY OF EUCLIDEAN M
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]