Consistency of Landweber algorithm in an ill-posed problem with random data

DOI10.1016/J.CRMA.2006.09.010zbMath1125.47055OpenAlexW2024910772MaRDI QIDQ857089

Abdelnasser Dahmani, Fatah Bouhmila

Publication date: 14 December 2006

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2006.09.010

zbMATH Keywords

ill-posed problemoperator equationrandom errorpseudosolution

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Random operators and equations (aspects of stochastic analysis) (60H25) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52) Applications of operator theory in probability theory and statistics (47N30)

Related Items (2)

The L-pseudo-solution using stochastic algorithm of Landweber ⋮ Consistency of the Tikhonov's regularization in an ill-posed problem with random data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inverse Problems. Mathematical and analytical techniques with applications to engineering
• Exponential inequalities for sums of random vectors
• Spatially adaptive splines for statistical linear inverse problems
• Statistical and computational inverse problems.
• A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
• On the method of Lavrentiev regularization for nonlinear ill-posed problems
• Inverse Problem Theory and Methods for Model Parameter Estimation
• Consistency and rates of convergence of nonlinear Tikhonov regularization with random noise
• An Iteration Formula for Fredholm Integral Equations of the First Kind

This page was built for publication: Consistency of Landweber algorithm in an ill-posed problem with random data