v2010.10.26 - Convex Optimization
v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization
136 CHAPTER 2. CONVEX GEOMETRYRank is a quasiconcave function on S M + because the right-hand inequality in(1466) has the concave form (643); videlicet, Lemma 2.9.2.9.1. From this example we see, unlike convex functions, quasiconvex functionsare not necessarily continuous. (3.8) We also glean:2.9.2.9.3 Theorem. Convex subsets of positive semidefinite cone.Subsets of the positive semidefinite cone S M + , for 0≤ρ≤MS M +(ρ) {X ∈ S M + | rankX ≥ ρ} (260)are pointed convex cones, but not closed unless ρ = 0 ; id est, S M +(0)= S M + .⋄Proof. Given ρ , a subset S M +(ρ) is convex if and only if convexcombination of any two members has rank at least ρ . That is confirmedby applying identity (257) from Lemma 2.9.2.9.1 to (1466); id est, forA,B ∈ S M +(ρ) on closed interval [0, 1] of µrank(µA + (1 −µ)B) ≥ min{rankA, rankB} (261)It can similarly be shown, almost identically to proof of the lemma, any coniccombination of A,B in subset S M +(ρ) remains a member; id est, ∀ζ, ξ ≥0rank(ζA + ξB) ≥ min{rank(ζA), rank(ξB)} (262)Therefore, S M +(ρ) is a convex cone.Another proof of convexity can be made by projection arguments:2.9.2.10 Projection on S M +(ρ)Because these cones S M +(ρ) indexed by ρ (260) are convex, projection onthem is straightforward. Given a symmetric matrix H having diagonalizationH QΛQ T ∈ S M (A.5.1) with eigenvalues Λ arranged in nonincreasingorder, then its Euclidean projection (minimum-distance projection) on S M +(ρ)P S M+ (ρ)H = QΥ ⋆ Q T (263)
2.9. POSITIVE SEMIDEFINITE (PSD) CONE 137corresponds to a map of its eigenvalues:Υ ⋆ ii ={ max {ǫ , Λii } , i=1... ρmax {0, Λ ii } , i=ρ+1... M(264)where ǫ is positive but arbitrarily close to 0.2.9.2.10.1 Exercise. Projection on open convex cones.Prove (264) using Theorem E.9.2.0.1.Because each H ∈ S M has unique projection on S M +(ρ) (despite possibilityof repeated eigenvalues in Λ), we may conclude it is a convex set by theBunt-Motzkin theorem (E.9.0.0.1).Compare (264) to the well-known result regarding Euclidean projectionon a rank ρ subset of the positive semidefinite cone (2.9.2.1)S M + \ S M +(ρ + 1) = {X ∈ S M + | rankX ≤ ρ} (216)P S M+ \S M + (ρ+1) H = QΥ ⋆ Q T (265)As proved in7.1.4, this projection of H corresponds to the eigenvalue mapΥ ⋆ ii ={ max {0 , Λii } , i=1... ρ0 , i=ρ+1... M(1341)Together these two results (264) and (1341) mean: A higher-rank solutionto projection on the positive semidefinite cone lies arbitrarily close to anygiven lower-rank projection, but not vice versa. Were the number ofnonnegative eigenvalues in Λ known a priori not to exceed ρ , then thesetwo different projections would produce identical results in the limit ǫ→0.2.9.2.11 Uniting constituentsInterior of the PSD cone int S M + is convex by Theorem 2.9.2.9.3, for example,because all positive semidefinite matrices having rank M constitute the coneinterior.All positive semidefinite matrices of rank less than M constitute the coneboundary; an amalgam of positive semidefinite matrices of different rank.Thus each nonconvex subset of positive semidefinite matrices, for 0
- Page 85 and 86: 2.5. SUBSPACE REPRESENTATIONS 852.5
- Page 87 and 88: 2.5. SUBSPACE REPRESENTATIONS 87(Ex
- Page 89 and 90: 2.5. SUBSPACE REPRESENTATIONS 89(a)
- Page 91 and 92: 2.5. SUBSPACE REPRESENTATIONS 91are
- Page 93 and 94: 2.6. EXTREME, EXPOSED 93A one-dimen
- Page 95 and 96: 2.6. EXTREME, EXPOSED 952.6.1.1 Den
- Page 97 and 98: 2.7. CONES 97X(a)00(b)XFigure 33: (
- Page 99 and 100: 2.7. CONES 99XXFigure 37: Truncated
- Page 101 and 102: 2.7. CONES 101Figure 39: Not a cone
- Page 103 and 104: 2.7. CONES 103cone that is a halfli
- Page 105 and 106: 2.7. CONES 105A pointed closed conv
- Page 107 and 108: 2.8. CONE BOUNDARY 107That means th
- Page 109 and 110: 2.8. CONE BOUNDARY 1092.8.1.1 extre
- Page 111 and 112: 2.8. CONE BOUNDARY 1112.8.2 Exposed
- Page 113 and 114: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 115 and 116: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 117 and 118: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 119 and 120: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 121 and 122: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 123 and 124: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 125 and 126: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 127 and 128: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 129 and 130: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 131 and 132: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 133 and 134: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 135: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 139 and 140: 2.9. POSITIVE SEMIDEFINITE (PSD) CO
- Page 141 and 142: 2.10. CONIC INDEPENDENCE (C.I.) 141
- Page 143 and 144: 2.10. CONIC INDEPENDENCE (C.I.) 143
- Page 145 and 146: 2.10. CONIC INDEPENDENCE (C.I.) 145
- Page 147 and 148: 2.12. CONVEX POLYHEDRA 147all dimen
- Page 149 and 150: 2.12. CONVEX POLYHEDRA 149convex po
- Page 151 and 152: 2.12. CONVEX POLYHEDRA 1512.12.2.2
- Page 153 and 154: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 155 and 156: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 157 and 158: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 159 and 160: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 161 and 162: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 163 and 164: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 165 and 166: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 167 and 168: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 169 and 170: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 171 and 172: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 173 and 174: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 175 and 176: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 177 and 178: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 179 and 180: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 181 and 182: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 183 and 184: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 185 and 186: 2.13. DUAL CONE & GENERALIZED INEQU
2.9. POSITIVE SEMIDEFINITE (PSD) CONE 137corresponds to a map of its eigenvalues:Υ ⋆ ii ={ max {ǫ , Λii } , i=1... ρmax {0, Λ ii } , i=ρ+1... M(264)where ǫ is positive but arbitrarily close to 0.2.9.2.10.1 Exercise. Projection on open convex cones.Prove (264) using Theorem E.9.2.0.1.Because each H ∈ S M has unique projection on S M +(ρ) (despite possibilityof repeated eigenvalues in Λ), we may conclude it is a convex set by theBunt-Motzkin theorem (E.9.0.0.1).Compare (264) to the well-known result regarding Euclidean projectionon a rank ρ subset of the positive semidefinite cone (2.9.2.1)S M + \ S M +(ρ + 1) = {X ∈ S M + | rankX ≤ ρ} (216)P S M+ \S M + (ρ+1) H = QΥ ⋆ Q T (265)As proved in7.1.4, this projection of H corresponds to the eigenvalue mapΥ ⋆ ii ={ max {0 , Λii } , i=1... ρ0 , i=ρ+1... M(1341)Together these two results (264) and (1341) mean: A higher-rank solutionto projection on the positive semidefinite cone lies arbitrarily close to anygiven lower-rank projection, but not vice versa. Were the number ofnonnegative eigenvalues in Λ known a priori not to exceed ρ , then thesetwo different projections would produce identical results in the limit ǫ→0.2.9.2.11 Uniting constituentsInterior of the PSD cone int S M + is convex by Theorem 2.9.2.9.3, for example,because all positive semidefinite matrices having rank M constitute the coneinterior.All positive semidefinite matrices of rank less than M constitute the coneboundary; an amalgam of positive semidefinite matrices of different rank.Thus each nonconvex subset of positive semidefinite matrices, for 0