v2009.01.01 - Convex Optimization
v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization
388 CHAPTER 5. EUCLIDEAN DISTANCE MATRIX ∈ basis S N⊥ h dim S N c = dim S N h = N(N−1) 2 in R N(N+1)/2 dim S N⊥ c = dim S N⊥ h = N in R N(N+1)/2 basis S N c = V {E ij }V (confer (52)) S N c basis S N⊥ c S N h ∈ basis S N⊥ h Figure 105: Orthogonal complements in S N abstractly oriented in isometrically isomorphic R N(N+1)/2 . Case N = 2 accurately illustrated in R 3 . Orthogonal projection of basis for S N⊥ h on S N⊥ c yields another basis for S N⊥ c . (Basis vectors for S N⊥ c are illustrated lying in a plane orthogonal to S N c in this dimension. Basis vectors for each ⊥ space outnumber those for its respective orthogonal complement; such is not the case in higher dimension.)
5.6. INJECTIVITY OF D & UNIQUE RECONSTRUCTION 389 To prove injectivity of D(G) on S N c : Any matrix Y ∈ S N can be decomposed into orthogonal components in S N ; Y = V Y V + (Y − V Y V ) (896) where V Y V ∈ S N c and Y −V Y V ∈ S N⊥ c (1876). Because of translation invariance (5.5.1.1) and linearity, D(Y −V Y V )=0 hence N(D)⊇ S N⊥ c . It remains only to show D(V Y V ) = 0 ⇔ V Y V = 0 (897) ( ⇔ Y = u1 T + 1u T for some u∈ R N) . D(V Y V ) will vanish whenever 2V Y V = δ(V Y V )1 T + 1δ(V Y V ) T . But this implies R(1) (B.2) were a subset of R(V Y V ) , which is contradictory. Thus we have N(D) = {Y | D(Y )=0} = {Y | V Y V = 0} = S N⊥ c (898) Since G1=0 ⇔ X1=0 (819) simply means list X is geometrically centered at the origin, and because the Gram-form EDM operator D is translation invariant and N(D) is the translation-invariant subspace S N⊥ c , then EDM definition D(G) (894) on 5.25 (confer6.6.1,6.7.1,A.7.4.0.1) S N c ∩ S N + = {V Y V ≽ 0 | Y ∈ S N } ≡ {V N AV T N must be surjective onto EDM N ; (confer (811)) EDM N = { D(G) | G ∈ S N c ∩ S N + 5.6.1.1 Gram-form operator D inversion | A∈ S N−1 + } ⊂ S N (899) Define the linear geometric centering operator V ; (confer (820)) } (900) V(D) : S N → S N ∆ = −V DV 1 2 (901) [78,4.3] 5.26 This orthogonal projector V has no nullspace on S N h = aff EDM N (1154) 5.25 Equivalence ≡ in (899) follows from the fact: Given B = V Y V = V N AVN T ∈ SN + with only matrix A unknown, then V † †T NBV N = A and A∈ SN−1 + must be positive semidefinite by positive semidefiniteness of B and Corollary A.3.1.0.5. 5.26 Critchley cites Torgerson (1958) [302, ch.11,2] for a history and derivation of (901).
- Page 337 and 338: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 339 and 340: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 341 and 342: 4.7. CONVEX ITERATION RANK-1 341 fi
- Page 343 and 344: 4.7. CONVEX ITERATION RANK-1 343 Gi
- Page 345 and 346: Chapter 5 Euclidean Distance Matrix
- Page 347 and 348: 5.2. FIRST METRIC PROPERTIES 347 co
- Page 349 and 350: 5.3. ∃ FIFTH EUCLIDEAN METRIC PRO
- Page 351 and 352: 5.3. ∃ FIFTH EUCLIDEAN METRIC PRO
- Page 353 and 354: 5.4. EDM DEFINITION 353 The collect
- Page 355 and 356: 5.4. EDM DEFINITION 355 5.4.2 Gram-
- Page 357 and 358: 5.4. EDM DEFINITION 357 D ∈ EDM N
- Page 359 and 360: 5.4. EDM DEFINITION 359 5.4.2.2.1 E
- Page 361 and 362: 5.4. EDM DEFINITION 361 ten affine
- Page 363 and 364: 5.4. EDM DEFINITION 363 spheres: Th
- Page 365 and 366: 5.4. EDM DEFINITION 365 By eliminat
- Page 367 and 368: 5.4. EDM DEFINITION 367 where Φ ij
- Page 369 and 370: 5.4. EDM DEFINITION 369 5.4.2.2.6 D
- Page 371 and 372: 5.4. EDM DEFINITION 371 10 5 ˇx 4
- Page 373 and 374: 5.4. EDM DEFINITION 373 corrected b
- Page 375 and 376: 5.4. EDM DEFINITION 375 by translat
- Page 377 and 378: 5.4. EDM DEFINITION 377 Crippen & H
- Page 379 and 380: 5.4. EDM DEFINITION 379 where ([√
- Page 381 and 382: 5.4. EDM DEFINITION 381 because (A.
- Page 383 and 384: 5.5. INVARIANCE 383 5.5.1.0.1 Examp
- Page 385 and 386: 5.5. INVARIANCE 385 x 2 x 2 x 3 x 1
- Page 387: 5.6. INJECTIVITY OF D & UNIQUE RECO
- Page 391 and 392: 5.6. INJECTIVITY OF D & UNIQUE RECO
- Page 393 and 394: 5.7. EMBEDDING IN AFFINE HULL 393 5
- Page 395 and 396: 5.7. EMBEDDING IN AFFINE HULL 395 F
- Page 397 and 398: 5.7. EMBEDDING IN AFFINE HULL 397 5
- Page 399 and 400: 5.8. EUCLIDEAN METRIC VERSUS MATRIX
- Page 401 and 402: 5.8. EUCLIDEAN METRIC VERSUS MATRIX
- Page 403 and 404: 5.8. EUCLIDEAN METRIC VERSUS MATRIX
- Page 405 and 406: 5.8. EUCLIDEAN METRIC VERSUS MATRIX
- Page 407 and 408: 5.9. BRIDGE: CONVEX POLYHEDRA TO ED
- Page 409 and 410: 5.9. BRIDGE: CONVEX POLYHEDRA TO ED
- Page 411 and 412: 5.9. BRIDGE: CONVEX POLYHEDRA TO ED
- Page 413 and 414: 5.10. EDM-ENTRY COMPOSITION 413 of
- Page 415 and 416: 5.10. EDM-ENTRY COMPOSITION 415 The
- Page 417 and 418: 5.11. EDM INDEFINITENESS 417 5.11.1
- Page 419 and 420: 5.11. EDM INDEFINITENESS 419 we hav
- Page 421 and 422: 5.11. EDM INDEFINITENESS 421 So bec
- Page 423 and 424: 5.11. EDM INDEFINITENESS 423 where
- Page 425 and 426: 5.12. LIST RECONSTRUCTION 425 where
- Page 427 and 428: 5.12. LIST RECONSTRUCTION 427 (a) (
- Page 429 and 430: 5.13. RECONSTRUCTION EXAMPLES 429 D
- Page 431 and 432: 5.13. RECONSTRUCTION EXAMPLES 431 T
- Page 433 and 434: 5.13. RECONSTRUCTION EXAMPLES 433 w
- Page 435 and 436: 5.14. FIFTH PROPERTY OF EUCLIDEAN M
- Page 437 and 438: 5.14. FIFTH PROPERTY OF EUCLIDEAN M
5.6. INJECTIVITY OF D & UNIQUE RECONSTRUCTION 389<br />
To prove injectivity of D(G) on S N c : Any matrix Y ∈ S N can be<br />
decomposed into orthogonal components in S N ;<br />
Y = V Y V + (Y − V Y V ) (896)<br />
where V Y V ∈ S N c and Y −V Y V ∈ S N⊥<br />
c (1876). Because of translation<br />
invariance (5.5.1.1) and linearity, D(Y −V Y V )=0 hence N(D)⊇ S N⊥<br />
c . It<br />
remains only to show<br />
D(V Y V ) = 0 ⇔ V Y V = 0 (897)<br />
(<br />
⇔ Y = u1 T + 1u T for some u∈ R N) . D(V Y V ) will vanish whenever<br />
2V Y V = δ(V Y V )1 T + 1δ(V Y V ) T . But this implies R(1) (B.2) were a<br />
subset of R(V Y V ) , which is contradictory. Thus we have<br />
N(D) = {Y | D(Y )=0} = {Y | V Y V = 0} = S N⊥<br />
c (898)<br />
Since G1=0 ⇔ X1=0 (819) simply means list X is geometrically<br />
centered at the origin, and because the Gram-form EDM operator D is<br />
translation invariant and N(D) is the translation-invariant subspace S N⊥<br />
c ,<br />
then EDM definition D(G) (894) on 5.25 (confer6.6.1,6.7.1,A.7.4.0.1)<br />
S N c ∩ S N + = {V Y V ≽ 0 | Y ∈ S N } ≡ {V N AV T N<br />
must be surjective onto EDM N ; (confer (811))<br />
EDM N = { D(G) | G ∈ S N c ∩ S N +<br />
5.6.1.1 Gram-form operator D inversion<br />
<br />
| A∈ S N−1<br />
+ } ⊂ S N (899)<br />
Define the linear geometric centering operator V ; (confer (820))<br />
}<br />
(900)<br />
V(D) : S N → S N ∆ = −V DV 1 2<br />
(901)<br />
[78,4.3] 5.26 This orthogonal projector V has no nullspace on<br />
S N h = aff EDM N (1154)<br />
5.25 Equivalence ≡ in (899) follows from the fact: Given B = V Y V = V N AVN T ∈ SN + with<br />
only matrix A unknown, then V † †T<br />
NBV N<br />
= A and A∈ SN−1 + must be positive semidefinite<br />
by positive semidefiniteness of B and Corollary A.3.1.0.5.<br />
5.26 Critchley cites Torgerson (1958) [302, ch.11,2] for a history and derivation of (901).