5. Shooting algorithm and problem discretization
It is assumed here that
has a weak minimum
, a continuous function of time, satisfying the following strong (time-uniform) Legendre-Clebsch condition, where I
d
is the identity matrix (compare to the necessary condition
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!
Ongoing reading
Shooting algorithm and problem discretization
Bibliography
-
(1) - ARONNA (M.S.), BONNANS (J.F.), MARTINON (P.) -
A shooting algorithm for optimal control problems with singular arcs
-
J. Optim. Theory Appl., 158 (2) : 419-459 (2013).
-
(2) - BARDI (M.), CAPUZZO-DOLCETTA (I.) -...
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!