Calculus of variations and optimal control; optimization Problem
Hilbert's twentieth problem
Builds on Calculus of variationsDirect method in the calculus of variationsBoundary value problem
Problem
Let be a bounded open set. Consider a regular problem of the calculus of variations: minimise with given values of on . Here the Lagrangian is smooth and strictly convex in . Hilbert asked whether every such problem has a solution. He allowed suitable assumptions on the boundary conditions and, if needed, a suitable extension of the notion of solution.
Remarks
The problem is a programme rather than a single statement, and its answer depends on how "suitable" is made precise. The modern answer is largely affirmative. The direct method gives minimisers in Sobolev spaces for Lagrangians that are convex in and satisfy growth conditions, which is the "suitably extended" notion of solution. Regularity theory, which grew from Hilbert's nineteenth problem, then shows that these generalised solutions are classical in many cases. The same circle of ideas gives weak solutions of boundary value problems for linear and nonlinear elliptic equations.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Boundary value problem concept
- Calculus of variations concept
- Direct method in the calculus of variations concept
- Hilbert's twentieth problem problem
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 187NP5Z002 |
|---|---|
| URI | m2://187NP5Z002 |
| Kind | problem |
| Writing | W0 stub |
| MSC | 49J10, 35A15, 35J20 |
| Status | This copy of the site has no build data. Run m2 status 187NP5Z002. |
| About | Calculus of variations |
| Uses | Calculus of variations, Direct method in the calculus of variations, Boundary value problem |
| Same as |
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.