Stochastic searching on the line and its applications to parameter learning in nonlinear optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 27, Issue 4, 1997, Pages 733-739

  Oommen, B John ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; ROBOTS;

NONLINEAR OPTIMIZATION; STOCHASTIC SEARCHING;

LEARNING SYSTEMS;

EID: 0031209813     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/3477.604122     Document Type: Article

References (20)

1. R. A. Baeza-Yates, J. C. Culberson, and G. J. E. Rawlins, "Searching with uncertainty," in Proc. Scandinavian Workshop Algorithms Theory, 1988, pp. 176-189.
2. R. A. Baeza-Yates and R. Schott, "Parallel searching in the plane," in Proc. 1992 Int. Conf. Chilean Computer Soc., 1992, pp. 269-279.
3. S. Karlin and H. M. Taylor, A First Course on Stochastic Processes, 2nd ed. New York: Academic, 1974.
4. R. L. Kashyap and B. J. Oommen, "Scale preserving smoothing of polygons," IEEE Trans. Pattern Anal. Machine Intell., pp. 667-671, Nov. 1983.
5. S. Lakshmivarahan, Learning Algorithms Theory and Applications. Berlin, Germany: Springer-Verlag, 1981.
6. J. K. Lanctôt, "Discrete estimator algorithms: A mathematical model of computer learning," M.Sc. thesis, Dept. Math. Stat., Carleton Univ., Ottawa, Ont., Canada, 1989.
7. J. K. Lanctôt and B. J. Oommen, "Discretized estimator learning automata," IEEE Trans. Syst., Man, Cybern., vol. 22, pp. 1473-1483, Nov./Dec. 1992.
8. K. S. Narendra and M. A. L. Thathachar, Learning Automata. Englewood Cliffs, NJ: Prentice-Hall, 1989.
9. B. J. Oommen and E. R. Hansen, "The asymptotic optimality of discretized linear reward-inaction learning automata," IEEE Trans. Syst., Man, Cybern., vol. 14, pp. 542-545, May/June 1984.
10. B. J. Oommen and J. P. R. Christensen, "Epsilon-optimal discretized linear reward-penalty learning automata," IEEE Trans. Syst., Man, Cybern., vol. 18, pp. 451-458, May/June 1988.
11. B. J. Oommen and J. K. Lanctôt, "Discretized pursuit linear reward-inaction learning automata," IEEE Trans. Syst., Man, Cybern., vol. 20, pp. 431-438, July/Aug. 1990.
12. B. J. Oommen, "Absorbing and ergodic discretized two-action learning automata," IEEE Trans. Syst., Man, Cybern., vol. SMC-16, pp. 282-296, 1986.
13. Y.-H. Pao, Adaptive Pattern Recognition and Neural Networks. Reading, MA: Addison Wesley, 1989.
14. T. Pavlidis, Structural Pattern Recognition. New York: Springer-Verlag, 1977.
15. W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling, Numerical Recipes : The Art of Scientific Computing. Cambridge, U.K.: Cambridge Univ. Press, 1986.
16. S. S. Rao, Optimization: Theory and Applications, 2nd ed. New Delhi, India: Wiley, 1984.
17. M. Riedmiller and H. Braun, "RPROP - A fast adaptive learning algorithm," in Proc. 1992 Int. Symp. Computer Information Sciences, Antalya, Turkey, Nov. 1992, pp. 279-285.
18. M. A. L. Thathachar and B. J. Oommen, "Discretized reward-inaction learning automata," J. Cybern. Inform. Sci., pp. 24-29, Spring 1979.
19. M. L. Tsetlin, Automaton Theory and the Modeling of Biological Systems. New York: Academic, 1973.
20. P. D. Wasserman, Neural Computing: Theory and Practice. New York: Van Nostrand Reinhold, 1989.