{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:12:55Z","timestamp":1759104775335,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T00:00:00Z","timestamp":1407888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000147","name":"Division of Civil, Mechanical and Manufacturing Innovation","doi-asserted-by":"publisher","award":["CMMI-1130273, CMMI-1130761"],"award-info":[{"award-number":["CMMI-1130273, CMMI-1130761"]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA-9550-12-1-0250"],"award-info":[{"award-number":["FA-9550-12-1-0250"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2014,8,13]]},"abstract":"<jats:p>The model-based methods have recently found widespread applications in solving hard nondifferentiable optimization problems. These algorithms are population-based and typically require hundreds of candidate solutions to be sampled at each iteration. In addition, recent convergence analysis of these algorithms also stipulates a sample size that increases polynomially with the number of iterations. In this article, we aim to improve the efficiency of model-based algorithms by reducing the number of candidate solutions generated per iteration. This is carried out through embedding a stochastic averaging procedure within these methods to make more efficient use of the past sampling information. This procedure not only can potentially reduce the number of function evaluations needed to obtain high-quality solutions, but also makes the underlying algorithms more amenable for parallel computation. The detailed implementation of our approach is demonstrated through an exemplary algorithm instantiation called Model-based Annealing Random Search with Stochastic Averaging (MARS-SA), which maintains the per iteration sample size at a small constant value. We establish the global convergence property of MARS-SA and provide numerical examples to illustrate its performance.<\/jats:p>","DOI":"10.1145\/2641565","type":"journal-article","created":{"date-parts":[[2014,11,18]],"date-time":"2014-11-18T14:20:23Z","timestamp":1416320423000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Model-Based Annealing Random Search with Stochastic Averaging"],"prefix":"10.1145","volume":"24","author":[{"given":"Jiaqiao","family":"Hu","sequence":"first","affiliation":[{"name":"State University of New York at Stony Brook, Stony Brook, NY"}]},{"given":"Enlu","family":"Zhou","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA"}]},{"given":"Qi","family":"Fan","sequence":"additional","affiliation":[{"name":"State University of New York at Stony Brook, Stony Brook, NY"}]}],"member":"320","published-online":{"date-parts":[[2014,11,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144070"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Agoston E. Eiben and James E. Smith. 2003. Introduction to Evolutionary Computing. Springer Berlin Germany.   Agoston E. Eiben and James E. Smith. 2003. Introduction to Evolutionary Computing. Springer Berlin Germany.","DOI":"10.1007\/978-3-662-05094-1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0004972700010236"},{"volume-title":"Proceedings of the 17th International Symposium on Mathematical Theory of Networks and Systems. ACM Press","author":"Fu Michael C.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/inte.20.4.74"},{"key":"e_1_2_1_7_1","unstructured":"David E. Goldberg. 1989. Genetic Algorithms in Search Optimization and Machine Learning. Kluwer Academic Boston MA.   David E. Goldberg. 1989. Genetic Algorithms in Search Optimization and Machine Learning. Kluwer Academic Boston MA."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0367"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1995456.1995530"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.20462"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2158128"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2431518.2432020"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_2_1_14_1","unstructured":"Pedro Larra\u0144aga and Jose A. Lozano. 2002. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Boston MA.  Pedro Larra\u0144aga and Jose A. Lozano. 2002. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Boston MA."},{"key":"e_1_2_1_15_1","unstructured":"Averill M. Law. 2007. Simulation Modelling and Analysis (4th ed.). McGraw-Hill New York NY.  Averill M. Law. 2007. Simulation Modelling and Analysis (4th ed.). McGraw-Hill New York NY."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964800003624"},{"key":"e_1_2_1_17_1","unstructured":"Reuven Y. Rubinstein and Dirk P. Kroese. 2004. The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization Monte-Carlo Simulation and Machine Learning. Springer New York NY.   Reuven Y. Rubinstein and Dirk P. Kroese. 2004. The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization Monte-Carlo Simulation and Machine Learning. Springer New York NY."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.48.3.390.12436"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"James C. Spall. 2003. Introduction to Stochastic Search and Optimization. John Wiley & Sons Hoboken NJ.   James C. Spall. 2003. Introduction to Stochastic Search and Optimization. John Wiley & Sons Hoboken NJ.","DOI":"10.1002\/0471722138"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.736077"},{"volume-title":"Proceedings of the 11th International Symposium on Dynamic Games and Applications, T. Vincent (Ed.)","year":"2004","author":"Wolpert David H.","key":"e_1_2_1_21_1"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Zelda B. Zabinsky. 2003. Introduction to Stochastic Search and Optimization. Kluwer Academic.   Zelda B. Zabinsky. 2003. Introduction to Stochastic Search and Optimization. Kluwer Academic.","DOI":"10.1007\/978-1-4419-9182-9_1"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2310052"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000039526.52305.af"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2641565","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2641565","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:01:07Z","timestamp":1750276867000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2641565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,13]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8,13]]}},"alternative-id":["10.1145\/2641565"],"URL":"https:\/\/doi.org\/10.1145\/2641565","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"type":"print","value":"1049-3301"},{"type":"electronic","value":"1558-1195"}],"subject":[],"published":{"date-parts":[[2014,8,13]]},"assertion":[{"value":"2012-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-11-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}