Théorèmes de convergence presque sure pour une classe d'algorithmes stochastiques à pas décroissant
Authors:
- 1 September 1987
- journal article
- research article
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 74 (3) , 403-428
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Convergence avec une probabilité (1-ε) d’algorithmes stochastiques. Application au cas de l’égaliseur aveugleAnnals of Telecommunications, 1986
- Applications of a Kushner and Clark lemma to general classes of stochastic algorithmsIEEE Transactions on Information Theory, 1984
- Convergence analysis of self-adaptive equalizersIEEE Transactions on Information Theory, 1984
- Analysis of stochastic gradient algorithms for linear regression problemsIEEE Transactions on Information Theory, 1984
- Random Perturbations of Dynamical Systems1984
- An Invariant Measure Approach to the Convergence of Stochastic Approximations with State Dependent NoiseSIAM Journal on Control and Optimization, 1984
- Stochastic approximation with discontinuous dynamics and state dependent noise: w.p. 1 and weak convergenceJournal of Mathematical Analysis and Applications, 1981
- Stochastic Approximation Methods for Constrained and Unconstrained Systems1978
- Analysis of recursive stochastic algorithmsIEEE Transactions on Automatic Control, 1977