- Subderivative
In
mathematics , the concepts of subderivative, subgradient, and subdifferential arise inconvex analysis , that is, in the study ofconvex functions , often in connection toconvex optimization .Let "f":"I"→R be a real-valued convex function defined on an
open interval of the real line. Such a function may not necessarily be differentiable at all points, as for example, theabsolute value , "f"("x")=|"x"|. However, as seen in the picture on the right (and which can be proved rigorously), for any "x"0 in the domain of the function one can draw a line which goes through the point ("x"0, "f"("x"0)) and which is everywhere either touching or below the graph of "f". Theslope of such a line is called a "subderivative" (because the line is under the graph of "f").Definition
Rigorously, a "subderivative" of a convex function "f":"I"→R at a point "x"0 in the open interval "I" is a real number "c" such that :for all "x" in "I". One may show that the set of subderivatives at "x"0 is a nonempty
closed interval ["a", "b"] , where "a" and "b" are theone-sided limit s:
:
which are guaranteed to exist and satisfy "a" ≤ "b".
The set ["a", "b"] of all subderivatives is called the subdifferential of the function "f" at "x"0.
Examples
Consider the function "f"("x")=|"x"| which is convex. Then, the subdifferential at the origin is the interval [−1, 1] . The subdifferential at any point "x"0<0 is the
singleton set {−1}, while the subdifferential at any point "x"0>0 is the singleton {1}.Properties
* A convex function "f":"I"→R is differentiable at "x"0
if and only if the subdifferential is made up of only one point, which is the derivative at "x"0.* A point "x"0 is a
global minimum of a convex function "f" if and only if zero is contained in the subdifferential, that is, in the figure above, one may draw a horizontal "subtangent line" to the graph of "f" at ("x"0, "f"("x"0)). This last property is a generalization of the fact that the derivative of a function differentiable at a local minimum is zero.The subgradient
The concepts of subderivative and subdifferential can be generalized to functions of several variables. If "f":"U"→ R is a real-valued convex function defined on a convex
open set in theEuclidean space R"n", a vector "v" in that space is called a subgradient at a point "x"0 in "U" if for any "x" in "U" one has:where the dot denotes thedot product . The set of all subgradients at "x"0 is called the subdifferential at "x"0 and is denoted ∂"f"("x"0). The subdifferential is always a nonempty convexcompact set .These concepts generalize further to convex functions "f":"U"→ R on a
convex set in alocally convex space "V". A functional "v"∗ in thedual space V∗ is called "subgradient" at "x"0 in "U" if:The set of all subgradients at "x"0 is called the subdifferential at "x"0 and is again denoted ∂"f"("x"0). The subdifferential is always a convexclosed set . It can be an empty set; consider for example anunbounded operator , which is convex, but has no subgradient. If "f" is continuous, the subdifferential is nonempty.ee also
*
Weak derivative References
* Jean-Baptiste Hiriart-Urruty, Claude Lemaréchal, "Fundamentals of Convex Analysis", Springer, 2001. ISBN 3-540-42205-6.
Wikimedia Foundation. 2010.