Calculus of variations and optimal control; optimization Basic notions of the calculus of variations Concept
Weak and strong extremum
Summary
In the calculus of variations a local minimum depends on what "nearby" means for functions. A strong local minimum beats every admissible function whose values are close. A weak local minimum only beats those whose values and slopes are both close. Every strong local extremum is a weak one, but not conversely. The Euler–Lagrange equation and the Legendre condition are necessary for weak extrema, while the Weierstrass excess function gives a further necessary condition for strong ones.
Where this leads
5 pages build on this one.
Further reading
About this page
| Tag | WMPCR723MJ |
|---|---|
| URI | m2://WMPCR723MJ |
| Kind | concept |
| Writing | W0 stub |
| MSC | 49K05, 49K99 |
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
Used by
- Legendre condition
- Weierstrass–Erdmann corner conditions
- Weierstrass excess function
- Legendre–Hadamard condition
- Jacobi condition