
- 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
Strongly Quasiconvex Function
Let f:S→Rn and S be a non-empty convex set in Rn then f is strongly quasiconvex function if for any x1,x2∈S with (x1)≠(x2), we have $f\left ( \lambda x_1+\left ( 1-\lambda \right )x_2 \right )
Theorem
A quasiconvex function f:S→Rn on a non-empty convex set S in Rn is strongly quasiconvex function if it is not constant on a line segment joining any points of S.
Proof
Let f is quasiconvex function and it is not constant on a line segment joining any points of S.
Suppose f is not strongly quasiconvex function.
There exist x1,x2∈S with x1≠x2 such that
f(z)≥max{f(x1),f(x2)},∀z=λx1+(1−λ)x2,λ∈(0,1)
⇒f(x1)≤f(z) and f(x2)≤f(z)
Since f is not constant in [x1,z] and [z,x2]
So there exists u∈[x1,z] and v=[z,x2]
⇒u=μ1x1+(1−μ1)z,v=μ2z+(1−μ2)x2
Since f is quasiconvex,
⇒f(u)≤max{f(x1),f(z)}=f(z)andf(v)≤max{f(z),f(x2)}
⇒f(u)≤f(z)andf(v)≤f(z)
⇒max{f(u),f(v)}≤f(z)
But z is any point between u and v, if any of them are equal, then f is constant.
Therefore, max{f(u),f(v)}≤f(z)
which contradicts the quasiconvexity of f as z∈[u,v].
Hence f is strongly quasiconvex function.
Theorem
Let f:S→Rn and S be a non-empty convex set in Rn. If ˆx is local optimal solution, then ˆx is unique global optimal solution.
Proof
Since a strong quasiconvex function is also strictly quasiconvex function, thus a local optimal solution is global optimal solution.
Uniqueness − Let f attains global optimal solution at two points u,v∈S
⇒f(u)≤f(x).∀x∈Sandf(v)≤f(x).∀x∈S
If u is global optimal solution, f(u)≤f(v) and f(v)≤f(u)⇒f(u)=f(v)
$$f\left ( \lambda u+\left ( 1-\lambda\right )v\right )
which is a contradiction.
Hence there exists only one global optimal solution.
Remarks
- A strongly quasiconvex function is also strictly quasiconvex fucntion.
- A strictly convex function may or may not be strongly quasiconvex.
- A differentiable strictly convex is strongly quasiconvex.