v2010.10.26 - Convex Optimization

v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization

convexoptimization.com
from convexoptimization.com More from this publisher
12.07.2015 Views

474 CHAPTER 5. EUCLIDEAN DISTANCE MATRIXVertex-description of the dual spectral cone is, (314)K ∗ λ = K∗ M + [RN+R −] ∗+ ∂H ∗ ⊆ R N+1= { [ A T B T 1 −1 ] b | b ≽ 0 } =From (1116) and (445) we get a halfspace-description:{ }[ÂT ˆBT 1 −1]a | a ≽ 0(1120)K ∗ λ = {y ∈ R N+1 | (V T N [ÂT ˆBT ]) † V T N y ≽ 0} (1121)This polyhedral dual spectral cone K ∗ λ is closed, convex, full-dimensionalbecause K λ is pointed, but is not pointed because K λ is not full-dimensional.5.11.2.3 Unordered eigenspectraSpectral cones are not unique; eigenspectra ordering can be rendered benignwithin a cone by presorting a vector of eigenvalues into nonincreasingorder. 5.54 Then things simplify: Conditions (1107) now specify eigenvaluemembership to the spectral cone([ ]) [ ]0 1T RNλ1 −EDM N += ∩ ∂HR − (1122)= {ζ ∈ R N+1 | Bζ ≽ 0, 1 T ζ = 0}where B is defined in (1114), and ∂H in (1112). From (444) we get avertex-description for a pointed spectral cone not full-dimensional:([ ])0 1T {λ1 −EDM N = V N ( ˜BV}N ) † b | b ≽ 0{[ ] } (1123)I=−1 T b | b ≽ 0where V N ∈ R N+1×N and˜B ⎡⎢⎣e T 1e T2 .e T N⎤⎥⎦ ∈ RN×N+1 (1124)5.54 Eigenspectra ordering (represented by a cone having monotone description such as(1111)) becomes benign in (1332), for example, where projection of a given presorted vectoron the nonnegative orthant in a subspace is equivalent to its projection on the monotonenonnegative cone in that same subspace; equivalence is a consequence of presorting.

5.11. EDM INDEFINITENESS 475holds only those rows of B corresponding to conically independent rowsin BV N .For presorted eigenvalues, (1107) can be equivalently restatedD ∈ EDM N⇔⎧⎪⎨⎪⎩([ 0 1Tλ1 −DD ∈ S N h])∈[ ]RN+∩ ∂HR −(1125)Vertex-description of the dual spectral cone is, (314)([ ]) 0 1T ∗λ1 −EDM N =[ ]RN++ ∂H ∗ ⊆ R N+1R −= {[ B T 1 −1 ] b | b ≽ 0 } =From (445) we get a halfspace-description:{[ }˜BT 1 −1]a | a ≽ 0(1126)([ ]) 0 1T ∗λ1 −EDM N = {y ∈ R N+1 | (VN T ˜B T ) † VN Ty ≽ 0}= {y ∈ R N+1 | [I −1 ]y ≽ 0}(1127)This polyhedral dual spectral cone is closed, convex, full-dimensional but isnot pointed. (Notice that any nonincreasingly ordered eigenspectrum belongsto this dual spectral cone.)5.11.2.4 Dual cone versus dual spectral coneAn open question regards the relationship of convex cones and their duals tothe corresponding spectral cones and their duals. A positive semidefinitecone, for example, is selfdual. Both the nonnegative orthant and themonotone nonnegative cone are spectral cones for it. When we considerthe nonnegative orthant, then that spectral cone for the selfdual positivesemidefinite cone is also selfdual.

5.11. EDM INDEFINITENESS 475holds only those rows of B corresponding to conically independent rowsin BV N .For presorted eigenvalues, (1107) can be equivalently restatedD ∈ EDM N⇔⎧⎪⎨⎪⎩([ 0 1Tλ1 −DD ∈ S N h])∈[ ]RN+∩ ∂HR −(1125)Vertex-description of the dual spectral cone is, (314)([ ]) 0 1T ∗λ1 −EDM N =[ ]RN++ ∂H ∗ ⊆ R N+1R −= {[ B T 1 −1 ] b | b ≽ 0 } =From (445) we get a halfspace-description:{[ }˜BT 1 −1]a | a ≽ 0(1126)([ ]) 0 1T ∗λ1 −EDM N = {y ∈ R N+1 | (VN T ˜B T ) † VN Ty ≽ 0}= {y ∈ R N+1 | [I −1 ]y ≽ 0}(1127)This polyhedral dual spectral cone is closed, convex, full-dimensional but isnot pointed. (Notice that any nonincreasingly ordered eigenspectrum belongsto this dual spectral cone.)5.11.2.4 Dual cone versus dual spectral coneAn open question regards the relationship of convex cones and their duals tothe corresponding spectral cones and their duals. A positive semidefinitecone, for example, is selfdual. Both the nonnegative orthant and themonotone nonnegative cone are spectral cones for it. When we considerthe nonnegative orthant, then that spectral cone for the selfdual positivesemidefinite cone is also selfdual.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!