v2010.10.26 - Convex Optimization
v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization
392 CHAPTER 4. SEMIDEFINITE PROGRAMMINGsolving it by convex iteration: Make the assignment⎡ ⎤q 1 [ q1 T · · · qρ T ]G = ⎣.⎦∈ S nρq ρ⎡⎤ ⎡Q 11 · · · Q 1ρ q 1 q1 T · · · q 1 qρT= ⎣ .... . ⎦⎣.... .Q T 1ρ · · · Q ρρ q ρ q1 T · · · q ρ qρT⎤⎦(874)Given ρ eigenvalues λ ⋆ i , then a problem equivalent to (873) is∥ ( ∥∥∥ ρ) ∑minimize A svec λ ⋆Q ii ∈S n , Q ij ∈R n×ni Q ii − b∥i=1subject to tr Q ii = 1, i=1... ρtr Q ij = 0,i
4.8. CONVEX ITERATION RANK-1 393the latter providing direction of search W for a rank-1 matrix G in (876).An optimal solution to (877) has closed form (p.658). These convex problems(876) (877) are iterated with (872) until a rank-1 G matrix is found and theobjective of (876) vanishes.For a fixed number of equality constraints m and upper bound ρ , thefeasible set in rank-constrained semidefinite feasibility problem (869) growswith matrix dimension n . Empirically, this semidefinite feasibility problembecomes easier to solve by method of convex iteration as n increases. Wefind a good value of weight w ≈ 5 for randomized problems. Initial value ofdirection matrix W is not critical. With dimension n = 26 and numberof equality constraints m = 10, convergence to a rank-ρ = 2 solution tosemidefinite feasibility problem (869) is achieved for nearly all realizationsin less than 10 iterations. 4.64 For small n , stall detection is required; onenumerical implementation is disclosed on Wıκımization.This diagonalization decomposition technique is extensible to otherproblem types, of course, including optimization problems having nontrivialobjectives. Because of a greatly expanded feasible set, for example,find X ∈ S nsubject to A svec X ≽ bX ≽ 0rankX ≤ ρ(878)this relaxation of (869) [225,III] is more easily solved by convex iterationrank-1 . 4.65 Because of the nonconvex nature of a rank-constrained problem,more generally, there can be no proof of global convergence of convex iterationfrom an arbitrary initialization; although, local convergence is guaranteed byvirtue of monotonically nonincreasing real objective sequences. [258,1.2][42,1.1]4.64 This finding is significant in so far as Barvinok’s Proposition 2.9.3.0.1 predictsexistence of matrices having rank 4 or less in this intersection, but his upper bound canbe no tighter than 3.4.65 The inequality in A remains in the constraints after diagonalization.
- Page 341 and 342: 4.5. CONSTRAINING CARDINALITY 341we
- Page 343 and 344: 4.5. CONSTRAINING CARDINALITY 343fl
- Page 345 and 346: 4.5. CONSTRAINING CARDINALITY 345We
- 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: 4.8. CONVEX ITERATION RANK-1 391whi
- Page 395 and 396: Chapter 5Euclidean Distance MatrixT
- Page 397 and 398: 5.2. FIRST METRIC PROPERTIES 397to
- Page 399 and 400: 5.3. ∃ FIFTH EUCLIDEAN METRIC PRO
- 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
392 CHAPTER 4. SEMIDEFINITE PROGRAMMINGsolving it by convex iteration: Make the assignment⎡ ⎤q 1 [ q1 T · · · qρ T ]G = ⎣.⎦∈ S nρq ρ⎡⎤ ⎡Q 11 · · · Q 1ρ q 1 q1 T · · · q 1 qρT= ⎣ .... . ⎦⎣.... .Q T 1ρ · · · Q ρρ q ρ q1 T · · · q ρ qρT⎤⎦(874)Given ρ eigenvalues λ ⋆ i , then a problem equivalent to (873) is∥ ( ∥∥∥ ρ) ∑minimize A svec λ ⋆Q ii ∈S n , Q ij ∈R n×ni Q ii − b∥i=1subject to tr Q ii = 1, i=1... ρtr Q ij = 0,i