Danskin's theorem

In convex analysis, Danskin's theorem is a theorem which provides information about the derivatives of a function of the form

${\displaystyle f(x)=\max _{z\in Z}\phi (x,z).}$

The theorem has applications in optimization, where it sometimes is used to solve minimax problems. The original theorem by J. M. Danskin, given in his 1967, monograph "The Theory of Max-Min and its Applications to Weapons Allocation Problems," Springer, NY, provides a formula for the directional derivative of the maximum of a (not necessarily convex) directionally differentiable function. When adapted to the case of a convex function, this formula yields the following theorem given in somewhat more general form as Proposition A.22 in the 1971 Ph.D. Thesis by D. P. Bertsekas, "Control of Uncertain Systems with a Set-Membership Description of the Uncertainty". A proof of the following version can be found in the 1999 book "Nonlinear Programming" by Bertsekas (Section B.5).

Statement

The theorem applies to the following situation. Suppose ${\displaystyle \phi (x,z)}$ is a continuous function of two arguments,

${\displaystyle \phi :{\mathbb {R} }^{n}\times Z\rightarrow {\mathbb {R} }}$

where ${\displaystyle Z\subset {\mathbb {R} }^{m}}$ is a compact set. Further assume that ${\displaystyle \phi (x,z)}$ is convex in $x$ for every ${\displaystyle z\in Z}$.

Under these conditions, Danskin's theorem provides conclusions regarding the differentiability of the function

${\displaystyle f(x)=\max _{z\in Z}\phi (x,z).}$

To state these results, we define the set of maximizing points ${\displaystyle Z_{0}(x)}$ as

${\displaystyle Z_{0}(x)=\left\{{\overline {z}}:\phi (x,{\overline {z}})=\max _{z\in Z}\phi (x,z)\right\}.}$

Danskin's theorem then provides the following results.

Convexity

$f(x)$ is convex.

Directional derivatives

The directional derivative of $f(x)$ in the direction $y$, denoted ${\displaystyle D_{y}\ f(x)}$, is given by

${\displaystyle D_{y}f(x)=\max _{z\in Z_{0}(x)}\phi '(x,z;y),}$

where ${\displaystyle \phi '(x,z;y)}$ is the directional derivative of the function ${\displaystyle \phi (\cdot ,z)}$ at $x$ in the direction $y$.

Derivative

$f(x)$ is differentiable at $x$ if ${\displaystyle Z_{0}(x)}$ consists of a single element ${\overline {z}}$. In this case, the derivative of $f(x)$ (or the gradient of $f(x)$ if $x$ is a vector) is given by

${\displaystyle {\frac {\partial f}{\partial x}}={\frac {\partial \phi (x,{\overline {z}})}{\partial x}}.}$

Subdifferential

If ${\displaystyle \phi (x,z)}$ is differentiable with respect to $x$ for all ${\displaystyle z\in Z}$, and if ${\displaystyle \partial \phi /\partial x}$ is continuous with respect to $z$ for all $x$, then the subdifferential of $f(x)$ is given by

${\displaystyle \partial f(x)=\mathrm {conv} \left\{{\frac {\partial \phi (x,z)}{\partial x}}:z\in Z_{0}(x)\right\}}$

where ${\displaystyle \mathrm {conv} }$ indicates the convex hull operation.

Extension

The 1971 Ph.D. Thesis by Bertsekas ^[1] (Proposition A.22) proves a more general result, which does not require that ${\displaystyle \phi (\cdot ,z)}$ is differentiable. Instead it assumes that ${\displaystyle \phi (\cdot ,z)}$ is an extended real-valued closed proper convex function for each $z$ in the compact set $Z$, that ${\displaystyle int(dom(f))}$, the interior of the effective domain of $f$, is nonempty, and that $\phi$ is continuous on the set ${\displaystyle int(dom(f))\times Z}$. Then for all $x$ in ${\displaystyle int(dom(f))}$, the subdifferential of $f$ at $x$ is given by

${\displaystyle \partial f(x)=\mathrm {conv} \left\{\partial \phi (x,z):z\in Z_{0}(x)\right\}}$

where ${\displaystyle \partial \phi (x,z)}$ is the subdifferential of ${\displaystyle \phi (\cdot ,z)}$ at $x$ for any $z$ in $Z$.

See also

• Maximum theorem
• Envelope theorem
• Hotellings Lemma

References

1. Ph.D. Thesis by D. P. Bertsekas

• Danskin, John M. (1967). The Theory of Max-Min and its Applications to Weapons Allocation Problems. NY: Springer.
• Bertsekas, Dimitri P. (1971). Control of Uncertain Systems with a Set-Membership Description of Uncertainty. Cambridge, MA: PhD Thesis, MIT.
• Bertsekas, Dimitri P. (1999). Nonlinear Programming. Belmont, MA: Athena Scientific. p. 737. ISBN 1-886529-00-0.