Quaternion-Kähler symmetric space: Difference between revisions
Jump to navigation
Jump to search
en>Giftlite m →References: +. |
en>Yobot m WP:CHECKWIKI error fixes / special characters in pagetitle using AWB (9485) |
||
Line 1: | Line 1: | ||
In [[convex analysis]], '''Danskin's theorem''' is a [[theorem]] which provides information about the [[derivative]]s of a [[function (mathematics)|function]] of the form | |||
:<math>f(x) = \max_{z \in Z} \phi(x,z).</math> | |||
The theorem has applications in [[optimization (mathematics)|optimization]], where it sometimes is used to solve [[minimax]] problems. | |||
== Statement == | |||
The theorem applies to the following situation. Suppose <math>\phi(x,z)</math> is a [[continuous function]] of two arguments, | |||
:<math>\phi: {\mathbb R}^n \times Z \rightarrow {\mathbb R}</math> | |||
where <math>Z \subset {\mathbb R}^m</math> is a [[compact set]]. Further assume that <math>\phi(x,z)</math> is [[convex function|convex]] in <math>x</math> for every <math>z \in Z</math>. | |||
Under these conditions, Danskin's theorem provides conclusions regarding the [[differentiability]] of the function | |||
:<math>f(x) = \max_{z \in Z} \phi(x,z).</math> | |||
To state these results, we define the set of maximizing points <math>Z_0(x)</math> as | |||
:<math>Z_0(x) = \left\{ \overline{z} : \phi(x,\overline{z}) = \max_{z \in Z} \phi(x,z)\right\}.</math> | |||
Danskin's theorem then provides the following results. | |||
;Convexity | |||
: <math>f(x)</math> is [[convex function|convex]]. | |||
;Directional derivatives | |||
: The [[directional derivative]] of <math>f(x)</math> in the direction <math>y</math>, denoted <math>D_y\ f(x)</math>, is given by | |||
::<math>D_y f(x) = \max_{z \in Z_0(x)} \phi'(x,z;y),</math> | |||
: where <math>\phi'(x,z;y)</math> is the directional derivative of the function <math>\phi(\cdot,z)</math> at <math>x</math> in the direction <math>y</math>. | |||
;Derivative | |||
: <math>f(x)</math> is [[differentiable]] at <math>x</math> if <math>Z_0(x)</math> consists of a single element <math>\overline{z}</math>. In this case, the [[derivative]] of <math>f(x)</math> (or the [[gradient]] of <math>f(x)</math> if <math>x</math> is a vector) is given by | |||
:: <math>\frac{\partial f}{\partial x} = \frac{\partial \phi(x,\overline{z})}{\partial x}.</math> | |||
;Subdifferential | |||
:If <math>\phi(x,z)</math> is differentiable with respect to <math>x</math> for all <math>z \in Z</math>, and if <math>\partial \phi/\partial x</math> is continuous with respect to <math>z</math> for all <math>x</math>, then the [[subdifferential]] of <math>f(x)</math> is given by | |||
:: <math>\partial f(x) = \mathrm{conv} \left\{ \frac{\partial \phi(x,z)}{\partial x} : z \in Z_0(x) \right\}</math> | |||
: where <math>\mathrm{conv}</math> indicates the [[convex hull]] operation. | |||
== See also == | |||
* [[Maximum theorem]] | |||
* [[Envelope theorem]] | |||
* [[Hotellings Lemma]] | |||
== References == | |||
* {{cite book | |||
| last = Bertsekas | |||
| first = Dimitri P. | |||
| title = Nonlinear Programming | |||
| publisher = Athena Scientific | |||
| date = 1999 | |||
| pages = 717 | |||
| location = Belmont, MA | |||
| id = ISBN 1-886529-00-0 }} | |||
[[Category:Convex analysis]] | |||
[[Category:Mathematical optimization]] | |||
[[Category:Theorems in analysis]] | |||
[[Category:Convex optimization]] |
Revision as of 18:27, 17 September 2013
In convex analysis, Danskin's theorem is a theorem which provides information about the derivatives of a function of the form
The theorem has applications in optimization, where it sometimes is used to solve minimax problems.
Statement
The theorem applies to the following situation. Suppose is a continuous function of two arguments,
where is a compact set. Further assume that is convex in for every .
Under these conditions, Danskin's theorem provides conclusions regarding the differentiability of the function
To state these results, we define the set of maximizing points as
Danskin's theorem then provides the following results.
- Convexity
- is convex.
- Directional derivatives
- The directional derivative of in the direction , denoted , is given by
- where is the directional derivative of the function at in the direction .
- Derivative
- is differentiable at if consists of a single element . In this case, the derivative of (or the gradient of if is a vector) is given by
- Subdifferential
- If is differentiable with respect to for all , and if is continuous with respect to for all , then the subdifferential of is given by
- where indicates the convex hull operation.
See also
References
- 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534