Convergence Rates Results for Iterative Methods for Solving Nonlinear Ill-Posed Problems

2000 ◽  
pp. 7-34 ◽  
Author(s):  
H. W. Engl ◽  
O. Scherzer
Keyword(s):  
Iterative Methods ◽  
Convergence Rates ◽  
Ill Posed

scholarly journals Convergence Rates of First- and Higher-Order Dynamics for Solving Linear Ill-Posed Problems

2021 ◽  
Author(s):  
Radu Boţ ◽  
Guozhi Dong ◽  
Peter Elbau ◽  
Otmar Scherzer
Keyword(s):  
Linear Operator ◽  
Operator Equation ◽  
Convex Analysis ◽  
Convergence Rates ◽  
Linear Operator Equation ◽  
Optimal Convergence Rates ◽  
Ill Posed ◽  
Thresholding Algorithm ◽  
The Given ◽  
Theoretical Results

AbstractRecently, there has been a great interest in analysing dynamical flows, where the stationary limit is the minimiser of a convex energy. Particular flows of great interest have been continuous limits of Nesterov’s algorithm and the fast iterative shrinkage-thresholding algorithm, respectively. In this paper, we approach the solutions of linear ill-posed problems by dynamical flows. Because the squared norm of the residual of a linear operator equation is a convex functional, the theoretical results from convex analysis for energy minimising flows are applicable. However, in the restricted situation of this paper they can often be significantly improved. Moreover, since we show that the proposed flows for minimising the norm of the residual of a linear operator equation are optimal regularisation methods and that they provide optimal convergence rates for the regularised solutions, the given rates can be considered the benchmarks for further studies in convex analysis.

M. A. Krasnosel'skii Theorem and Iterative Methods for Solving Ill-Posed Linear Problems with a Self-Adjoint Operator

2015 ◽  
Vol 15 (3) ◽  
pp. 373-389
Author(s):  
Oleg Matysik ◽  
Petr Zabreiko
Keyword(s):  
Hilbert Space ◽  
Iterative Methods ◽  
Critical Case ◽  
Adjoint Operator ◽  
Successive Approximations ◽  
Operator Equations ◽  
Ill Posed ◽  
Linear Problems ◽  
Adjoint Operators ◽  
Linear Operator Equations

AbstractThe paper deals with iterative methods for solving linear operator equations ${x = Bx + f}$ and ${Ax = f}$ with self-adjoint operators in Hilbert space X in the critical case when ${\rho (B) = 1}$ and ${0 \in \operatorname{Sp} A}$. The results obtained are based on a theorem by M. A. Krasnosel'skii on the convergence of the successive approximations, their modifications and refinements.

scholarly journals Optimization Learning: Perspective, Method, and Applications

2020 ◽  
Author(s):  
Risheng Liu
Keyword(s):  
Inverse Problems ◽  
Theoretical Analysis ◽  
Iterative Methods ◽  
State Of The Art ◽  
Learning Paradigm ◽  
Rigorous Analysis ◽  
The Core ◽  
Globally Convergent ◽  
Ill Posed ◽  
Art Performance

Numerous tasks at the core of statistics, learning, and vision areas are specific cases of ill-posed inverse problems. Recently, learning-based (e.g., deep) iterative methods have been empirically shown to be useful for these problems. Nevertheless, integrating learnable structures into iterations is still a laborious process, which can only be guided by intuitions or empirical insights. Moreover, there is a lack of rigorous analysis of the convergence behaviors of these reimplemented iterations, and thus the significance of such methods is a little bit vague. We move beyond these limits and propose a theoretically guaranteed optimization learning paradigm, a generic and provable paradigm for nonconvex inverse problems, and develop a series of convergent deep models. Our theoretical analysis reveals that the proposed optimization learning paradigm allows us to generate globally convergent trajectories for learning-based iterative methods. Thanks to the superiority of our framework, we achieve state-of-the-art performance on different real applications.

scholarly journals The Impact of the Discrepancy Principle on the Tikhonov-Regularized Solutions with Oversmoothing Penalties

Mathematics ◽  
2020 ◽  
Vol 8 (3) ◽  
pp. 331
Author(s):  
Bernd Hofmann ◽  
Christopher Hofmann
Keyword(s):  
Case Studies ◽  
Convergence Rates ◽  
Regularization Parameter ◽  
A Priori ◽  
Discrepancy Principle ◽  
Parameter Choice ◽  
Operator Equations ◽  
Analytical Results ◽  
Ill Posed ◽  
The Impact

This paper deals with the Tikhonov regularization for nonlinear ill-posed operator equations in Hilbert scales with oversmoothing penalties. One focus is on the application of the discrepancy principle for choosing the regularization parameter and its consequences. Numerical case studies are performed in order to complement analytical results concerning the oversmoothing situation. For example, case studies are presented for exact solutions of Hölder type smoothness with a low Hölder exponent. Moreover, the regularization parameter choice using the discrepancy principle, for which rate results are proven in the oversmoothing case in in reference (Hofmann, B.; Mathé, P. Inverse Probl. 2018, 34, 015007) is compared to Hölder type a priori choices. On the other hand, well-known analytical results on the existence and convergence of regularized solutions are summarized and partially augmented. In particular, a sketch for a novel proof to derive Hölder convergence rates in the case of oversmoothing penalties is given, extending ideas from in reference (Hofmann, B.; Plato, R. ETNA. 2020, 93).

scholarly journals On Levenberg-Marquardt-Kaczmarz iterative methods for solving systems of nonlinear ill-posed equations

2010 ◽  
Vol 4 (3) ◽  
pp. 335-350 ◽  
Author(s):  
Johann Baumeister ◽  
◽  
Barbara Kaltenbacher ◽  
Antonio Leitão ◽  
◽  
...  
Keyword(s):  
Iterative Methods ◽  
Levenberg Marquardt ◽  
Ill Posed

scholarly journals Convergence Rates for Exponentially Ill-Posed Inverse Problems with Impulsive Noise

2016 ◽  
Vol 54 (1) ◽  
pp. 341-360 ◽  
Author(s):  
Claudia König ◽  
Frank Werner ◽  
Thorsten Hohage
Keyword(s):  
Inverse Problems ◽  
Convergence Rates ◽  
Impulsive Noise ◽  
Ill Posed
Sign in / Sign up

Export Citation Format

Share Document