{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T04:12:44Z","timestamp":1727669564830},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004541","name":"Ministry of Human Resource Development","doi-asserted-by":"crossref","award":["PMRF grant RSPMRF0262"],"id":[{"id":"10.13039\/501100004541","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004541","name":"Ministry of Human Resource Development","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004541","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10479-022-04810-4","type":"journal-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T13:02:51Z","timestamp":1658235771000},"page":"129-146","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Near-optimal solutions of convex semi-infinite programs via targeted sampling"],"prefix":"10.1007","volume":"318","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-6918-6219","authenticated-orcid":false,"given":"Souvik","family":"Das","sequence":"first","affiliation":[]},{"given":"Ashwin","family":"Aravind","sequence":"additional","affiliation":[]},{"given":"Ashish","family":"Cherukuri","sequence":"additional","affiliation":[]},{"given":"Debasish","family":"Chatterjee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"4810_CR1","doi-asserted-by":"crossref","unstructured":"B\u00e9lisle, C. J. P. (1992). Convergence theorems for a class of simulated annealing algorithms on $$\\mathbb{R}^d$$. Journal of Applied Probability, 29(4), 885\u2013895.","DOI":"10.2307\/3214721"},{"key":"4810_CR2","series-title":"Princeton Series in Applied Mathematics","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. S. (2009). Robust optimization. Princeton Series in Applied Mathematics. New Jersey: Princeton University Press."},{"issue":"3","key":"4810_CR3","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s101070100286","volume":"92","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal, A., & Nemirovski, A. S. (2002). Robust optimization: methodology and applications. Mathematical Programming, 92(3), 453\u2013480.","journal-title":"Mathematical Programming"},{"key":"4810_CR4","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2010","unstructured":"Bertsimas, D., Brown, D., & Caramanis, C. (2010). Theory and applications of robust optimization. SIAM Review, 53, 464\u2013501.","journal-title":"SIAM Review"},{"key":"4810_CR5","unstructured":"Betancourt, M. (2018). A conceptual introduction to Hamiltonian Monte Carlo. arxiv:1701.02434."},{"key":"4810_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation analysis of optimization problems","author":"J Bonnans","year":"2000","unstructured":"Bonnans, J., & Shapiro, A. (2000). Perturbation analysis of optimization problems. Berlin: Springer. https:\/\/doi.org\/10.1007\/978-1-4612-1394-9."},{"key":"4810_CR7","doi-asserted-by":"crossref","unstructured":"Borwein, J.M. (1981) Direct theorems in semi-infinite convex programming. Mathematical Programming, (pp. 301\u2013318), Springer.","DOI":"10.1007\/BF01584251"},{"issue":"1","key":"4810_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-003-0499-y","volume":"102","author":"G Calafiore","year":"2005","unstructured":"Calafiore, G., & Campi, M. C. (2005). Uncertain convex programs: randomized solutions and confidence levels. Mathematical Programming, 102(1), 25\u201346.","journal-title":"Mathematical Programming"},{"key":"4810_CR9","doi-asserted-by":"crossref","unstructured":"Campi, M.C. & Garatti, S. (2018) Introduction to the scenario approach. SIAM Series on Optimization.","DOI":"10.1137\/1.9781611975444"},{"issue":"3","key":"4810_CR10","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1137\/07069821X","volume":"19","author":"MC Campi","year":"2008","unstructured":"Campi, M. C., & Garatti, S. (2008). The exact feasibility of randomized solutions of uncertain convex programs. SIAM Journal on Optimization, 19(3), 1211\u20131230.","journal-title":"SIAM Journal on Optimization"},{"issue":"5","key":"4810_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00940812","volume":"34","author":"V C\u0306ern\u00fd","year":"1985","unstructured":"C\u0306ern\u00fd, V. (1985). Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory and Applications, 34(5), 41\u201351.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"4","key":"4810_CR12","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1080\/00031305.1995.10476177","volume":"49","author":"S Chib","year":"1995","unstructured":"Chib, S., & Greenberg, E. (1995). Understanding the Metropolis-Hastings algorithm. The American Statistician, 49(4), 327\u2013335.","journal-title":"The American Statistician"},{"key":"4810_CR13","doi-asserted-by":"crossref","unstructured":"Dall\u2019Aglio, M. (2001) On some applications of LSIP to probability and statistics. In Semi-infinite programming, (pp. 237\u2013254). Springer.","DOI":"10.1007\/978-1-4757-3403-4_11"},{"issue":"1","key":"4810_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10479-018-2987-8","volume":"271","author":"MA Goberna","year":"2018","unstructured":"Goberna, M. A., & L\u00f3pez, M. A. (2018). Recent contributions to linear semi-infinite optimization: an update. Annals of Operations Research, 271(1), 237\u2013278.","journal-title":"Annals of Operations Research"},{"key":"4810_CR15","doi-asserted-by":"crossref","unstructured":"Gribik, P.R. (1979) A central-cutting-plane algorithm for semi-infinite programming problems. In Semi-infinite programming, (pp. 66\u201382). Springer.","DOI":"10.1007\/BFb0003884"},{"issue":"2","key":"4810_CR16","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B Hajek","year":"1988","unstructured":"Hajek, B. (1988). Cooling schedules for optimal annealing. Mathematics of Operations Research, 13(2), 311\u2013329.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"4810_CR17","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1137\/1035089","volume":"35","author":"R Hettich","year":"1993","unstructured":"Hettich, R., & Kortanek, O. K. (1993). Semi-infinite programming: theory, methods, and applications. SIAM Review, 35(3), 380\u2013429.","journal-title":"SIAM Review"},{"issue":"3","key":"4810_CR18","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1137\/1015073","volume":"15","author":"W Hogan","year":"1973","unstructured":"Hogan, W. (1973). Point-to-set maps in mathematical programming. SIAM Review, 15(3), 591\u2013603.","journal-title":"SIAM Review"},{"issue":"5","key":"4810_CR19","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1007\/BF01009452","volume":"34","author":"S Kirkpatrick","year":"1984","unstructured":"Kirkpatrick, S. (1984). Optimization by simulated annealing: quantitative studies. Journal of Statistical Physics, 34(5), 975\u2013986.","journal-title":"Journal of Statistical Physics"},{"key":"4810_CR20","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1137\/0317043","volume":"17","author":"HJ Kushner","year":"1979","unstructured":"Kushner, H. J., & Huang, H. (1979). Rates of convergence for stochastic approximation type algorithms. SIAM Journal on Control and Optimization, 17, 607\u2013617.","journal-title":"SIAM Journal on Control and Optimization"},{"issue":"4","key":"4810_CR21","first-page":"377","volume":"12","author":"PJ Laurent","year":"1978","unstructured":"Laurent, P. J., & Carasso, C. J. (1978). An algorithm of successive minimization in convex programming. Numerical Analysis, 12(4), 377\u2013400.","journal-title":"Numerical Analysis"},{"issue":"7","key":"4810_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0895-7177(97)00184-2","volume":"26","author":"Y Li","year":"1997","unstructured":"Li, Y., & Wang, D. (1997). A semi-infinite programming model for earliness\/tardiness production planning with simulated annealing. Mathematical and Computer Modelling, 26(7), 35\u201342.","journal-title":"Mathematical and Computer Modelling"},{"issue":"2","key":"4810_CR23","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.ejor.2006.08.045","volume":"180","author":"MA L\u00f3pez","year":"2007","unstructured":"L\u00f3pez, M. A., & Still, G. (2007). Semi-infinite programming. European Journal of Operational Research, 180(2), 491\u2013518.","journal-title":"European Journal of Operational Research"},{"key":"4810_CR24","unstructured":"Mangoubi, O., & Smith, A. (2017) Rapid mixing of Hamiltonian Monte Carlo on strongly log-concave distributions. arxiv:1708.07114."},{"key":"4810_CR25","doi-asserted-by":"crossref","unstructured":"Mishal Assif, P.K., Chatterjee, D., & Banavar, R. (2020) Scenario approach for minmax optimization with emphasis on the nonconvex case: positive results and caveats. SIAM Journal on Optimization 1119\u20131143.","DOI":"10.1137\/19M1271026"},{"key":"4810_CR26","doi-asserted-by":"crossref","unstructured":"Quintero-Pe\u00f1a, C., Kyrillidis, A., & Kavraki, L.E. (2021) Robust optimization-based motion planning for high-dof robots under sensing uncertainty. In Proceedings of the IEEE international conference on robotics and automation.","DOI":"10.1109\/ICRA48506.2021.9560917"},{"key":"4810_CR27","doi-asserted-by":"crossref","unstructured":"Robert, C.P., & Casella, G. (1999) Monte carlo statistical methods, chap. The metropolis-hastings algorithm, (pp. 231\u2013283). Springer, New York.","DOI":"10.1007\/978-1-4757-3071-5_6"},{"key":"4810_CR28","doi-asserted-by":"crossref","unstructured":"Smirnov, G.V. (2002) Introduction to the theory of differential inclusions, vol.\u00a041. American Mathematical Society.","DOI":"10.1090\/gsm\/041"},{"key":"4810_CR29","doi-asserted-by":"publisher","unstructured":"Spall, J.C., Hill, S.D., & Stark, D.R. (2002) Theoretical framework for comparing several popular stochastic optimization approaches. In Proceedings of the 2002 american control conference, (vol.\u00a04, pp. 3153\u20133158). https:\/\/doi.org\/10.1109\/ACC.2002.1025274.","DOI":"10.1109\/ACC.2002.1025274"},{"issue":"1","key":"4810_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s101070100239","volume":"91","author":"G Still","year":"2001","unstructured":"Still, G. (2001). Discretization in semi-infinite programming: the rate of convergence. Mathematical Programming, 91(1), 53\u201369.","journal-title":"Mathematical Programming"},{"key":"4810_CR31","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1134\/S0965542510010045","volume":"50","author":"AS Tikhomirov","year":"2010","unstructured":"Tikhomirov, A. S. (2010). On the convergence rate of the simulated annealing algorithm. Computational Mathematics and Mathematical Physics, 50, 19\u201331.","journal-title":"Computational Mathematics and Mathematical Physics"},{"key":"4810_CR32","unstructured":"Weber, G.W .(2003) Generalized semi-infinite optimization and related topics. Heldermann Publishing House."},{"issue":"2","key":"4810_CR33","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/s10479-020-03766-7","volume":"295","author":"B Wei","year":"2020","unstructured":"Wei, B., Haskell, W. B., & Zhao, S. (2020). The CoMirror algorithm with random constraint sampling for convex semi-infinite programming. Annals of Operations Research, 295(2), 809\u2013841.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"4810_CR34","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s00186-019-00698-2","volume":"91","author":"B Wei","year":"2020","unstructured":"Wei, B., Haskell, W. B., & Zhao, S. (2020). An inexact primal-dual algorithm for semi-infinite programming. Mathematical Methods of Operations Research, 91(3), 501\u2013544.","journal-title":"Mathematical Methods of Operations Research"},{"key":"4810_CR35","unstructured":"Werner, R. (2010). Consistency of robust optimization with application to portfolio optimization. Mathematics of Operation Research."},{"issue":"6","key":"4810_CR36","doi-asserted-by":"publisher","first-page":"2959","DOI":"10.1137\/090767133","volume":"20","author":"L Zhang","year":"2010","unstructured":"Zhang, L., Wu, S. Y., & L\u00f3pez, M. A. (2010). A new exchange method for convex semi-infinite programming. SIAM Journal on Optimization, 20(6), 2959\u20132977.","journal-title":"SIAM Journal on Optimization"},{"key":"4810_CR37","series-title":"Springer Optimization and Its Applications","volume-title":"Stochastic global optimization","author":"A Zhigljavsky","year":"2008","unstructured":"Zhigljavsky, A., & Zilinskas, A. (2008). Stochastic global optimization. Springer Optimization and Its Applications. Berlin: Springer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04810-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-022-04810-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04810-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,29]],"date-time":"2024-09-29T11:27:31Z","timestamp":1727609251000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-022-04810-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,19]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["4810"],"URL":"https:\/\/doi.org\/10.1007\/s10479-022-04810-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2022,7,19]]},"assertion":[{"value":"31 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have filed a patent application based on the abstract idea presented in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}