Passive stochastic approximation with averaging along trajectories (Q1914358)

From MaRDI portal
Revision as of 05:13, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Passive stochastic approximation with averaging along trajectories
scientific article

    Statements

    Passive stochastic approximation with averaging along trajectories (English)
    0 references
    0 references
    0 references
    12 June 1996
    0 references
    The paper deals with the problem of estimating a root \(x^*\) of the regression equation \(f(x)=0\) on the basis of measurements \[ y_n=f(x_n)+ \xi_n,\qquad n=1,2,\dots \] (\(f(\cdot):\mathbb{R}^1\to \mathbb{R}^1\); \(\{\xi_n\}\) is a random sequence corresponding to a noise). To solve this problem the authors propose a two-step recursive algorithm defined by the relations \[ \begin{aligned} z_{n+1}&= P_Q\Biggl\{ z_n-\gamma_n h_n^{-1} \varphi(y_n) K\biggl( {{x_n-z_n}\over{h_n}} \biggr)\Biggr\},\\ \overline{z}_{n+1}&= \overline{z}_n- (n+1)^{-1} (\overline{z}_n-z_n),\end{aligned} \] where \(P_Q\) is the operator of the projection onto the corresponding set \(Q\); \(\varphi(\cdot): \mathbb{R}^1\to\mathbb{R}^1\) is a monotonic, nondecreasing function; \(K(\cdot)\) is a kernel function. The assumptions under which \(\overline{z}_n= {1\over n}\sum^{n-1}_{t=0} z_t\to x^*\) are introduced in the paper and, moreover, the convergence rate is also investigated there. The paper follows some previous papers on a similar topic.
    0 references
    stochastic approximation
    0 references
    recursive algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references