Regularization and implicit Euler discretization of linear-quadratic optimal control problems with bang-bang solutions

We analyze the implicit Euler discretization for a class of convex linear-quadratic optimal control problems with control appearing linearly. Constraints are defined by lower and upper bounds for the controls, and the cost functional may depend on a regularization parameter ν. Without any structural assumption on the optimal control we prove convergence of order 1 w.r.t. the mesh size for the discrete optimal values. Under the additional assumption that the optimal control is of bang-bang type and the switching function satisfies a growth condition around their zeros we show that the solutions are calm functions of perturbation and regularization parameters. By applying this result to the implicit Euler discretization we improve existing error estimates for discretizations based on the explicit Euler method. Numerical experiments confirm the theoretical findings and demonstrate the usefulness of implicit methods and regularization in case of bang-bang controls.