{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:32:32Z","timestamp":1780633952870,"version":"3.54.1"},"reference-count":28,"publisher":"SAGE Publications","issue":"10","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[2003,10]]},"abstract":"<jats:p>The authors propose a two-timescale version of the one-simulation smoothed functional (SF) algorithm with extra averaging. They also propose the use of a chaotic simple deterministic iterative sequence for generating random samples for averaging. This sequence is used for generating the N independent and identically distributed (i.i.d.), Gaussian random variables in the SF algorithm. The convergence analysis of the algorithms is also briefly presented. The authors show numerical experiments on the chaotic sequence and compare performance with a good pseudo-random generator. Next they show experiments in two different settings\u2014a network of M\/G\/1 queues with feedback and the problem of finding a closed-loop optimal policy (within a prespecified class) in the available bit rate (ABR) service in asynchronous transfer mode (ATM) networks, using all the algorithms. The authors observe that algorithms that use the chaotic sequence show better performance in most cases than those that use the pseudo-random generator.<\/jats:p>","DOI":"10.1177\/0037549703039988","type":"journal-article","created":{"date-parts":[[2004,4,21]],"date-time":"2004-04-21T20:41:37Z","timestamp":1082580097000},"page":"568-580","source":"Crossref","is-referenced-by-count":29,"title":["Multiscale Chaotic SPSA and Smoothed Functional Algorithms for Simulation Optimization"],"prefix":"10.1177","volume":"79","author":[{"given":"Shalabh","family":"Bhatnagar","sequence":"first","affiliation":[{"name":"Department of Computer Science and Automation Indian Institute of Science                        Bangalore 560 012 India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vivek S.","family":"Borkar","sequence":"additional","affiliation":[{"name":"School of Technology and Computer Science Tata Institute of Fundamental                        Research Homi Bhabha Road Mumbai 400 005 India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2003,10,1]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1137\/0331032"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1109\/9.299620"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"[3] Ho, Y.C., and X.R. Cao. 1991. Perturbation analysis of discrete event dynamical systems. Boston: Kluwer .","DOI":"10.1007\/978-1-4615-4024-3"},{"key":"atypb4","unstructured":"[4] Glasserman, P., and Y.C. Ho. 1990. Gradient estimation via perturbation analysis. Boston: Kluwer ."},{"key":"atypb5","unstructured":"[5] Cassandras, C. G. 1993. Discrete event systems: Modeling and performance analysis. Boston: Aksen Associates and IRWIN ."},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964800005003"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964800005362"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1109\/9.119632"},{"key":"atypb9","doi-asserted-by":"crossref","unstructured":"[9] Bhatnagar, S., M. C. Fu, S. I. Marcus, and S. Bhatnagar. 2001. Two timescale algorithms for simulation optimization of hidden Markov models . IIE Transactions 33 (3): 245-258 .","DOI":"10.1080\/07408170108936826"},{"key":"atypb10","doi-asserted-by":"crossref","unstructured":"[10] Niederreiter, N. 1995. New developments in uniform pseudorandom number and vector generation. In Monte Carlo and quasi-Monte Carlo methods in scientific computing, edited by H. Niederreiter and P. J.S. Shiue. New York: Springer .","DOI":"10.1007\/978-1-4612-2552-2"},{"key":"atypb11","doi-asserted-by":"crossref","unstructured":"[11] L\u2019Ecuyer, P. 1998. Random number generators and empirical tests. In Monte Carlo and quasi-Monte Carlo methods, edited by H. Niederreiter, P. Hellekalek, G. Larcher, and P. Zinthof. New York: Springer .","DOI":"10.1007\/978-1-4612-1690-2_7"},{"key":"atypb12","unstructured":"[12] Boyarski, A., and P. Gora. 1997. Laws of chaos: Invariant measures and dynamical systems in one dimension. Boston: Birkhauser ."},{"key":"atypb13","unstructured":"[13] Katkovnik, V. Y. A., and Y. U. Kulchitsky. 1972. Convergence of a class of random search algorithms . Automation Remote Control 8: 1321-1326 ."},{"key":"atypb14","doi-asserted-by":"crossref","unstructured":"[14] Rubinstein, R. Y. 1981. Simulation and the Monte Carlo method. New York: John Wiley .","DOI":"10.1002\/9780470316511"},{"key":"atypb15","unstructured":"[15] Bharath, B., and V. S. Borkar. 1998. Robust parameter optimization of hidden Markov models . Journal of the Indian Institute of Science 78: 119-130 ."},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1145\/63039.63042"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1109\/90.944345"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1017\/S0021900200110083"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1017\/S0021900200043096"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706645"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(89)90018-X"},{"key":"atypb22","doi-asserted-by":"crossref","unstructured":"[22] Benveniste, A., M. Metivier, and P. Priouret. 1990. Adaptive algorithms and stochastic approximations. Berlin: Springer Verlag .","DOI":"10.1007\/978-3-642-75894-2"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6911(97)90015-3"},{"key":"atypb24","doi-asserted-by":"crossref","unstructured":"[24] Ripley, B. D. 1987. Stochastic simulation. New York: John Wiley .","DOI":"10.1002\/9780470316726"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1145\/778553.778554"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1016\/S0005-1098(96)00149-5"},{"key":"atypb27","doi-asserted-by":"crossref","unstructured":"[27] Srinivasan, R. 2002. Importance sampling. New York: Springer Verlag .","DOI":"10.1007\/978-3-662-05052-1"},{"key":"atypb28","unstructured":"[28] Bertsekas, D. P., and J. N. Tsitsiklis. 1996. Neuro-dynamic programming. Belmont, MA: Athena Scientific ."}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549703039988","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549703039988","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:18:09Z","timestamp":1777634289000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0037549703039988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":28,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["10.1177\/0037549703039988"],"URL":"https:\/\/doi.org\/10.1177\/0037549703039988","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}