Pseudoconvex function

In convex analysis and the calculus of variations, branches of mathematics, a pseudoconvex function is a function that behaves like a convex function with respect to finding its local minima, but need not actually be convex. Informally, a differentiable function is pseudoconvex if it is increasing in any direction where it has a positive directional derivative. In convex analysis and the calculus of variations, branches of mathematics, a pseudoconvex function is a function that behaves like a convex function with respect to finding its local minima, but need not actually be convex. Informally, a differentiable function is pseudoconvex if it is increasing in any direction where it has a positive directional derivative. Formally, a real-valued differentiable function f {displaystyle f} defined on a (nonempty) convex open set X {displaystyle X} in the finite-dimensional Euclidean space R n {displaystyle mathbb {R} ^{n}} is said to be pseudoconvex if, for all x , y ∈ X {displaystyle x,yin X} such that ∇ f ( x ) ⋅ ( y − x ) ≥ 0 {displaystyle abla f(x)cdot (y-x)geq 0} , we have f ( y ) ≥ f ( x ) {displaystyle f(y)geq f(x)} . Here ∇ f {displaystyle abla f} is the gradient of f {displaystyle f} , defined by Every convex function is pseudoconvex, but the converse is not true. For example, the function ƒ(x) = x + x3 is pseudoconvex but not convex. Any pseudoconvex function is quasiconvex, but the converse is not true since the function ƒ(x) = x3 is quasiconvex but not pseudoconvex. Pseudoconvexity is primarily of interest because a point x* is a local minimum of a pseudoconvex function ƒ if and only if it is a stationary point of ƒ, which is to say that the gradient of ƒ vanishes at x*: The notion of pseudoconvexity can be generalized to nondifferentiable functions as follows. Given any function ƒ : X → R we can define the upper Dini derivative of ƒ by where u is any unit vector. The function is said to be pseudoconvex if it is increasing in any direction where the upper Dini derivative is positive. More precisely, this is characterized in terms of the subdifferential ∂ƒ as follows: A pseudoconcave function is a function whose negative is pseudoconvex. A pseudolinear function is a function that is both pseudoconvex and pseudoconcave. For example, linear–fractional programs have pseudolinear objective functions and linear–inequality constraints: These properties allow fractional–linear problems to be solved by a variant of the simplex algorithm (of George B. Dantzig). Given a vector-valued function η, there is a more general notion of η-pseudoconvexity and η-pseudolinearity wherein classical pseudoconvexity and pseudolinearity pertain to the case when η(x, y) = y - x.