Legendre–Clebsch condition

From testwiki
Revision as of 12:33, 11 October 2024 by imported>Hpghjfs (Generalized Legendre–Clebsch)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In the calculus of variations the Legendre–Clebsch condition is a second-order condition which a solution of the Euler–Lagrange equation must satisfy in order to be a minimum.

For the problem of minimizing

abL(t,x,x)dt.

the condition is

Lxx(t,x(t),x(t))0,t[a,b]

Generalized Legendre–Clebsch

In optimal control, the situation is more complicated because of the possibility of a singular solution. The generalized Legendre–Clebsch condition,[1] also known as convexity,[2] is a sufficient condition for local optimality such that when the linear sensitivity of the Hamiltonian to changes in u is zero, i.e.,

Hu=0,

the Hessian of the Hamiltonian is positive definite along the trajectory of the solution:

2Hu2>0

In words, the generalized LC condition guarantees that over a singular arc, the Hamiltonian is minimized.

See also

References

Template:Reflist

Further reading