Jump to ContentJump to Main Navigation

Journal of Inverse and Ill-posed Problems

Editor-in-Chief: Kabanikhin, Sergey I.

6 Issues per year


Increased IMPACT FACTOR 2013: 0.593
Rank 143 out of 299 in category Mathematics in the 2013 Thomson Reuters Journal Citation Report/Science Edition

SCImago Journal Rank (SJR): 0.466
Source Normalized Impact per Paper (SNIP): 1.251

Mathematical Citation Quotient 2013: 0.51

VolumeIssuePage

Issues

Conjugate gradient regularization under general smoothness and noise assumptions

1Universität Potsdam, Institut für Mathematik, Am Neuen Palais 10, 14469 Potsdam, Germany.

2Weierstraß Institute for Applied Analysis and Stochastics, Mohrenstraße 39, 10117 Berlin, Germany.

Citation Information: Journal of Inverse and Ill-posed Problems. Volume 18, Issue 6, Pages 701–726, ISSN (Online) 1569-3945, ISSN (Print) 0928-0219, DOI: 10.1515/jiip.2010.033, December 2010

Publication History

Received:
2010-07-09
Published Online:
2010-12-20

Abstract

We study noisy linear operator equations in Hilbert space under a self-adjoint operator. Approximate solutions are sought by conjugate gradient type iteration, given as Krylov-subspace minimizers under a general weight function. Solution smoothness is given in terms of general source conditions. The noise may be controlled in stronger norm. We establish conditions under which stopping according to a modified discrepancy principle yields optimal regularization of the iteration. The present analysis extends much of the known theory and reveals some intrinsic features which are hidden when studying standard conjugate gradient type regularization under standard smoothness assumptions. In particular, under a non-self adjoint operator, regularization of the associated normal equation is a direct consequence from the main result and does not require a separate treatment.

Keywords.: Conjugate gradient type regularization; general smoothness

Comments (0)

Please log in or register to comment.
Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.