Paratingent cone

In mathematics, the paratingent cone and contingent cone were introduced by Bouligand (1932), and are closely related to tangent cones.

Definition

Let $S$ be a nonempty subset of a real normed space $(X,\|\cdot \|)$ .

Let some ${\bar {x}}\in \operatorname {cl} (S)$ be given. An element $h\in X$ is called a tangent to $S$ at ${\bar {x}}$ , if there is a sequence $(x_{n})_{n\in \mathbb {N} }$ of elements $x_{n}\in S$ and a sequence $(\lambda _{n})_{n\in \mathbb {N} }$ of positive real numbers $\lambda _{n}>0$ so that ${\bar {x}}=\lim _{n\to \infty }x_{n}$ and $h=\lim _{n\to \infty }\lambda _{n}(x_{n}-{\bar {x}}).$
The set $T(S,{\bar {x}})$ of all tangents to $S$ at ${\bar {x}}$ is called the contingent cone (or the Bouligand tangent cone) to $S$ at ${\bar {x}}$ .[1]

gollark: I think I encountered a problem recently with the weird scoping.

gollark: I think there was some PEP recently about assignment expressions or something, in which they tried to shove in new syntax to make stuff slightly simpler-looking which there was a large debate over.

gollark: Convoluted because piles of different syntaxy things, I mean.

gollark: Rust's `if` and stuff are expressions, which is nice.

gollark: Plus most of it's a statement and not an expression, so no composability.

References

Jahn, Johannes. Vector Optimization Theory, Applications, and Extensions, Second Edition, pp 90-91

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] Jahn, Johannes. Vector Optimization Theory, Applications, and Extensions, Second Edition, pp 90-91