10.03.2015 Views

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

502 CHAPTER 7. PROXIMITY PROBLEMS<br />

where we have made explicit an imposed upper bound ρ on affine dimension<br />

r = rankV T NDV N = rankV DV (947)<br />

that is benign when ρ =N−1, and where D = ∆ [d ij ] and ◦√ D = ∆ [ √ d ij ] .<br />

Problems (1215.2) and (1215.3) are Euclidean projections of a vectorized<br />

matrix H on an EDM cone (6.3), whereas problems (1215.1) and (1215.4)<br />

are Euclidean projections of a vectorized matrix −VHV on a PSD cone. 7.2<br />

Problem (1215.4) is not posed in the literature because it has limited<br />

theoretical foundation. 7.3<br />

Analytical solution to (1215.1) is known in closed form for any bound ρ<br />

although, as the problem is stated, it is a convex optimization only in the case<br />

ρ =N−1. We show in7.1.4 how (1215.1) becomes a convex optimization<br />

problem for any ρ when transformed to the spectral domain. When expressed<br />

as a function of point list in a matrix X as in (1213), problem (1215.2)<br />

is a variant of what is known in statistics literature as the stress problem.<br />

[46, p.34] [87] [307] Problems (1215.2) and (1215.3) are convex optimization<br />

problems in D for the case ρ =N−1 , wherein (1215.3) becomes equivalent<br />

to (1214). Even with the rank constraint removed from (1215.2), we will see<br />

that the convex problem remaining inherently minimizes affine dimension.<br />

Generally speaking, each problem in (1215) produces a different result<br />

because there is no isometry relating them. Of the various auxiliary<br />

V -matrices (B.4), the geometric centering matrix V (821) appears in the<br />

literature most often although V N (804) is the auxiliary matrix naturally<br />

consequent to Schoenberg’s seminal exposition [270]. Substitution of any<br />

auxiliary matrix or its pseudoinverse into these problems produces another<br />

valid problem.<br />

Substitution of VN<br />

T for left-hand V in (1215.1), in particular, produces a<br />

different result because<br />

minimize ‖−V (D − H)V ‖ 2 F<br />

D<br />

(1216)<br />

subject to D ∈ EDM N<br />

7.2 Because −VHV is orthogonal projection of −H on the geometric center subspace S N c<br />

(E.7.2.0.2), problems (1215.1) and (1215.4) may be interpreted as oblique (nonminimum<br />

distance) projections of −H on a positive semidefinite cone.<br />

7.3 D ∈ EDM N ⇒ ◦√ D ∈ EDM N , −V ◦√ DV ∈ S N + (5.10)

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

Saved successfully!

Ooh no, something went wrong!