2017/02/15 by Frank Pörner, Pörner, Frank
Computer Science · Mathematics · #49M30 #49N45 #65K10 #Contact Mechanics and Variational Inequalities #FOS: Mathematics #Numerical methods in inverse problems #Optimization and Control (math.OC) #Optimization and Variational Analysis #math.OC #msc:49M30 #msc:49N45 #msc:65K10
paper · pdf · doi:10.48550/arxiv.1702.04547
27 pages, 3 figures
openalex publication_date 2017/02/15 · arxiv created 2017/08/29 · arxiv updated 2017/08/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.