Convex function - Wikiwand
In mathematics, a real-valued function is called convex if the line segment between any two distinct points on the graph of the function lies above or on the graph between the two points. Equivalently, a function is convex if its epigraph (the set of points on or above the graph of the function) is a convex set.
In simple terms, a convex function graph is shaped like a cup (or a straight line like a linear function), while a concave function's graph is shaped like a cap
.




A twice-differentiable function of a single variable is convex if and only if its second derivative is nonnegative on its entire domain.[1] Well-known examples of convex functions of a single variable include a linear function (where
is a real number), a quadratic function
(
as a nonnegative real number) and an exponential function
(
as a nonnegative real number).
Convex functions play an important role in many areas of mathematics. They are especially important in the study of optimization problems where they are distinguished by a number of convenient properties. For instance, a strictly convex function on an open set has no more than one minimum. Even in infinite-dimensional spaces, under suitable additional hypotheses, convex functions continue to satisfy such properties and as a result, they are the most well-understood functionals in the calculus of variations. In probability theory, a convex function applied to the expected value of a random variable is always bounded above by the expected value of the convex function of the random variable. This result, known as Jensen's inequality, can be used to deduce inequalities such as the arithmetic–geometric mean inequality and Hölder's inequality.
Let be a convex subset of a real vector space and let
be a function.
Then is called convex if and only if any of the following equivalent conditions hold:
- For all
and all
:
The right hand side represents the straight line between
and
in the graph of
as a function of
increasing
from
to
or decreasing
from
to
sweeps this line. Similarly, the argument of the function
in the left hand side represents the straight line between
and
in
or the
-axis of the graph of
So, this condition requires that the straight line between any pair of points on the curve of
be above or just meeting the graph.[2]
- For all
and all
such that
:
The difference of this second condition with respect to the first condition above is that this condition does not include the intersection points (for example,
and
) between the straight line passing through a pair of points on the curve of
(the straight line is represented by the right hand side of this condition) and the curve of
the first condition includes the intersection points as it becomes
or
at
or
or
In fact, the intersection points do not need to be considered in a condition of convex using
because
and
are always true (so not useful to be a part of a condition).
The second statement characterizing convex functions that are valued in the real line is also the statement used to define convex functions that are valued in the extended real number line
where such a function
is allowed to take
as a value. The first statement is not used because it permits
to take
or
as a value, in which case, if
or
respectively, then
would be undefined (because the multiplications
and
are undefined). The sum
is also undefined so a convex extended real-valued function is typically only allowed to take exactly one of
and
as a value.
The second statement can also be modified to get the definition of strict convexity, where the latter is obtained by replacing with the strict inequality
Explicitly, the map
is called strictly convex if and only if for all real
and all
such that
:
A strictly convex function is a function that the straight line between any pair of points on the curve
is above the curve
except for the intersection points between the straight line and the curve. An example of a function which is convex but not strictly convex is
. This function is not strictly convex because any two points sharing an x coordinate will have a straight line between them, while any two points NOT sharing an x coordinate will have a greater value of the function than the points between them.
The function is said to be concave (resp. strictly concave) if
(
multiplied by −1) is convex (resp. strictly convex).
The term convex is often referred to as convex down or concave upward, and the term concave is often referred as concave down or convex upward.[3][4][5] If the term "convex" is used without an "up" or "down" keyword, then it refers strictly to a cup shaped graph . As an example, Jensen's inequality refers to an inequality involving a convex or convex-(down), function.[6]
Many properties of convex functions have the same simple formulation for functions of many variables as for functions of one variable. See below the properties for the case of many variables, as some of them are not listed for functions of one variable.
Functions of one variable
- Suppose
is a function of one real variable defined on an interval, and let
(note that
is the slope of the purple line in the first drawing; the function
is symmetric in
means that
does not change by exchanging
and
).
is convex if and only if
is monotonically non-decreasing in
for every fixed
(or vice versa). This characterization of convexity is quite useful to prove the following results.
- A convex function
of one real variable defined on some open interval
is continuous on
admits left and right derivatives, and these are monotonically non-decreasing. In addition, the left derivative is left-continuous and the right-derivative is right-continuous. As a consequence,
is differentiable at all but at most countably many points, the set on which
is not differentiable can however still be dense. If
is closed, then
may fail to be continuous at the endpoints of
(an example is shown in the examples section).
- A differentiable function of one variable is convex on an interval if and only if its derivative is monotonically non-decreasing on that interval. If a function is differentiable and convex then it is also continuously differentiable.
- A differentiable function of one variable is convex on an interval if and only if its graph lies above all of its tangents:[7]: 69
for all
and
in the interval.
- A twice differentiable function of one variable is convex on an interval if and only if its second derivative is non-negative there; this gives a practical test for convexity. Visually, a twice differentiable convex function "curves up", without any bends the other way (inflection points). If its second derivative is positive at all points then the function is strictly convex, but the converse does not hold. For example, the second derivative of
is
, which is zero for
but
is strictly convex.
- If
is a convex function of one real variable, and
, then
is superadditive on the positive reals, that is
for positive real numbers
and
.
Functions of several variables
The concept of strong convexity extends and parametrizes the notion of strict convexity. Intuitively, a strongly-convex function is a function that grows as fast as a quadratic function.[11] A strongly convex function is also strictly convex, but not vice versa. If a one-dimensional function is twice continuously differentiable and the domain is the real line, then we can characterize it as follows:
For example, let be strictly convex, and suppose there is a sequence of points
such that
. Even though
, the function is not strongly convex because
will become arbitrarily small.
More generally, a differentiable function is called strongly convex with parameter
if the following inequality holds for all points
in its domain:[12]
or, more generally,
where
is any inner product, and
is the corresponding norm. Some authors, such as [13] refer to functions satisfying this inequality as elliptic functions.
An equivalent condition is the following:[14]
It is not necessary for a function to be differentiable in order to be strongly convex. A third definition[14] for a strongly convex function, with parameter is that, for all
in the domain and
Notice that this definition approaches the definition for strict convexity as and is identical to the definition of a convex function when
Despite this, functions exist that are strictly convex but are not strongly convex for any
(see example below).
If the function is twice continuously differentiable, then it is strongly convex with parameter
if and only if
for all
in the domain, where
is the identity and
is the Hessian matrix, and the inequality
means that
is positive semi-definite. This is equivalent to requiring that the minimum eigenvalue of
be at least
for all
If the domain is just the real line, then
is just the second derivative
so the condition becomes
. If
then this means the Hessian is positive semidefinite (or if the domain is the real line, it means that
), which implies the function is convex, and perhaps strictly convex, but not strongly convex.
Assuming still that the function is twice continuously differentiable, one can show that the lower bound of implies that it is strongly convex. Using Taylor's Theorem there exists
such that
Then
by the assumption about the eigenvalues, and hence we recover the second strong convexity equation above.
A function is strongly convex with parameter m if and only if the function
is convex.
A twice continuously differentiable function on a compact domain
that satisfies
for all
is strongly convex. The proof of this statement follows from the extreme value theorem, which states that a continuous function on a compact set has a maximum and minimum.
Strongly convex functions are in general easier to work with than convex or strictly convex functions, since they are a smaller class. Like strictly convex functions, strongly convex functions have unique minima on compact sets.
Properties of strongly-convex functions
If f is a strongly-convex function with parameter m, then:[15]: Prop.6.1.4
- For every real number r, the level set {x | f(x) ≤ r} is compact.
- The function f has a unique global minimum on Rn.
A uniformly convex function,[16][17] with modulus , is a function
that, for all
in the domain and
satisfies
where
is a function that is non-negative and vanishes only at 0. This is a generalization of the concept of strongly convex function; by taking
we recover the definition of strong convexity.
It is worth noting that some authors require the modulus to be an increasing function,[17] but this condition is not required by all authors.[16]
Functions of one variable
- The function
has
, so f is a convex function. It is also strongly convex (and hence strictly convex too), with strong convexity constant 2.
- The function
has
, so f is a convex function. It is strictly convex, even though the second derivative is not strictly positive at all points. It is not strongly convex.
- The absolute value function
is convex (as reflected in the triangle inequality), even though it does not have a derivative at the point
It is not strictly convex.
- The function
for
is convex.
- The exponential function
is convex. It is also strictly convex, since
, but it is not strongly convex since the second derivative can be arbitrarily close to zero. More generally, the function
is logarithmically convex if
is a convex function. The term "superconvex" is sometimes used instead.[18]
- The function
with domain [0,1] defined by
for
is convex; it is continuous on the open interval
but not continuous at 0 and 1.
- The function
has second derivative
; thus it is convex on the set where
and concave on the set where
- Examples of functions that are monotonically increasing but not convex include
and
.
- Examples of functions that are convex but not monotonically increasing include
and
.
- The function
has
which is greater than 0 if
so
is convex on the interval
. It is concave on the interval
.
- The function
with
, is convex on the interval
and convex on the interval
, but not convex on the interval
, because of the singularity at
Functions of n variables
- Concave function
- Convex analysis
- Convex conjugate
- Convex curve
- Convex optimization
- Geodesic convexity
- Hahn–Banach theorem
- Hermite–Hadamard inequality
- Invex function
- Jensen's inequality
- K-convex function
- Kachurovskii's theorem, which relates convexity to monotonicity of the derivative
- Karamata's inequality
- Logarithmically convex function
- Pseudoconvex function
- Quasiconvex function
- Subderivative of a convex function