5. Shooting algorithm and problem discretization
5.1 Problems without constraints
It is assumed here that has a weak minimum , a continuous function of time, satisfying the following strong (time-uniform) Legendre-Clebsch condition, where Id is the identity matrix (compare to the necessary condition (56)):...
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Shooting algorithm and problem discretization
Second-order optimality conditions
Bibliography
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Article included in this offer
"Mathematics"
(
168 articles
)
Updated and enriched with articles validated by our scientific committees
A set of exclusive tools to complement the resources
