Averaging Procedures in Adaptive Filtering: An Efficient Approach

IEEE Transactions on Automatic Control

Volumn 37, Issue 4, 1992, Pages 466-475

  Yin, Gang George ^a   Zhu, Yunmin ^b  

^a WAYNE STATE UNIVERSITY   (United States)

^b INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - CONVERGENCE OF NUMERICAL METHODS; PROBABILITY;

ACCELERATED CONVERGENCE; ADAPTIVE FILTERING; ASYMPTOTIC NORMALITY; AVERAGING PROCEDURES; STOCHASTIC RECURSIVE ALGORITHMS;

SIGNAL FILTERING AND PREDICTION;

EID: 0026852132     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/9.126579     Document Type: Article

References (20)

1. L. Ljung, “Analysis of recursive stochastic algorithms,” IEEE Trans. Automat. Contr., vol. AC-22, pp. 551–575, 1977.
2. H. J. Kushner and D. S. Clark, Stochastic Approximation Methods for Constrained and Unconstrained Systems. New York: Springer-Verlag, 1978.
3. E. Eweda and O. Macchi, “Convergence of an adaptive linear estimation algorithm,” IEEE Trans. Automat. Contr., vol. AC-29, pp. 119–127, 1984.
4. O. Macchi and E. Eweda, “Second-order convergence analysis of stochastic adaptive linear filter,” IEEE Trans. Automat. Contr., vol. AC-28, pp. 76–86, 1983.
5. E. Eweda and O. Macchi, “Quadratic and almost sure convergence of unbounded stochastic approximation algorithms with correlated observations,” Ann. Institut. Henri Poincare, vol. 19, pp. 235–255, 1983.
6. H. J. Kushner and A. Schwartz, “Weak convergence and asymptotic properties of adaptive filters with constant gains,” IEEE Trans. Informal. Theory, vol. IT-30, pp. 177–182, 1984.
7. A. Benveniste, M. Metivier, and P. Priouret, Adaptive Algorithms and Stochastic Approximation. New York: Springer-Verlag, 1990.
8. M. Watanabe, “2rth mean convergence of adaptive filters with stationary dependent random variables,” IEEE Trans. Informat. Theory, vol. IT-30, pp. 134–140, 1984.
9. Y. M. Zhu and G. Yin, “Adaptive filter with constraint and correlated nonstationary signals,” Syst. Contr. Lett., vol. 10, pp. 271–279, 1988.
10. G. Yin, “Asymptotic properties of an adaptive beam former algorithm,” IEEE Trans. Informat. Theory, vol. 35, pp. 859–867, 1989.
11. B. T. Polyak, “New method of stochastic approximation type,” Automat. Remote Contr., vol. 51, pp. 937–946, 1990.
12. D. Ruppert, “Efficient estimations from a slowly convergent Robbins-Monro process,” Tech. Rep. 781, School Operat. Res. Industrial Eng., Cornell Univ., Ithaca, NY, 1988.
13. B. T. Polyak, “Comparison of the speed of convergence of single-step and multi-step algorithms of optimization when there are noises,” Eng. Cybern., vol. 15, pp. 6–10, 1977.
14. G. Yin, “A stopping rule for the Robbins-Monro method,” J. Optimiz. Theory Appt., vol. 67, pp. 151–173, 1990.
15. S. N. Ethier and T. G. Kurtz, Markov Processes, Characterization and Convergence. New York: Wiley, 1986.
16. W. F. Stout, Almost Sure Convergence. New York: Academic, 1974.
17. H. J. Kushner and S. Lakshmivarahan, “Numerical studies of stochastic approximation procedures for constrained problems,” IEEE Trans. Automat. Contr., vol. AC-22, pp. 428–439, 1977.
18. H. J. Kushner and G. Yin, “Stochastic approximation algorithms for parallel and distributed processing,” Stochastics, vol. 22, pp. 219–250, 1987.
19. Y. M. Zhu and G. Yin, “A new algorithm for constrained adaptive array processing,” Int. J. Adaptive Contr. Signal Process., vol. 4, pp. 259–269, 1990.
20. H. J. Kushner and H. Huang, “Asymptotic properties of stochastic approximations with constant coefficients,” SIAM J. Contr. Optimiz., vol. 19, pp. 87–105, 1981.