References
- Engl HW, Hanke M, Neubauer A. Regularization of inverse problems. Vol. 375, Mathematics and its applications. Dordrecht: Kluwer Academic Publishers Group; 1996.
- Brakhage H. On ill-posed problems and the method of conjugate gradients. In: Engl HW, Groetsch CW,editors. Inverse and ill-posed problems. Boston (MA): Academic Press; 1987. p. 165–175.
- Hanke M. Accelerated Landweber iterations for the solution of ill-posed equations. Numer. Math. 1991;60:341–373.
- Bot R, Hein T. Iterative regularization with a general penalty termtheory and application to L1 and TV regularization. Inverse Probl. 2012;28:104010. 19 p.
- Jin Q, Wang W. Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals. Inverse Probl. 2013;29:085011. 22 p.
- Narkiss G, Zibulevsky M. Sequential subspace optimization method for large-scale unconstrained optimizaton. Technical report. Technion-The Israel Institute of Technology, Department of Electrical Enginnering; 2005.
- Schöpfer F, Schuster T. Fast regularizing sequential subspace optimization in Banach spaces. Inverse Probl. 2009;25:015013. 22 p.
- Cioranescu I. Geometry of Banach spaces, duality mappings and nonlinear problems. Dordrecht: Kluwer; 1990.
- Bregman LM. The relaxation method for finding common points of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 1967;7:200–217.
- Zălinscu C. Convex analysis in general vector spaces. River Edge (NJ): World Scientific Publishing; 2002.
- Schirotzek W. Nonsmooth analysis. Berlin: Springer; 2007.
- Beck A, Teboulle M. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2009;2:183–202.
- Nesterov Y. Introductory lectures on convex optimization. Vol. 87, A basic course, applied optimization. Boston (MA): Kluwer Academic Publishers; 2004.
- Nocedal J, Wright SJ. Numerical optimization. Springer series in operations research. New York (NY): Springer; 1999.
- Sun WY, Yuan YX. Optimization theory and methods. Nonlinear programming. Vol. 1, Springer optimization and its applications. New York (NY): Springer; 2006.
- Hanke M. Regularizing properties of a truncated Newton-CG algorithm for nonlinear inverse problems. Numer. Funct. Anal. Optim. 1997;18:971–993.
- Rudin L, Osher S, Fatemi C. Nonlinear total variation based noise removal algorithm. Phys. D. 1992;60:259–268.
- Beck A, Teboulle M. Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems. IEEE Trans. Image Process. 2009;18:2419–2434.