Invex function

In vector calculus, an invex function is a differentiable function f:ℝn→ℝ for which there exists a vector-valued function η such that

f(x)−f(u)≥η(x,u)⋅∇f(u),

for all x,u∈ℝn.

Invex functions were introduced by Hanson as a generalization of convex functions. Ben-Israel and Mond provided a simple proof that a function is invex if and only if every stationary point is a global minimum, a theorem first stated by Craven and Glover.

Hanson also showed that if the objective and the constraints of an optimization problem are invex with respect to the same function η(x,u), then the Karush–Kuhn–Tucker conditions are sufficient for a global minimum.

Type I invex functions

A slight generalization of invex functions called Type I invex functions are the most general class of functions for which the Karush–Kuhn–Tucker conditions are necessary and sufficient for a global minimum. Consider a mathematical program of the form

minf(x)s.t.g(x)≤0

where f:ℝn→ℝ and g:ℝn→ℝm are differentiable functions. Let F={x∈ℝn|g(x)≤0} denote the feasible region of this program. The function f is a Type I objective function and the function g is a Type I constraint function at x0 with respect to η if there exists a vector-valued function η defined on F such that

f(x)−f(x0)≥η(x)⋅∇f(x0)

and

−g(x0)≥η(x)⋅∇g(x0)

for all x∈F. Note that, unlike invexity, Type I invexity is defined relative to a point x0.

Theorem (Theorem 2.1 in): If f and g are Type I invex at a point x∗ with respect to η, and the Karush–Kuhn–Tucker conditions are satisfied at x∗, then x∗ is a global minimizer of f over F.

E-invex function

Let E from ℝn to ℝn and f from 𝕄 to ℝ be an E-differentiable function on a nonempty open set 𝕄⊂ℝn. Then f is said to be an E-invex function at u if there exists a vector valued function η such that

(f∘E)(x)−(f∘E)(u)≥∇(f∘E)(u)⋅η(E(x),E(u)),

for all x and u in 𝕄.

E-invex functions were introduced by Abdulaleem as a generalization of differentiable convex functions.

E-type I Functions

Let E:ℝn→ℝn, and M⊂ℝnbe an open E-invex set. A vector-valued pair (f,g), where f and g represent objective and constraint functions respectively, is said to be E-type I with respect to a vector-valued function η:M×M→ℝn, at u∈M, if the following inequalities hold for all x∈FE={x∈ℝn|g(E(x))≤0}:

fi(E(x))−fi(E(u))≥∇fi(E(u))⋅η(E(x),E(u)),

−gj(E(u))≥∇gj(E(u))⋅η(E(x),E(u)).

Remark 1.

If f and g are differentiable functions and E(x)=x (E is an identity map), then the definition of E-type I functions reduces to the definition of type I functions introduced by Rueda and Hanson.

See also