References
- Traub JF, Wasilkowski G, Wozniakowski H. Information-based complexity. Boston: Academic Press; 1988.
- Traub JF, Wozniakowski H. A general theory of optimal algorithms. Boston: Academic Press; 1980.
- Werschulz AG. What is the complexity of ill-posed problems? Numer. Funct. Anal. Optim. 1987;9:945–967.
- Wozniakowski H. Information based complexity. Ann. Rev. Comput. Sci. 1986;1:319–380.
- Pereverzev SV, Solodky SG. The minimal radius of Galerkin information for the Fredholm problems of first kind. J. Complexity. 1996;12:401–415.
- Solodky SG. Information complexity of projection algorithms for solving Fredholm equations of the first kind. II. Ukr. Math. Zh. 1998;50:838–844.
- Plato R, Vainikko GM. On the regularization of projection methods for solving ill-posed problems. Numer. Math. 1990;57:63–79.
- Solodky SG. Optimization of projection methods for solving severely ill-posed problems. Zh. Vychisl. Mat. Mat. Fiz. 1999;2:195–203. Russian.
- Solodky SG. The optimal approximations for solving linear ill-posed problems. J. Complexity. 2001;17:98–116.
- Mathe P, Pereverzev SG. Discretization strategy for ill-posed problems in variable Hilbert scales. Inverse Prob. 2003;19:1263–1277.
- Solodky SG, Myleiko GL. The minimal radius of Galerkin information for severely ill-posed problems. J. Inverse Ill-Posed Prob. 2014;5:735–757.
- Tautenhahn U. Optimality for ill-posed problems under general source condition. Numer. Funct. Anal. Optimi. 1998;19:377–398.
- Mair BA. Tikhonov regularization for finitely and infinitely smoothing operators. SIAM. J. Math. Anal. 1994;25:135–147.
- Hohage T. Regularization of exponentially ill-posed problems. Numer. Funct. Anal. Optim. 2000;21:439–464.
- Pereverzev SV. Optimization of projection methods for solving ill-posed problems. Computing. 1995;55:113–124.