Error Estimates for the Iteratively Regularized Gradient Method for Ill-Posed Optimization Problems in a Hilbert Space
M. M. Kokurin
Abstract
We study the iteratively regularized gradient method applied to the ill-posed problem of minimizing a general smooth functional on a Hilbert space. Under a source condition on the solution, we establish error estimates for this method when the objective functional is known exactly or only approximately. For these estimates we provide two proofs based on substantially different ideas and compare the assumptions and conclusions of the corresponding theorems. In addition, we present an improved proof of an error estimate for the Tikhonov method applied to ill-posed optimization problems with an exactly known functional. We also prove a theorem on the existence of a global minimizer of the Tikhonov functional without assuming weak lower semicontinuity of the original functional.
Create a lesson
Related papers
Graph lattice sums and graph zeta functions for long-range interacting quantum lattice models
Andreas Alexander Buchheit, Andreas Rupp
A numerical benchmark for fluid--structure--contact interaction
Daniele Corti, Jakub Fara, Miguel Angel Fernández et al.
Largest-dihedral-angle bisection algorithm does not preserve mesh regularity for tetrahedral partitions
Sergey Korotov, Jérôme Michaud
A Highly Scalable Quantized Tensor-Train FDTD Framework for the Simulation of Three-Dimensional Electromagnetic Scattering Problems
Daan Vanhaecke, Emile Vanderstraeten, Dries Vande Ginste
Pressure-robustness by commuting interpolation operators for Stokes discretizations with continuous pressures
Philip L. Lederer, Theresa Vock
A Reynolds-Semi-Robust, Globally Divergence-Free HDG Method for the Smagorinsky Model
Shuaijun Liu, Xiaoping Xie