Loading [MathJax]/jax/output/HTML-CSS/jax.js

Convex Optimization - Hull


Advertisements

The convex hull of a set of points in S is the boundary of the smallest convex region that contain all the points of S inside it or on its boundary.

OR

Let SRn The convex hull of S, denoted Co(S) by is the collection of all convex combination of S, i.e., xCo(S) if and only if xni=1λixi, where n1λi=1 and λi0xiS

Remark − Conves hull of a set of points in S in the plane defines a convex polygon and the points of S on the boundary of the polygon defines the vertices of the polygon.

Theorem Co(S)={x:x=ni=1λixi,xiS,ni=1λi=1,λi0} Show that a convex hull is a convex set.

Proof

Let x1,x2Co(S), then x1=ni=1λixi and x2=ni=1λγxi where ni=1λi=1,λi0 and ni=1γi=1,γi0

For θ(0,1),θx1+(1θ)x2=θni=1λixi+(1θ)ni=1γixi

θx1+(1θ)x2=ni=1λiθxi+ni=1γi(1θ)xi

θx1+(1θ)x2=ni=1[λiθ+γi(1θ)]xi

Considering the coefficients,

ni=1[λiθ+γi(1θ)]=θni=1λi+(1θ)ni=1γi=θ+(1θ)=1

Hence, θx1+(1θ)x2Co(S)

Thus, a convex hull is a convex set.