@inproceedings{2016shahunpasWSC,
	Year = {2016},
	Author = {S. Shashaani and S. R. Hunter and R. Pasupathy},
	Title = {{ASTRO-DF}: Adaptive sampling trust-region optimization algorithms, heuristics, and numerical experience},
	Booktitle = {Proceedings of the 2016 Winter Simulation Conference},
	Editor = {T. M. K. Roeder and P. I. Frazier and R. Szechtman and E. Zhou},
	Publisher = {Institute of Electrical and Electronics Engineers, Inc.},
        Address = {Piscataway, NJ},
        Pages = {554--565},
        doi = {10.1109/WSC.2016.7822121},
        url_Paper = {http://www.informs-sim.org/wsc16papers/050.pdf},
        abstract = {ASTRO-DF is a class of adaptive sampling algorithms for solving simulation optimization problems in which only estimates of the objective function are available by executing a Monte Carlo simulation. ASTRO-DF algorithms are iterative trust-region algorithms, where a local model is repeatedly constructed and optimized as iterates evolve through the search space. The ASTRO-DF class of algorithms is derivative-free in the sense that it does not rely on direct observations of the function derivatives. A salient feature of ASTRO-DF is the incorporation of adaptive sampling and replication to keep the model error and the trust-region radius in lock-step, to ensure efficiency. ASTRO-DF has been demonstrated to generate iterates that globally converge to a first-order critical point with probability one. In this paper, we describe and list ASTRO-DF, and discuss key heuristics that ensure good finite-time performance. We report our numerical experience with ASTRO-DF on test problems in low to moderate dimensions.},
        keywords = {simulation optimization > single-objective > continuous},
        bibbase_note = {<span style="color: green">2016 Winter Simulation Conference I-Sim Best Student Paper Award.</span>}}

{"_id":"8tiToCkk4D9JxfdQL","bibbaseid":"shashaani-hunter-pasupathy-astrodfadaptivesamplingtrustregionoptimizationalgorithmsheuristicsandnumericalexperience-2016","downloads":3,"creationDate":"2016-07-06T02:18:19.108Z","title":"ASTRO-DF: Adaptive sampling trust-region optimization algorithms, heuristics, and numerical experience","author_short":["Shashaani, S.","Hunter, S. R.","Pasupathy, R."],"year":2016,"bibtype":"inproceedings","biburl":"https://web.ics.purdue.edu/~hunter63/PAPERS/srhunterweb.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","year":"2016","author":[{"firstnames":["S."],"propositions":[],"lastnames":["Shashaani"],"suffixes":[]},{"firstnames":["S.","R."],"propositions":[],"lastnames":["Hunter"],"suffixes":[]},{"firstnames":["R."],"propositions":[],"lastnames":["Pasupathy"],"suffixes":[]}],"title":"ASTRO-DF: Adaptive sampling trust-region optimization algorithms, heuristics, and numerical experience","booktitle":"Proceedings of the 2016 Winter Simulation Conference","editor":[{"firstnames":["T.","M.","K."],"propositions":[],"lastnames":["Roeder"],"suffixes":[]},{"firstnames":["P.","I."],"propositions":[],"lastnames":["Frazier"],"suffixes":[]},{"firstnames":["R."],"propositions":[],"lastnames":["Szechtman"],"suffixes":[]},{"firstnames":["E."],"propositions":[],"lastnames":["Zhou"],"suffixes":[]}],"publisher":"Institute of Electrical and Electronics Engineers, Inc.","address":"Piscataway, NJ","pages":"554–565","doi":"10.1109/WSC.2016.7822121","url_paper":"http://www.informs-sim.org/wsc16papers/050.pdf","abstract":"ASTRO-DF is a class of adaptive sampling algorithms for solving simulation optimization problems in which only estimates of the objective function are available by executing a Monte Carlo simulation. ASTRO-DF algorithms are iterative trust-region algorithms, where a local model is repeatedly constructed and optimized as iterates evolve through the search space. The ASTRO-DF class of algorithms is derivative-free in the sense that it does not rely on direct observations of the function derivatives. A salient feature of ASTRO-DF is the incorporation of adaptive sampling and replication to keep the model error and the trust-region radius in lock-step, to ensure efficiency. ASTRO-DF has been demonstrated to generate iterates that globally converge to a first-order critical point with probability one. In this paper, we describe and list ASTRO-DF, and discuss key heuristics that ensure good finite-time performance. We report our numerical experience with ASTRO-DF on test problems in low to moderate dimensions.","keywords":"simulation optimization > single-objective > continuous","bibbase_note":"<span style=\"color: green\">2016 Winter Simulation Conference I-Sim Best Student Paper Award.</span>","bibtex":"@inproceedings{2016shahunpasWSC,\n\tYear = {2016},\n\tAuthor = {S. Shashaani and S. R. Hunter and R. Pasupathy},\n\tTitle = {{ASTRO-DF}: Adaptive sampling trust-region optimization algorithms, heuristics, and numerical experience},\n\tBooktitle = {Proceedings of the 2016 Winter Simulation Conference},\n\tEditor = {T. M. K. Roeder and P. I. Frazier and R. Szechtman and E. Zhou},\n\tPublisher = {Institute of Electrical and Electronics Engineers, Inc.},\n Address = {Piscataway, NJ},\n Pages = {554--565},\n doi = {10.1109/WSC.2016.7822121},\n url_Paper = {http://www.informs-sim.org/wsc16papers/050.pdf},\n abstract = {ASTRO-DF is a class of adaptive sampling algorithms for solving simulation optimization problems in which only estimates of the objective function are available by executing a Monte Carlo simulation. ASTRO-DF algorithms are iterative trust-region algorithms, where a local model is repeatedly constructed and optimized as iterates evolve through the search space. The ASTRO-DF class of algorithms is derivative-free in the sense that it does not rely on direct observations of the function derivatives. A salient feature of ASTRO-DF is the incorporation of adaptive sampling and replication to keep the model error and the trust-region radius in lock-step, to ensure efficiency. ASTRO-DF has been demonstrated to generate iterates that globally converge to a first-order critical point with probability one. In this paper, we describe and list ASTRO-DF, and discuss key heuristics that ensure good finite-time performance. We report our numerical experience with ASTRO-DF on test problems in low to moderate dimensions.},\n keywords = {simulation optimization > single-objective > continuous},\n bibbase_note = {<span style=\"color: green\">2016 Winter Simulation Conference I-Sim Best Student Paper Award.</span>}}\n\n","author_short":["Shashaani, S.","Hunter, S. R.","Pasupathy, R."],"editor_short":["Roeder, T. M. K.","Frazier, P. I.","Szechtman, R.","Zhou, E."],"key":"2016shahunpasWSC","id":"2016shahunpasWSC","bibbaseid":"shashaani-hunter-pasupathy-astrodfadaptivesamplingtrustregionoptimizationalgorithmsheuristicsandnumericalexperience-2016","role":"author","urls":{" paper":"http://www.informs-sim.org/wsc16papers/050.pdf"},"keyword":["simulation optimization > single-objective > continuous"],"metadata":{"authorlinks":{"hunter, s":"https://web.ics.purdue.edu/~hunter63/","pasupathy, r":"https://bibbase.org/show?bib=web.ics.purdue.edu/~pasupath/rpVitapublist.bib"}},"downloads":3,"html":""},"search_terms":["astro","adaptive","sampling","trust","region","optimization","algorithms","heuristics","numerical","experience","shashaani","hunter","pasupathy"],"keywords":["simulation optimization > single-objective > continuous"],"authorIDs":["kYiaRyZRtgDmgu88o","y867chrGxEuu8ZsWR"],"dataSources":["ZEwmdExPMCtzAbo22","PkcXzWbdqPvM6bmCx","qnbhPCpdghcXAQgXA","Q4TNB6PfH2Ne5F2fj"]}