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.

72 CHAPTER 2. CONVEX GEOMETRY<br />

A 1<br />

A 2<br />

A 3<br />

0<br />

Figure 23: Any one particular point of three points illustrated does not belong<br />

to affine hull A i (i∈1, 2, 3, each drawn truncated) of points remaining.<br />

Three corresponding vectors in R 2 are, therefore, affinely independent (but<br />

neither linearly or conically independent).<br />

Consequently, {x i , i=1... N} is an affinely independent set if and only if<br />

{x i −x 1 , i=2... N} is a linearly independent (l.i.) set. [[179,3] ] (Figure 23)<br />

X<br />

This is equivalent to the property that the columns of<br />

1 T (for X ∈ R n×N<br />

as in (68)) form a linearly independent set. [173,A.1.3]<br />

2.4.2.4 Preservation of affine independence<br />

Independence in the linear (2.1.2.1), affine, and conic (2.10.1) senses can<br />

be preserved under linear transformation. Suppose a matrix X ∈ R n×N (68)<br />

holds an affinely independent set in its columns. Consider a transformation<br />

T(X) : R n×N → R n×N ∆ = XY (116)<br />

where the given matrix Y ∆ = [y 1 y 2 · · · y N ]∈ R N×N is represented by linear<br />

operator T . Affine independence of {Xy i ∈ R n , i=1... N} demands (by<br />

definition (114)) there exist no solution ζ ∈ R N ζ T 1=1, ζ k = 0, to<br />

Xy i ζ i + · · · + Xy j ζ j − Xy k = 0, i≠ · · · ≠j ≠k = 1... N (117)

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

Saved successfully!

Ooh no, something went wrong!