Author:
Nikazad Touraj,Abbasi Mokhtar,Elfving Tommy
Abstract
AbstractWe study error minimizing relaxation (EMR) strategies for use in Landweber and Kaczmarz type iterations applied to linear systems with or without convex constraints. Convergence results based on operator theory are given, assuming exact data. The advantages and disadvantages of these relaxation strategies on a noisy and ill-posed problem are illustrated using examples taken from the field of image reconstruction from projections. We also consider combining EMR with penalization.
Reference86 articles.
1. On projection algorithms for solving convex feasibility problems;SIAM Rev.,1996
2. Decomposition through formalization in a product space;Math. Program.,1984
3. On steepest-descent-Kaczmarz methods for regularizing systems of nonlinear ill-posed equations;Appl. Math. Comput.,2008
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献