v2009.01.01 - Convex Optimization
v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization
342 CHAPTER 4. SEMIDEFINITE PROGRAMMING The fact Λ ≽ 0 ⇔ X ≽ 0 (1353) allows splitting semidefinite feasibility problem (776) into two parts: ( ρ ) minimize Λ ∥ A svec ∑ λ i Q ii − b ∥ i=1 [ R ρ ] (779) + subject to δ(Λ) ∈ 0 ( ρ ) minimize Q ∥ A svec ∑ λ ⋆ i Q ii − b ∥ i=1 (780) subject to Q T = Q −1 The linear equality constraint A svec X = b has been moved to the objective within a norm because these two problems (779) (780) are iterated; equality might only become feasible near convergence. This iteration always converges to a local minimum because the sequence of objective values is monotonic and nonincreasing; any monotonically nonincreasing real sequence converges. [222,1.2] [37,1.1] A rank-ρ matrix X feasible to the original problem (776) is found when the objective converges to 0. Positive semidefiniteness of matrix X with an upper bound ρ on rank is assured by the constraint on eigenvalue matrix Λ in convex problem (779); it means, the main diagonal of Λ must belong to the nonnegative orthant in a ρ-dimensional subspace of R n . The second problem (780) in the iteration is not convex. We propose solving it by convex iteration: Make the assignment ⎡ G = ⎣ ⎡ = ⎣ ⎤ q 1 [q1 T · · · qρ T ] . ⎦ ∈ S nρ q ρ ⎤ ⎡ Q 11 · · · Q 1ρ q 1 q . ... . ⎦ ∆ 1 T · · · q 1 qρ T = ⎣ . ... . Q T 1ρ · · · Q ρρ q ρ q1 T · · · q ρ qρ T ⎤ ⎦ (781)
4.7. CONVEX ITERATION RANK-1 343 Given ρ eigenvalues λ ⋆ i , then a problem equivalent to (780) is ∥ ( ∥∥∥ ρ ) ∑ minimize A svec λ ⋆ Q ij ∈R n×n i Q ii − b ∥ i=1 subject to trQ ii = 1, i=1... ρ trQ ij = 0, i
- Page 291 and 292: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 293 and 294: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 295 and 296: 4.5. CONSTRAINING CARDINALITY 295 m
- Page 297 and 298: 4.5. CONSTRAINING CARDINALITY 297 m
- Page 299 and 300: 4.5. CONSTRAINING CARDINALITY 299 a
- Page 301 and 302: 4.5. CONSTRAINING CARDINALITY 301 f
- Page 303 and 304: 4.5. CONSTRAINING CARDINALITY 303 n
- Page 305 and 306: 4.5. CONSTRAINING CARDINALITY 305 W
- Page 307 and 308: 4.5. CONSTRAINING CARDINALITY 307 t
- Page 309 and 310: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 311 and 312: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 313 and 314: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 315 and 316: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 317 and 318: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 319 and 320: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 321 and 322: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 323 and 324: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 325 and 326: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 327 and 328: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 329 and 330: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 331 and 332: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 333 and 334: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 335 and 336: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 337 and 338: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 339 and 340: 4.6. CARDINALITY AND RANK CONSTRAIN
- Page 341: 4.7. CONVEX ITERATION RANK-1 341 fi
- 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 and 388: 5.6. INJECTIVITY OF D & UNIQUE RECO
- Page 389 and 390: 5.6. INJECTIVITY OF D & UNIQUE RECO
- Page 391 and 392: 5.6. INJECTIVITY OF D & UNIQUE RECO
4.7. CONVEX ITERATION RANK-1 343<br />
Given ρ eigenvalues λ ⋆ i , then a problem equivalent to (780) is<br />
∥ ( ∥∥∥ ρ<br />
) ∑<br />
minimize A svec λ ⋆<br />
Q ij ∈R n×n<br />
i Q ii − b<br />
∥<br />
i=1<br />
subject to trQ ii = 1,<br />
i=1... ρ<br />
trQ ij = 0,<br />
i