10.03.2015 Views

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

499<br />

H<br />

S N h<br />

0<br />

EDM N<br />

K = S N h ∩ R N×N<br />

+<br />

Figure 129: Pseudo-Venn diagram from Figure 128 showing elbow placed<br />

in path of projection of H on EDM N ⊂ S N h by an optimization problem<br />

demanding nonnegative input matrix H . The first two line segments<br />

leading away from H result from correct order-of-projection required to<br />

provide nonnegative H prior to optimization. Were H nonnegative, then its<br />

projection on S N h would instead belong to K ; making the elbow disappear.<br />

(confer Figure 141)

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

Saved successfully!

Ooh no, something went wrong!