Calculus of variations and optimal control; optimization Definition
Coercive functional
Builds on Banach spaceFunctional
Definition
Let be a real normed space and let be a functional. The functional is coercive if as . That is, for every there is such that for all with .
Remarks
Equivalently, every sublevel set , , is bounded. So a minimising sequence of a coercive functional with is bounded. In a reflexive Banach space it then has a weakly convergent subsequence.
Example: on a Hilbert space with , let . Then , which tends to , so is coercive.
Non-example: on , let . The values stay below for all , so is not coercive, and it has no minimiser.
Some authors use a stronger, quantitative form: for constants , and . For integral functionals, this follows from a growth bound on the integrand together with boundary conditions and the Poincaré inequality.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Banach space concept
- Functional concept
- Coercive functional definition
Further reading
About this page
| Tag | FH92FW76Q0 |
|---|---|
| URI | m2://FH92FW76Q0 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 49J45, 58E30 |
| Defines | Coercive functional |
| Uses | Banach space, Functional |
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.