Calculus of variations and optimal control; optimization
259 ideas in this subject. The map below lists the main ideas of the subject by area, in teaching order. 170 of its 176 ideas have a page so far.
Start here
- ConceptCalculus of variations
The calculus of variations studies the extreme values of functionals, that is, of maps that send functions to numbers. Examples of functionals are length, area and energy. A typical functional is an integral , minimised among functions with given boundary values. Its smooth critical points solve a partial differential equation, the Euler–Lagrange equation. Conversely, many equations of physics and geometry are Euler–Lagrange equations, and the calculus of variations gives existence through the direct method.
- ConceptFunctional
A functional is a map that takes an element of a vector space, usually a function, and returns a number. Length of a curve, energy of a field and the value of an integral are functionals of the curve, the field or the integrand. Functionals are the objects that the calculus of variations minimises and maximises. The linear ones, the linear forms, are the elements of the dual space and are central in functional analysis.
- ConceptIntegral functional with a Lagrangian density
An integral functional assigns to a function the integral of an expression built from the point, the value of and its derivatives. The function is the Lagrangian density. Most problems of the calculus of variations concern such functionals, for example length, area, energy and action. Their smooth critical points solve the Euler–Lagrange equation.
- ConceptAdmissible function
An admissible function of a variational problem is a function that is allowed to compete for the minimum. It must lie in the domain of the functional and satisfy every constraint of the problem, such as boundary values or a fixed length. The set of admissible functions fixes the problem as much as the functional does: a change of the class can change whether a minimiser exists.
- ConceptWeak and strong extremum
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.
- ConceptFirst variation
The first variation of a functional at in the direction is the rate of change of at . It is the analogue for functionals of the directional derivative. At a minimiser it vanishes in every admissible direction, and for integral functionals this condition leads to the Euler–Lagrange equation.
Map of the subject
Basic notions of the calculus of variations 21 of 21
- Calculus of variations concept
- Functional definition
- Integral functional with a Lagrangian density definition
- Admissible function definition
- Weak and strong extremum definition
- First variation definition
- Gateaux derivative definition
- Fréchet derivative definition
- Fermat's theorem on stationary points statement
- Fundamental lemma of the calculus of variations statement
- du Bois-Reymond lemma statement
- Euler–Lagrange equation definition
- Euler–Poisson equation for higher derivatives definition
- Euler–Lagrange equation definition
- Beltrami identity statement
- Natural boundary condition definition
- Transversality conditions for variable endpoints statement
- Lagrange multipliers statement
- Lagrange multipliers on Banach spaces statement
- Isoperimetric problem of the calculus of variations problem
- Lyusternik's theorem on tangent spaces statement
Classical problems 9 of 9
- Brachistochrone problem problem
- Catenary problem problem
- Dido's problem problem
- Minimal surface of revolution problem
- Newton's minimal resistance problem problem
- Euler's elastica problem
- Zermelo's navigation problem problem
- Goddard problem problem
- Hilbert's twenty-third problem problem
Second variation and sufficient conditions 12 of 13
- Second variation definition
- Legendre condition statement
- Legendre–Hadamard condition statement
- Jacobi equation definition
- conjugate points and the Jacobi condition statement
- Weierstrass excess function definition
- Weierstrass–Erdmann corner conditions statement
- Field of extremals concept
- Hilbert's invariant integral concept
- Legendre transformation definition
- Hamiltonian system definition
- Noether's theorem statement
- Noether's second theorem statement
Direct methods and existence of minimizers 18 of 19
- Direct method in the calculus of variations concept
- extreme value theorem statement
- Semicontinuity definition
- Weak lower semicontinuity definition
- Coercive functional definition
- Tonelli's existence theorem statement
- Convex integrand definition
- Morrey quasiconvexity definition
- Polyconvexity definition
- Rank-one convexity definition
- Morrey's lower semicontinuity theorem statement
- Ball's existence theorem in nonlinear elasticity statement
- Relaxation of a variational problem concept
- Young measure definition
- Dirichlet energy definition
- Weierstrass's counterexample to the Dirichlet principle counterexample
- Regularity of minimizers concept
- Ekeland's variational principle statement
- Caristi fixed-point theorem statement
Gamma-convergence and homogenization 7 of 7
- Γ-convergence definition
- Fundamental theorem of Γ-convergence statement
- Mosco convergence definition
- Modica–Mortola theorem statement
- Ginzburg–Landau functional example
- Mumford–Shah functional example
- Total variation denoising example
Variational inequalities 4 of 4
- Variational inequality problem
- Lions–Stampacchia theorem statement
- Signorini problem problem
- Stefan problem as a variational inequality example
Minimax and saddle points 3 of 3
- Saddle point of a Lagrangian definition
- von Neumann's minimax theorem statement
- Ky Fan minimax inequality statement
Nonsmooth analysis and set-valued analysis 9 of 10
- Subderivative definition
- Clarke generalized gradient definition
- Limiting subdifferential definition
- Fenchel conjugate definition
- Fenchel–Moreau theorem statement
- Fenchel–Young inequality statement
- Epigraph definition
- Set-valued analysis concept
- Envelope theorem statement
- maximum theorem statement
Optimal control: formulation and existence 12 of 12
- Optimal control concept
- Control system definition
- Admissible control definition
- Bolza problem problem
- Mayer and Lagrange problems problem
- Filippov's existence theorem statement
- Relaxed control definition
- Chattering control concept
- Optimal control of partial differential equations concept
- Shape optimization problem
- Shape derivative definition
- Topology optimization problem
Optimality conditions in control 13 of 13
- Pontryagin's maximum principle statement
- Hamiltonian of an optimal control problem definition
- Costate equation definition
- Bang–bang control concept
- Singular control concept
- Fuller's phenomenon example
- Linear-quadratic regulator problem
- Riccati differential equation of optimal control definition
- Algebraic Riccati equation definition
- Linear-quadratic-Gaussian control problem
- Separation principle statement
- Time-optimal control problem
- Sub-Riemannian geodesic problem problem
Dynamic programming and Hamilton-Jacobi theory 8 of 8
- Value function definition
- Dynamic programming in continuous time concept
- Hamilton–Jacobi–Bellman equation definition
- Verification theorem statement
- Hamilton–Jacobi theory of the calculus of variations concept
- Viscosity solution of the Hamilton–Jacobi–Bellman equation statement
- Crandall–Lions uniqueness theorem statement
- Carathéodory's royal road concept
Stochastic control and differential games 5 of 7
- Stochastic optimal control concept
- Merton's portfolio problem problem
- optimal stopping problem
- Differential game concept
- Hamilton–Jacobi–Isaacs equation definition
- pursuit–evasion game problem
- Homicidal chauffeur problem problem
Numerical methods for optimal control 7 of 7
- Indirect method by shooting concept
- Trajectory optimization concept
- Direct collocation concept
- Pseudospectral optimal control concept
- Differential dynamic programming concept
- Adjoint state method concept
- Model predictive control concept
Variational methods for eigenvalues 5 of 5
- Rayleigh quotient definition
- Min-max theorem statement
- Rayleigh–Ritz method concept
- Faber–Krahn inequality statement
- Pólya's conjecture on Laplacian eigenvalues conjecture
Geometric measure theory and optimization on manifolds 21 of 22
- Geometric measure theory concept
- Rectifiable set definition
- Integral current definition
- Flat norm definition
- Federer–Fleming compactness theorem statement
- Area-minimizing current definition
- Caccioppoli set definition
- Perimeter of a set definition
- De Giorgi's structure theorem statement
- Coarea formula statement
- Allard regularity theorem statement
- Almgren's regularity theorem statement
- Simons cone example
- Bombieri–De Giorgi–Giusti theorem statement
- Douglas–Radó solution of Plateau's problem statement
- Jean Taylor's theorem on soap film singularities statement
- Plateau's laws statement
- Double bubble theorem statement
- Kelvin problem problem
- Weaire–Phelan structure example
- Honeycomb theorem statement
- isoperimetric problem in Riemannian manifolds problem
Optimal transport 8 of 8
- Optimal transport and the Monge problem problem
- Kantorovich duality statement
- Coupling definition
- c-cyclical monotonicity definition
- Brenier's theorem statement
- Benamou–Brenier formula statement
- Displacement convexity definition
- Jordan–Kinderlehrer–Otto scheme concept
Variational principles of physics 8 of 8
- Stationary-action principle statement
- Hamilton's principle statement
- Maupertuis's principle statement
- Fermat's principle statement
- Gauss's principle of least constraint statement
- d'Alembert's principle statement
- Minimum total potential energy principle statement
- Einstein–Hilbert action definition
More ideas in this subject
Concepts 12
Theorems and results 6
Problems 5
Definitions 82
- Saddle point of a Lagrangian
- c-cyclical monotonicity
- Hamilton–Jacobi–Bellman equation
- Admissible function
- Carathéodory's royal road
- Chattering control
- Coercive functional
- Current
- Dirichlet energy
- Einstein–Hilbert action
- Epigraph
- Flat norm
- Functional
- Hamiltonian of an optimal control problem
- Jordan–Kinderlehrer–Otto scheme
- Model predictive control
- Varifold
- Young measure
- Bang–bang control
- Costate equation
- Direct collocation
- Dynamic programming in continuous time
- Field of extremals
- Integral current
- Proximal operator
- Regularity of minimizers
- Relaxation of a variational problem
- Second variation
- Weak and strong extremum
- Clarke generalized gradient
- Differential inclusion
- Direct method in the calculus of variations
- Hamilton–Jacobi theory of the calculus of variations
- Hamilton–Jacobi–Isaacs equation
- Integral functional with a Lagrangian density
- Jacobi equation
- Limiting subdifferential
- Pseudospectral optimal control
- Riccati differential equation of optimal control
- Trajectory optimization
- Value function
- Weak lower semicontinuity
- Admissible control
- Algebraic Riccati equation
- Birkhoff min-max method
- Convex integrand
- Geometric measure theory
- Optimal control of partial differential equations
- Rank-one convexity
- Γ-convergence
- Almgren–Pitts min-max theory
- Calculus of variations
- Euler–Poisson equation for higher derivatives
- Morrey quasiconvexity
- Optimal control
- Singular control
- Stochastic optimal control
- Caccioppoli set
- Mosco convergence
- Polyconvexity
- Rayleigh–Ritz method
- Wasserstein metric
- Weierstrass excess function
- Discrete-time algebraic Riccati equation
- First variation
- Hamilton–Jacobi equation
- Natural boundary condition
- Perimeter of a set
- Shape derivative
- Differential game
- Hilbert's invariant integral
- Indirect method by shooting
- Mean-field game
- Relaxed control
- Subderivative
- Differential dynamic programming
- Rectifiable set
- Euler–Lagrange equation
- Displacement convexity
- Adjoint state method
- Maximum and minimum
- Area-minimizing current