Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Remote Access
Green Open Access
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society
ISSN 1088-6826(online) ISSN 0002-9939(print)


The minimal error conjugate gradient method is a regularization method

Author: Martin Hanke
Journal: Proc. Amer. Math. Soc. 123 (1995), 3487-3497
MSC: Primary 65J10; Secondary 47A50, 65J20
MathSciNet review: 1285994
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The regularizing properties of the conjugate gradient iteration, applied to the normal equation of a linear ill-posed problem, were established by Nemirovskii in 1986. A seemingly more attractive variant of this algorithm is the minimal error method suggested by King. The present paper analyzes the regularizing properties of the minimal error method. It is shown that the discrepancy principle is no regularizing stopping rule for the minimal error method. Instead, a different stopping rule is suggested which leads to order-optimal convergence rates.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 65J10, 47A50, 65J20

Retrieve articles in all journals with MSC: 65J10, 47A50, 65J20

Additional Information

PII: S 0002-9939(1995)1285994-5
Keywords: Linear ill-posed problems, iterative regularization, conjugate gradients, minimal error method, discrepancy principle, oder-optimal error bounds
Article copyright: © Copyright 1995 American Mathematical Society

Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia