Shooting algorithm and problem discretization
Optimal Control
Article REF: AF1374 V1
Shooting algorithm and problem discretization
Optimal Control

Author : J. Frédéric BONNANS

Publication date: April 10, 2015 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

5. Shooting algorithm and problem discretization

5.1 Problems without constraints

It is assumed here that u↦F(u) has a weak minimum u¯ , 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.
Logo Techniques de l'Ingenieur

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed?

Article included in this offer

"Mathematics"

( 165 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details
Contact our team FAQ