Subderivative

Rigorously, a subderivative of a convex function ${\displaystyle f:I\to \mathbb {R} }$  at a point ${\displaystyle x_{0}}$  in the open interval ${\displaystyle I}$  is a real number ${\displaystyle c}$  such that $${\displaystyle f(x)-f(x_{0})\geq c(x-x_{0})}$$  for all ${\displaystyle x\in I}$ . By the converse of the mean value theorem, the set of subderivatives at ${\displaystyle x_{0}}$  for a convex function is a nonempty closed interval ${\displaystyle [a,b]}$ , where ${\displaystyle a}$  and ${\displaystyle b}$  are the one-sided limits $${\displaystyle a=\lim _{x\to x_{0}^{-}}{\frac {f(x)-f(x_{0})}{x-x_{0}}},}$$  $${\displaystyle b=\lim _{x\to x_{0}^{+}}{\frac {f(x)-f(x_{0})}{x-x_{0}}}.}$$  The interval ${\displaystyle [a,b]}$  of all subderivatives is called the subdifferential of the function ${\displaystyle f}$  at ${\displaystyle x_{0}}$ , denoted by ${\displaystyle \partial f(x_{0})}$ . If ${\displaystyle f}$  is convex, then its subdifferential at any point is non-empty. Moreover, if its subdifferential at ${\displaystyle x_{0}}$  contains exactly one subderivative, then ${\displaystyle f}$  is differentiable at ${\displaystyle x_{0}}$  and ${\displaystyle \partial f(x_{0})=\{f'(x_{0})\}}$ .^[2]

Consider the function ${\displaystyle f(x)=|x|}$  which is convex. Then, the subdifferential at the origin is the interval ${\displaystyle [-1,1]}$ . The subdifferential at any point ${\displaystyle x_{0}<0}$  is the singleton set ${\displaystyle \{-1\}}$ , while the subdifferential at any point ${\displaystyle x_{0}>0}$  is the singleton set ${\displaystyle \{1\}}$ . This is similar to the sign function, but is not single-valued at ${\displaystyle 0}$ , instead including all possible subderivatives.

• A convex function ${\displaystyle f:I\to \mathbb {R} }$  is differentiable at ${\displaystyle x_{0}}$  if and only if the subdifferential is a singleton set, which is ${\displaystyle \{f'(x_{0})\}}$ .
• A point ${\displaystyle x_{0}}$  is a global minimum of a convex function ${\displaystyle f}$  if and only if zero is contained in the subdifferential. For instance, in the figure above, one may draw a horizontal "subtangent line" to the graph of ${\displaystyle f}$  at ${\displaystyle (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.
• If ${\displaystyle f}$  and ${\displaystyle g}$  are convex functions with subdifferentials ${\displaystyle \partial f(x)}$  and ${\displaystyle \partial g(x)}$  with ${\displaystyle x}$  being the interior point of one of the functions, then the subdifferential of ${\displaystyle f+g}$  is ${\displaystyle \partial (f+g)(x)=\partial f(x)+\partial g(x)}$  (where the addition operator denotes the Minkowski sum). This reads as "the subdifferential of a sum is the sum of the subdifferentials."^[3]

The concepts of subderivative and subdifferential can be generalized to functions of several variables. If ${\displaystyle f:U\to \mathbb {R} }$  is a real-valued convex function defined on a convex open set in the Euclidean space ${\displaystyle \mathbb {R} ^{n}}$ , a vector ${\displaystyle v}$  in that space is called a subgradient at ${\displaystyle x_{0}\in U}$  if for any ${\displaystyle x\in U}$  one has that

${\displaystyle f(x)-f(x_{0})\geq v\cdot (x-x_{0}),}$ 

where the dot denotes the dot product. The set of all subgradients at ${\displaystyle x_{0}}$  is called the subdifferential at ${\displaystyle x_{0}}$  and is denoted ${\displaystyle \partial f(x_{0})}$ . The subdifferential is always a nonempty convex compact set.

These concepts generalize further to convex functions ${\displaystyle f:U\to \mathbb {R} }$  on a convex set in a locally convex space ${\displaystyle V}$ . A functional ${\displaystyle v^{*}}$  in the dual space ${\displaystyle V^{*}}$  is called the subgradient at ${\displaystyle x_{0}}$  in ${\displaystyle U}$  if for all ${\displaystyle x\in U}$ ,

${\displaystyle f(x)-f(x_{0})\geq v^{*}(x-x_{0}).}$ 

The set of all subgradients at ${\displaystyle x_{0}}$  is called the subdifferential at ${\displaystyle x_{0}}$  and is again denoted ${\displaystyle \partial f(x_{0})}$ . The subdifferential is always a convex closed set. It can be an empty set; consider for example an unbounded operator, which is convex, but has no subgradient. If ${\displaystyle f}$  is continuous, the subdifferential is nonempty.

The subdifferential on convex functions was introduced by Jean Jacques Moreau and R. Tyrrell Rockafellar in the early 1960s. The generalized subdifferential for nonconvex functions was introduced by F.H. Clarke and R.T. Rockafellar in the early 1980s.^[4]

• Weak derivative
• Subgradient method
• Clarke generalized derivative

• Borwein, Jonathan; Lewis, Adrian S. (2010). Convex Analysis and Nonlinear Optimization : Theory and Examples (2nd ed.). New York: Springer. ISBN 978-0-387-31256-9.
• Hiriart-Urruty, Jean-Baptiste; Lemaréchal, Claude (2001). Fundamentals of Convex Analysis. Springer. ISBN 3-540-42205-6.
• Zălinescu, C. (2002). Convex analysis in general vector spaces. World Scientific Publishing  Co., Inc. pp. xx+367. ISBN 981-238-067-1. MR 1921556.

• "Uses of ${\displaystyle \lim \limits _{h\to 0}{\frac {f(x+h)-f(x-h)}{2h}}}$ ". Stack Exchange. September 18, 2011.