Iterative Solution Methods

Abstract

This chapter deals with iterative methods for nonlinear ill-posed problems. We present gradient and Newton type methods as well as nonstandard iterative algorithms such as Kaczmarz, expectation maximization, and Bregman iterations.Our intention here is to cite convergence results in the sense of regularization and to provide further references to the literature.

Bregman LM (1967) The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comp Math Math Phys 7:200–217CrossRefGoogle Scholar