Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Journal of Inverse and Ill-posed Problems

Editor-in-Chief: Kabanikhin, Sergey I.


IMPACT FACTOR 2017: 0.941
5-year IMPACT FACTOR: 0.953

CiteScore 2017: 0.91

SCImago Journal Rank (SJR) 2017: 0.461
Source Normalized Impact per Paper (SNIP) 2017: 1.022

Mathematical Citation Quotient (MCQ) 2017: 0.49

Online
ISSN
1569-3945
See all formats and pricing
More options …
Volume 25, Issue 3

Issues

On Nesterov acceleration for Landweber iteration of linear ill-posed problems

Andreas Neubauer
Published Online: 2016-11-30 | DOI: https://doi.org/10.1515/jiip-2016-0060

Abstract

In this paper we deal with Nesterov acceleration and show that it speeds up Landweber iteration when applied to linear ill-posed problems. It is proven that, if the exact solution x((T*T)μ), then optimal convergence rates are obtained if μ12 and if the iteration is terminated according to an a priori stopping rule. If μ>12 or if the iteration is terminated according to the discrepancy principle, only suboptimal convergence rates can be guaranteed. Nevertheless, the number of iterations for Nesterov acceleration is always much smaller if the dimension of the problem is large. Numerical results verify the theoretical ones.

Keywords: Nesterov acceleration; Landweber iteration; linear ill-posed problems

MSC 2010: 47A52; 65J20; 65R30

References

  • [1]

    A. Beck and M. Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems, SIAM J. Imaging Sci. 2 (2009), 183–202. CrossrefWeb of ScienceGoogle Scholar

  • [2]

    A. Beck and M. Teboulle, Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems, IEEE Trans. Image Process. 18 (2009), 2419–2434. CrossrefWeb of ScienceGoogle Scholar

  • [3]

    H. Egger and A. Neubauer, Preconditioning Landweber iteration in Hilbert scales, Numer. Math. 101 (2005), 643–662. Google Scholar

  • [4]

    H. W. Engl, M. Hanke and A. Neubauer, Regularization of Inverse Problems, Kluwer, Dordrecht, 1996. Google Scholar

  • [5]

    Q. Jin, Landweber–Kaczmarz method in Banach spaces with inexact inner solvers, Inverse Problems 32 (2016), Article ID 104005. Google Scholar

  • [6]

    B. Kaltenbacher, A. Neubauer and O. Scherzer, Iterative Regularization Methods for Nonlinear Ill-Posed Problems, Radon Ser. Comput. Appl. Math. 6, De Gruyter, Berlin, 2008. CrossrefGoogle Scholar

  • [7]

    J. L. Lions and E. Magenes, Non-Homogeneous Boundary Value Problems and Applications. I, Springer, Berlin, 1972. Google Scholar

  • [8]

    Y. E. Nesterov, A method for solving the convex programming problem with convergence rate O(1/k2) (in Russian), Dokl. Akad. Nauk SSSR 269 (1983), 543–547. Google Scholar

About the article

Received: 2016-09-15

Accepted: 2016-11-05

Published Online: 2016-11-30

Published in Print: 2017-06-01


Citation Information: Journal of Inverse and Ill-posed Problems, Volume 25, Issue 3, Pages 381–390, ISSN (Online) 1569-3945, ISSN (Print) 0928-0219, DOI: https://doi.org/10.1515/jiip-2016-0060.

Export Citation

© 2017 Walter de Gruyter GmbH, Berlin/Boston.Get Permission

Citing Articles

Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.

[1]
[2]
Simon Hubmer, Ekaterina Sherina, Andreas Neubauer, and Otmar Scherzer
SIAM Journal on Imaging Sciences, 2018, Volume 11, Number 2, Page 1268
[3]
Simon Hubmer and Ronny Ramlau
Inverse Problems, 2017, Volume 33, Number 9, Page 095004

Comments (0)

Please log in or register to comment.
Log in