v2010.10.26 - Convex Optimization
v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization
398 CHAPTER 5. EUCLIDEAN DISTANCE MATRIX5.3.0.0.1 Example. Triangle.Consider the EDM in (880), but missing one of its entries:⎡0⎤1 d 13D = ⎣ 1 0 4 ⎦ (881)d 31 4 0Can we determine unknown entries of D by applying the metric properties?Property 1 demands √ d 13 , √ d 31 ≥ 0, property 2 requires the main diagonalbe 0, while property 3 makes √ d 31 = √ d 13 . The fourth property tells us1 ≤ √ d 13 ≤ 3 (882)Indeed, described over that closed interval [1, 3] is a family of triangularpolyhedra whose angle at vertex x 2 varies from 0 to π radians. So, yes wecan determine the unknown entries of D , but they are not unique; nor shouldthey be from the information given for this example.5.3.0.0.2 Example. Small completion problem, I.Now consider the polyhedron in Figure 116b formed from an unknownlist {x 1 ,x 2 ,x 3 ,x 4 }. The corresponding EDM less one critical piece ofinformation, d 14 , is given by⎡⎤0 1 5 d 14D = ⎢ 1 0 4 1⎥⎣ 5 4 0 1 ⎦ (883)d 14 1 1 0From metric property 4 we may write a few inequalities for the two trianglescommon to d 14 ; we find√5−1 ≤√d14 ≤ 2 (884)We cannot further narrow those bounds on √ d 14 using only the four metricproperties (5.8.3.1.1). Yet there is only one possible choice for √ d 14 becausepoints x 2 ,x 3 ,x 4 must be collinear. All other values of √ d 14 in the interval[ √ 5−1, 2] specify impossible distances in any dimension; id est, in thisparticular example the triangle inequality does not yield an interval for √ d 14over which a family of convex polyhedra can be reconstructed.
5.3. ∃ FIFTH EUCLIDEAN METRIC PROPERTY 399x 3x 4x 3x 4(a)√512(b)1x 1 1 x 2x 1 x 2Figure 116: (a) Complete dimensionless EDM graph. (b) Emphasizingobscured segments x 2 x 4 , x 4 x 3 , and x 2 x 3 , now only five (2N −3) absolutedistances are specified. EDM so represented is incomplete, missing d 14 asin (883), yet the isometric reconstruction (5.4.2.3.7) is unique as proved in5.9.3.0.1 and5.14.4.1.1. First four properties of Euclidean metric are nota recipe for reconstruction of this polyhedron.We will return to this simple Example 5.3.0.0.2 to illustrate more elegantmethods of solution in5.8.3.1.1,5.9.3.0.1, and5.14.4.1.1. Until then, wecan deduce some general principles from the foregoing examples:Unknown d ij of an EDM are not necessarily uniquely determinable.The triangle inequality does not produce necessarily tight bounds. 5.4Four Euclidean metric properties are insufficient for reconstruction.5.4 The term tight with reference to an inequality means equality is achievable.
- Page 347 and 348: 4.5. CONSTRAINING CARDINALITY 3474.
- Page 349 and 350: 4.5. CONSTRAINING CARDINALITY 349R
- Page 351 and 352: 4.5. CONSTRAINING CARDINALITY 351pe
- Page 353 and 354: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 355 and 356: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 357 and 358: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 359 and 360: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 361 and 362: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 363 and 364: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 365 and 366: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 367 and 368: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 369 and 370: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 371 and 372: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 373 and 374: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 375 and 376: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 377 and 378: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 379 and 380: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 381 and 382: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 383 and 384: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 385 and 386: 4.7. CONSTRAINING RANK OF INDEFINIT
- Page 387 and 388: 4.7. CONSTRAINING RANK OF INDEFINIT
- Page 389 and 390: 4.7. CONSTRAINING RANK OF INDEFINIT
- Page 391 and 392: 4.8. CONVEX ITERATION RANK-1 391whi
- Page 393 and 394: 4.8. CONVEX ITERATION RANK-1 393the
- Page 395 and 396: Chapter 5Euclidean Distance MatrixT
- Page 397: 5.2. FIRST METRIC PROPERTIES 397to
- Page 401 and 402: 5.3. ∃ FIFTH EUCLIDEAN METRIC PRO
- Page 403 and 404: 5.4. EDM DEFINITION 403The collecti
- Page 405 and 406: 5.4. EDM DEFINITION 4055.4.2 Gram-f
- Page 407 and 408: 5.4. EDM DEFINITION 407We provide a
- Page 409 and 410: 5.4. EDM DEFINITION 4095.4.2.3.1 Ex
- Page 411 and 412: 5.4. EDM DEFINITION 411is the fact:
- Page 413 and 414: 5.4. EDM DEFINITION 413Figure 120:
- Page 415 and 416: 5.4. EDM DEFINITION 415is found fro
- Page 417 and 418: 5.4. EDM DEFINITION 417one less dim
- Page 419 and 420: 5.4. EDM DEFINITION 419equality con
- Page 421 and 422: 5.4. EDM DEFINITION 421How much dis
- Page 423 and 424: 5.4. EDM DEFINITION 423105ˇx 4ˇx
- Page 425 and 426: 5.4. EDM DEFINITION 425now implicit
- Page 427 and 428: 5.4. EDM DEFINITION 427by translate
- Page 429 and 430: 5.4. EDM DEFINITION 429Crippen & Ha
- Page 431 and 432: 5.4. EDM DEFINITION 431where ([√t
- Page 433 and 434: 5.4. EDM DEFINITION 433because (A.3
- Page 435 and 436: 5.5. INVARIANCE 4355.5.1.0.1 Exampl
- Page 437 and 438: 5.5. INVARIANCE 437x 2 x 2x 3 x 1 x
- Page 439 and 440: 5.6. INJECTIVITY OF D & UNIQUE RECO
- Page 441 and 442: 5.6. INJECTIVITY OF D & UNIQUE RECO
- Page 443 and 444: 5.6. INJECTIVITY OF D & UNIQUE RECO
- Page 445 and 446: 5.7. EMBEDDING IN AFFINE HULL 4455.
- Page 447 and 448: 5.7. EMBEDDING IN AFFINE HULL 447Fo
5.3. ∃ FIFTH EUCLIDEAN METRIC PROPERTY 399x 3x 4x 3x 4(a)√512(b)1x 1 1 x 2x 1 x 2Figure 116: (a) Complete dimensionless EDM graph. (b) Emphasizingobscured segments x 2 x 4 , x 4 x 3 , and x 2 x 3 , now only five (2N −3) absolutedistances are specified. EDM so represented is incomplete, missing d 14 asin (883), yet the isometric reconstruction (5.4.2.3.7) is unique as proved in5.9.3.0.1 and5.14.4.1.1. First four properties of Euclidean metric are nota recipe for reconstruction of this polyhedron.We will return to this simple Example 5.3.0.0.2 to illustrate more elegantmethods of solution in5.8.3.1.1,5.9.3.0.1, and5.14.4.1.1. Until then, wecan deduce some general principles from the foregoing examples:Unknown d ij of an EDM are not necessarily uniquely determinable.The triangle inequality does not produce necessarily tight bounds. 5.4Four Euclidean metric properties are insufficient for reconstruction.5.4 The term tight with reference to an inequality means equality is achievable.