We propose an algorithm that produces a nondecreasing sequence of subsolutions for a class of optimal control problems distinguished by the property that the associated Bellman operators preserve convexity. In addition to a theoretical discussion and proofs of convergence, numerical experiments are presented to illustrate the feasibility of the method.
An algorithm to construct subsolutions of convex optimal control problems
Fischer Markus
2022
Abstract
We propose an algorithm that produces a nondecreasing sequence of subsolutions for a class of optimal control problems distinguished by the property that the associated Bellman operators preserve convexity. In addition to a theoretical discussion and proofs of convergence, numerical experiments are presented to illustrate the feasibility of the method.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Bet - Fischer SICON60-2022.pdf
non disponibili
Tipologia:
Published (publisher's version)
Licenza:
Accesso privato - non pubblico
Dimensione
460 kB
Formato
Adobe PDF
|
460 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
