  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. We also take the
discretization error into account. Numerical results are presented to
demonstrate the algorithm.
