Danskin's theorem

From testwiki
Jump to navigation Jump to search

Template:Short description In convex analysis, Danskin's theorem is a theorem which provides information about the derivatives of a function of the form f(x)=maxz∈Zϕ(x,z).

The theorem has applications in optimization, where it sometimes is used to solve minimax problems. The original theorem given by J. M. Danskin in his 1967 monograph [1] provides a formula for the directional derivative of the maximum of a (not necessarily convex) directionally differentiable function.

An extension to more general conditions was proven 1971 by Dimitri Bertsekas.

Statement

The following version is proven in "Nonlinear programming" (1991).[2] Suppose ϕ(x,z) is a continuous function of two arguments, ϕ:ℝn×Z→ℝwhere Z⊂ℝm is a compact set.

Under these conditions, Danskin's theorem provides conclusions regarding the convexity and differentiability of the function f(x)=maxz∈Zϕ(x,z).To state these results, we define the set of maximizing points Z0(x) as Z0(x)=arg⁡maxz∈Zϕ(x,z)={z‾:ϕ(x,z‾)=maxz∈Zϕ(x,z)}.Danskin's theorem then provides the following results.

Convexity

If ϕ(x,z) is convex in x for every z∈Z, then f(x) is convex in x (this extends the known fact that the maximum of finitely many convex functions is convex).

Derivative

If Z0(x) consists of a single element z‾, then f(x) is differentiable at x, and its derivative (or gradient if x is a vector) equals the derivative of ϕ(x,z) at the unique arg-max:∂f∂x=∂ϕ(x,z‾)∂x.

Directional semi-derivative

If Z0(x) contains more than one element, then f(x) is not differentiable at x, but it has a semi-differential. The semi-differential of f(x) in the direction y, denoted ∂y f(x), is the maximum of different derivatives over all z:∂yf(x)=maxz∈Z0(x)ϕ′(x,z;y), where ϕ′(x,z;y) is the directional derivative of the function ϕ(⋅,z) at x in the direction y.

In the statement of Danskin, it is important to conclude semi-differentiability of f and not directional-derivative as explains this simple example. Set Z={−1,+1}, ϕ(x,z)=zx, we get f(x)=|x| which is semi-differentiable with ∂−f(0)=−1,∂+f(0)=+1 but has not a directional derivative at x=0.

Subdifferential

If ϕ(x,z) is differentiable with respect to x for all z∈Z, and if ∂ϕ/∂x is continuous with respect to z for all x, then the subdifferential of f(x) is given by ∂f(x)=conv{∂ϕ(x,z)∂x:z∈Z0(x)} where conv indicates the convex hull operation.

Extension

The 1971 Ph.D. Thesis by Dimitri P. Bertsekas (Proposition A.22) [3] proves a more general result, which does not require that ϕ(⋅,z) is differentiable. Instead it assumes that ϕ(⋅,z) is an extended real-valued closed proper convex function for each z in the compact set Z, that int⁡(dom⁡(f)), the interior of the effective domain of f, is nonempty, and that ϕ is continuous on the set int⁡(dom⁡(f))×Z. Then for all x in int⁡(dom⁡(f)), the subdifferential of f at x is given by ∂f(x)=conv⁡{∂ϕ(x,z):z∈Z0(x)} where ∂ϕ(x,z) is the subdifferential of ϕ(⋅,z) at x for any z in Z.

See also

References

Template:Reflist

Template:Convex analysis and variational analysis