- Home
- Introduction
- Linear Programming
- Norm
- Inner Product
- Minima and Maxima
- Convex Set
- Affine Set
- Convex Hull
- Caratheodory Theorem
- Weierstrass Theorem
- Closest Point Theorem
- Fundamental Separation Theorem
- Convex Cones
- Polar Cone
- Conic Combination
- Polyhedral Set
- Extreme point of a convex set
- Direction
- Convex & Concave Function
- Jensen's Inequality
- Differentiable Convex Function
- Sufficient & Necessary Conditions for Global Optima
- Quasiconvex & Quasiconcave functions
- Differentiable Quasiconvex Function
- Strictly Quasiconvex Function
- Strongly Quasiconvex Function
- Pseudoconvex Function
- Convex Programming Problem
- Fritz-John Conditions
- Karush-Kuhn-Tucker Optimality Necessary Conditions
- Algorithms for Convex Problems
Convex Optimization - affine Set
A set A is said to be an affine set if for any two distinct points, the line passing through these points lie in the set A.
Note −
S is an affine set if and only if it contains every affine combination of its points.
-
Empty and singleton sets are both affine and convex set.
For example, solution of a linear equation is an affine set.
Proof
Let S be the solution of a linear equation.
By definition, S={x∈Rn:Ax=b}
Let x1,x2∈S⇒Ax1=b and Ax2=b
To prove : A[θx1+(1−θ)x2]=b,∀θ∈(0,1)
A[θx1+(1−θ)x2]=θAx1+(1−θ)Ax2=θb+(1−θ)b=b
Thus S is an affine set.
Theorem
If C is an affine set and x0∈C, then the set V=C−x0={x−x0:x∈C} is a subspace of C.
Proof
Let x1,x2∈V
To show: αx1+βx2∈V for some α,β
Now, x1+x0∈C and x2+x0∈C by definition of V
Now, αx1+βx2+x0=α(x1+x0)+β(x2+x0)+(1−α−β)x0
But α(x1+x0)+β(x2+x0)+(1−α−β)x0∈C because C is an affine set.
Therefore, αx1+βx2∈V
Hence proved.