v2009.01.01 - Convex Optimization
v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization
170 CHAPTER 2. CONVEX GEOMETRY 2.13.8 Biorthogonal expansion, derivation Biorthogonal expansion is a means for determining coordinates in a pointed conic coordinate system characterized by a nonorthogonal basis. Study of nonorthogonal bases invokes pointed polyhedral cones and their duals; extreme directions of a cone K are assumed to constitute the basis while those of the dual cone K ∗ determine coordinates. Unique biorthogonal expansion with respect to K depends upon existence of its linearly independent extreme directions: Polyhedral cone K must be pointed; then it possesses extreme directions. Those extreme directions must be linearly independent to uniquely represent any point in their span. We consider nonempty pointed polyhedral cone K having possibly empty interior; id est, we consider a basis spanning a subspace. Then we need only observe that section of dual cone K ∗ in the affine hull of K because, by expansion of x , membership x∈aff K is implicit and because any breach of the ordinary dual cone into ambient space becomes irrelevant (2.13.9.3). Biorthogonal expansion x = XX † x ∈ aff K = aff cone(X) (357) is expressed in the extreme directions {Γ i } of K arranged columnar in under assumption of biorthogonality X = [ Γ 1 Γ 2 · · · Γ N ] ∈ R n×N (253) X † X = I (358) where † denotes matrix pseudoinverse (E). We therefore seek, in this section, a vertex-description for K ∗ ∩ aff K in terms of linearly independent dual generators {Γ ∗ i }⊂aff K in the same finite quantity 2.63 as the extreme directions {Γ i } of K = cone(X) = {Xa | a ≽ 0} ⊆ R n (94) We assume the quantity of extreme directions N does not exceed the dimension n of ambient vector space because, otherwise, the expansion could not be unique; id est, assume N linearly independent extreme directions 2.63 When K is contained in a proper subspace of R n , the ordinary dual cone K ∗ will have more generators in any minimal set than K has extreme directions.
2.13. DUAL CONE & GENERALIZED INEQUALITY 171 hence N ≤ n (X skinny 2.64 -or-square full-rank). In other words, fat full-rank matrix X is prohibited by uniqueness because of the existence of an infinity of right-inverses; polyhedral cones whose extreme directions number in excess of the ambient space dimension are precluded in biorthogonal expansion. 2.13.8.1 x ∈ K Suppose x belongs to K ⊆ R n . Then x =Xa for some a≽0. Vector a is unique only when {Γ i } is a linearly independent set. 2.65 Vector a∈ R N can take the form a =Bx if R(B)= R N . Then we require Xa =XBx = x and Bx=BXa = a . The pseudoinverse B =X † ∈ R N×n (E) is suitable when X is skinny-or-square and full-rank. In that case rankX =N , and for all c ≽ 0 and i=1... N a ≽ 0 ⇔ X † Xa ≽ 0 ⇔ a T X T X †T c ≥ 0 ⇔ Γ T i X †T c ≥ 0 (359) The penultimate inequality follows from the generalized inequality and membership corollary, while the last inequality is a consequence of that corollary’s discretization (2.13.4.2.1). 2.66 From (359) and (347) we deduce K ∗ ∩ aff K = cone(X †T ) = {X †T c | c ≽ 0} ⊆ R n (360) is the vertex-description for that section of K ∗ in the affine hull of K because R(X †T ) = R(X) by definition of the pseudoinverse. From (280), we know 2.64 “Skinny” meaning thin; more rows than columns. 2.65 Conic independence alone (2.10) is insufficient to guarantee uniqueness. 2.66 a ≽ 0 ⇔ a T X T X †T c ≥ 0 ∀(c ≽ 0 ⇔ a T X T X †T c ≥ 0 ∀a ≽ 0) ∀(c ≽ 0 ⇔ Γ T i X†T c ≥ 0 ∀i) Intuitively, any nonnegative vector a is a conic combination of the standard basis {e i ∈ R N }; a≽0 ⇔ a i e i ≽0 for all i. The last inequality in (359) is a consequence of the fact that x=Xa may be any extreme direction of K , in which case a is a standard basis vector; a = e i ≽0. Theoretically, because c ≽ 0 defines a pointed polyhedral cone (in fact, the nonnegative orthant in R N ), we can take (359) one step further by discretizing c : a ≽ 0 ⇔ Γ T i Γ ∗ j ≥ 0 for i,j =1... N ⇔ X † X ≥ 0 In words, X † X must be a matrix whose entries are each nonnegative.
- 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.10. CONIC INDEPENDENCE (C.I.) 127
- Page 129 and 130: 2.10. CONIC INDEPENDENCE (C.I.) 129
- Page 131 and 132: 2.10. CONIC INDEPENDENCE (C.I.) 131
- Page 133 and 134: 2.12. CONVEX POLYHEDRA 133 It follo
- Page 135 and 136: 2.12. CONVEX POLYHEDRA 135 Coeffici
- Page 137 and 138: 2.12. CONVEX POLYHEDRA 137 2.12.3 U
- Page 139 and 140: 2.12. CONVEX POLYHEDRA 139
- Page 141 and 142: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 143 and 144: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 145 and 146: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 147 and 148: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 149 and 150: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 151 and 152: 2.13. DUAL CONE & GENERALIZED INEQU
- 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: 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
- Page 187 and 188: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 189 and 190: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 191 and 192: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 193 and 194: 2.13. DUAL CONE & GENERALIZED INEQU
- Page 195 and 196: Chapter 3 Geometry of convex functi
- Page 197 and 198: 3.1. CONVEX FUNCTION 197 f 1 (x) f
- Page 199 and 200: 3.1. CONVEX FUNCTION 199 3.1.3 norm
- Page 201 and 202: 3.1. CONVEX FUNCTION 201 A B 1 Figu
- Page 203 and 204: 3.1. CONVEX FUNCTION 203 k/m 1 0.9
- Page 205 and 206: k∑ i=1 3.1. CONVEX FUNCTION 205 S
- Page 207 and 208: 3.1. CONVEX FUNCTION 207 rather x >
- Page 209 and 210: 3.1. CONVEX FUNCTION 209 rather ] x
- Page 211 and 212: 3.1. CONVEX FUNCTION 211 3.1.6.0.2
- Page 213 and 214: 3.1. CONVEX FUNCTION 213 q(x) f(x)
- Page 215 and 216: 3.1. CONVEX FUNCTION 215 3.1.7.0.2
- Page 217 and 218: 3.1. CONVEX FUNCTION 217 We learned
- Page 219 and 220: 3.1. CONVEX FUNCTION 219 Since opti
170 CHAPTER 2. CONVEX GEOMETRY<br />
2.13.8 Biorthogonal expansion, derivation<br />
Biorthogonal expansion is a means for determining coordinates in a pointed<br />
conic coordinate system characterized by a nonorthogonal basis. Study<br />
of nonorthogonal bases invokes pointed polyhedral cones and their duals;<br />
extreme directions of a cone K are assumed to constitute the basis while<br />
those of the dual cone K ∗ determine coordinates.<br />
Unique biorthogonal expansion with respect to K depends upon existence<br />
of its linearly independent extreme directions: Polyhedral cone K must be<br />
pointed; then it possesses extreme directions. Those extreme directions must<br />
be linearly independent to uniquely represent any point in their span.<br />
We consider nonempty pointed polyhedral cone K having possibly empty<br />
interior; id est, we consider a basis spanning a subspace. Then we need<br />
only observe that section of dual cone K ∗ in the affine hull of K because, by<br />
expansion of x , membership x∈aff K is implicit and because any breach<br />
of the ordinary dual cone into ambient space becomes irrelevant (2.13.9.3).<br />
Biorthogonal expansion<br />
x = XX † x ∈ aff K = aff cone(X) (357)<br />
is expressed in the extreme directions {Γ i } of K arranged columnar in<br />
under assumption of biorthogonality<br />
X = [ Γ 1 Γ 2 · · · Γ N ] ∈ R n×N (253)<br />
X † X = I (358)<br />
where † denotes matrix pseudoinverse (E). We therefore seek, in this<br />
section, a vertex-description for K ∗ ∩ aff K in terms of linearly independent<br />
dual generators {Γ ∗ i }⊂aff K in the same finite quantity 2.63 as the extreme<br />
directions {Γ i } of<br />
K = cone(X) = {Xa | a ≽ 0} ⊆ R n (94)<br />
We assume the quantity of extreme directions N does not exceed the<br />
dimension n of ambient vector space because, otherwise, the expansion could<br />
not be unique; id est, assume N linearly independent extreme directions<br />
2.63 When K is contained in a proper subspace of R n , the ordinary dual cone K ∗ will have<br />
more generators in any minimal set than K has extreme directions.