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.

2.4. HALFSPACE, HYPERPLANE 67<br />

H +<br />

a<br />

y p<br />

c<br />

y<br />

d<br />

∂H = {y | a T (y − y p )=0} = N(a T ) + y p<br />

∆<br />

H −<br />

N(a T )={y | a T y=0}<br />

Figure 21: Hyperplane illustrated ∂H is a line partially bounding halfspaces<br />

H − = {y | a T (y − y p )≤0} and H + = {y | a T (y − y p )≥0} in R 2 . Shaded is<br />

a rectangular piece of semi-infinite H − with respect to which vector a is<br />

outward-normal to bounding hyperplane; vector a is inward-normal with<br />

respect to H + . Halfspace H − contains nullspace N(a T ) (dashed line<br />

through origin) because a T y p > 0. Hyperplane, halfspace, and nullspace are<br />

each drawn truncated. Points c and d are equidistant from hyperplane, and<br />

vector c − d is normal to it. ∆ is distance from origin to hyperplane.

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

Saved successfully!

Ooh no, something went wrong!