A stochastic procedure to solve linear ill-posed problems

In this work, we propose a stochastic procedure of Robbins–Monro type to resolve linear inverse problems in Hilbert space. We study the probability of large deviation between the exact solution and the approximated one and build a confidence domain for the approximated solution while precising the rate of convergence. To check the validity of our work, we give a simulation application into a deconvolution problem.     

Exponential Inequalities in Stochastic Inverse Problems Using an Iterative Method

We consider an iterative method in order to solve linear inverse problems. We establish exponential inequalities for the probability of the distance between the approximated solution and the exact one for a calibration problem. The approximate is given by an iterative method with Gaussian errors. We treat an operator equation of the form Ax = u, where A is a compact operator.     

Kiefer–Wolfowitz algorithm under quasi-associated random errors

In this article, we study the algorithm of Kiefer–Wolfowitz underquasi-associated random errors. We establish the complete convergence and obtain an exponential bound. Additionally, we build a confidence interval for the minimum. Numerical examples are sketched out to confirm the theoretical results and show the accuracy of the algorithm.     

Consistency of the Tikhonov’s regularization in an ill-posed problem with α-mixing random data

In this article, we establish exponential inequalities for the probability of the distance between the approximated solution and the exact one for an operator equation with an exact right-hand side. In addition, the second member of the operator equation is observed with α-mixing random errors. These inequalities yield the almost complete convergence of the approximate solution.     

Exponential inequalities in linear calibration problem

ABSTRACT

Calibration, also called inverse regression, is a classical problem which appears often in a regression setup under fixed design. The aim of this article is to propose a stochastic method which gives an estimated solution for a linear calibration problem. We establish exponential inequalities of Bernstein–Frechet type for the probability of the distance between the approximate solutions and the exact one. Furthermore, we build a confidence domain for the so-mentioned exact solution. To check the validity of our results, a numerical example is proposed.     

Consistency of stochastic approximation algorithm with quasi-associated random errors

ABSTRACT

Many mathematical and physical problems are led to find a root of a real function f. This kind of equation is an inverse problem and it is difficult to solve it. Especially in engineering sciences, the analytical expression of the function f is unknown to the experimenter, but it can be measured at each point x_k with M(x_k) as expected value and induced error ξ_k. The aim is to approximate the unique root θ under some assumptions on the function f and errors ξ_k. We use a stochastic approximation algorithm that constructs a sequence (x_k)_{k ? 1}. We establish the almost complete convergence of the sequence (x_k)_k to the exact root θ by considering the errors (ξ_k)_k quasi-associated and we illustrate the method by numerical examples to show its efficiency.     

On the rate of convergence of the Robbins–Monro's algorithm in a linear stochastic ill-posed problem with α-mixing data

In this paper we consider a recursive method of Robbins–Monro type to estimate the solution of the linear problem Ax = u, in which the second member is measured with α-mixing errors. We also show the almost complete convergence (a.co) of this algorithm specifying its convergence rate.     

Exponential inequalities for the Robbins–Monro’s algorithm under mixing condition

Abstract

In this work, we establish exponential inequalities for the Robbins–Monro’s algorithm with ψ-mixing variables, and we give a result on the almost complete convergence rate.