Calculus of variations and optimal control; optimization Nonsmooth analysis and set-valued analysis Concept
Set-valued analysis
Summary
Set-valued analysis is the study of maps that assign to each point a subset of , possibly empty or with many points. Such maps are the multivalued functions of analysis, studied with tools of topology, convexity and differentiation. Its main notions are the graph and inverse of a set-valued map, its hemicontinuity, limits of sets, selections and derivatives of set-valued maps. Set-valued maps arise as solution sets of parametrized problems, as subdifferentials of nonsmooth functions, and as right-hand sides of differential inclusions in control theory. Typical results are the Kakutani fixed-point theorem and the Michael selection theorem.
Further reading
About this page
| Tag | D0R8455C26 |
|---|---|
| URI | m2://D0R8455C26 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 49J53, 54C60, 47H04 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.