Skip to content
Licensed Unlicensed Requires Authentication Published by De Gruyter November 30, 2016

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

Andreas Neubauer


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.

MSC 2010: 47A52; 65J20; 65R30


[1] A. Beck and M. Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems, SIAM J. Imaging Sci. 2 (2009), 183–202. 10.1137/080716542Search in Google 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. 10.1109/TIP.2009.2028250Search in Google Scholar PubMed

[3] H. Egger and A. Neubauer, Preconditioning Landweber iteration in Hilbert scales, Numer. Math. 101 (2005), 643–662. 10.1007/s00211-005-0622-5Search in Google Scholar

[4] H. W. Engl, M. Hanke and A. Neubauer, Regularization of Inverse Problems, Kluwer, Dordrecht, 1996. 10.1007/978-94-009-1740-8Search in Google Scholar

[5] Q. Jin, Landweber–Kaczmarz method in Banach spaces with inexact inner solvers, Inverse Problems 32 (2016), Article ID 104005. 10.1088/0266-5611/32/10/104005Search in 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. 10.1515/9783110208276Search in Google Scholar

[7] J. L. Lions and E. Magenes, Non-Homogeneous Boundary Value Problems and Applications. I, Springer, Berlin, 1972. 10.1007/978-3-642-65161-8Search in 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. Search in Google Scholar

Received: 2016-9-15
Accepted: 2016-11-5
Published Online: 2016-11-30
Published in Print: 2017-6-1

© 2017 Walter de Gruyter GmbH, Berlin/Boston