# An inexact iterative Bregman method for optimal control problems

## TL;DR

This paper introduces an inexact iterative Bregman regularization method for optimal control problems with control constraints, demonstrating its robustness, convergence, and effectiveness through numerical experiments.

## Contribution

It develops a novel inexact Bregman iterative method tailored for constrained optimal control problems, including analysis of convergence and discretization effects.

## Key findings

- Method is robust under certain regularity conditions
- Convergence of the inexact Bregman method is established
- Numerical results confirm the effectiveness of the proposed algorithm

## Abstract

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.