arXiv Analytics

Sign in

arXiv:1912.07028 [math.NA]AbstractReferencesReviewsResources

Symplectic Runge-Kutta discretization of a regularized forward-backward sweep iteration for optimal control problems

Xin Liu, Jason Frank

Published 2019-12-15Version 1

Li, Chen, Tai & E. (J. Machine Learning Research, 2018) have proposed a regularization of the forward-backward sweep iteration for solving the Pontryagin maximum principle in optimal control problems. The authors prove the global convergence of the iteration in the continuous time case. In this article we show that their proof can be extended to the case of numerical discretization by symplectic Runge-Kutta pairs. We demonstrate the convergence with a simple numerical experiment.

Related articles: Most relevant | Search more
arXiv:1202.1166 [math.NA] (Published 2012-02-06)
Implicit-Explicit Runge-Kutta schemes for numerical discretization of optimal control problems
arXiv:2212.10654 [math.NA] (Published 2022-12-20)
POD-based reduced order methods for optimal control problems governed by parametric partial differential equation with varying boundary control
arXiv:2211.00499 [math.NA] (Published 2022-11-01)
A combination technique for optimal control problems constrained by random PDEs