An inexact Bregman iterative method for optimal control problems

Frank Pörner

Published 2017-02-15Version 1

In this article we investigate an inexact iterative regularization method based on generalized Bregman distances of an optimal control problem with control constraints. We show robustness and convergence of the inexact Bregman method under a regularity assumption, which is a combination of a source condition and a regularity assumption on the active sets. Furthermore we provide a modification of the algorithm using adaptive mesh refinement based on a-posteriori error estimates. Numerical results are presented to demonstrate the algorithm.