{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T18:40:08Z","timestamp":1730486408589,"version":"3.28.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"crossref","award":["DE-AC02-06CH11357"],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10957-024-02532-0","type":"journal-article","created":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T20:34:45Z","timestamp":1727987685000},"page":"767-809","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Empirical Quantile Estimation Approach for Chance-Constrained Nonlinear Optimization Problems"],"prefix":"10.1007","volume":"203","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-7541-5487","authenticated-orcid":false,"given":"Fengqiao","family":"Luo","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9924-2082","authenticated-orcid":false,"given":"Jeffrey","family":"Larson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,3]]},"reference":[{"issue":"4","key":"2532_CR1","doi-asserted-by":"publisher","first-page":"1864","DOI":"10.1137\/130922689","volume":"24","author":"W van Ackooij","year":"2014","unstructured":"van Ackooij, W., Henrion, R.: Gradient formulae for nonlinear probabilistic constraints with Gaussian and Gaussian-like distributions. SIAM J. Optim. 24(4), 1864\u20131889 (2014). https:\/\/doi.org\/10.1137\/130922689","journal-title":"SIAM J. Optim."},{"key":"2532_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10589-005-1066-7","volume":"31","author":"EG Birgin","year":"2012","unstructured":"Birgin, E.G., Castillo, R.A., Mart\u00ednez, J.M.: Numerical comparison of augmented Lagrangian algorithms for nonconvex programs. Comput. Optim. Appl. 31, 31\u201355 (2012). https:\/\/doi.org\/10.1007\/s10589-005-1066-7","journal-title":"Comput. Optim. Appl."},{"issue":"6","key":"2532_CR3","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1080\/10556788.2011.556634","volume":"27","author":"EG Birgin","year":"2012","unstructured":"Birgin, E.G., Fern\u00e1ndez, D., Mart\u00ednez, J.M.: The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems. Optim. Methods Softw. 27(6), 1001\u20131024 (2012). https:\/\/doi.org\/10.1080\/10556788.2011.556634","journal-title":"Optim. Methods Softw."},{"key":"2532_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973365","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Practical augmented Lagrangian methods for constrained optimization. Soc. Ind. Appl. Math. (2014). https:\/\/doi.org\/10.1137\/1.9781611973365","journal-title":"Soc. Ind. Appl. Math."},{"key":"2532_CR5","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.: Uncertain convex programs: randomized solutions and confidence levels. Math. Prog. 102, 25\u201346 (2005). https:\/\/doi.org\/10.1007\/s10107-003-0499-y","journal-title":"Math. Prog."},{"key":"2532_CR6","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1109\/TAC.2006.875041","volume":"51","author":"G Calafiore","year":"2006","unstructured":"Calafiore, G., Campi, M.C.: The scenario approach to robust control desgin. IEEE Trans. Autom. Control 51, 742\u2013753 (2006). https:\/\/doi.org\/10.1109\/TAC.2006.875041","journal-title":"IEEE Trans. Autom. Control"},{"key":"2532_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10957-010-9754-6","volume":"148","author":"MC Campi","year":"2011","unstructured":"Campi, M.C., Garatti, S.: A sampling-and-discarding approach to chance-constrained optimization: feasibility and optimality. J. Optim. Theory Appl. 148, 257\u2013280 (2011). https:\/\/doi.org\/10.1007\/s10957-010-9754-6","journal-title":"J. Optim. Theory Appl."},{"key":"2532_CR8","doi-asserted-by":"publisher","unstructured":"Cao, Y., Zavala, V.M.: A sigmoidal approximation for chance-constrained nonlinear programs. Technical Report, arXiv:2004.02402 (2020). https:\/\/doi.org\/10.48550\/arXiv.2004.02402","DOI":"10.48550\/arXiv.2004.02402"},{"issue":"3","key":"2532_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1287\/mnsc.4.3.235","volume":"4","author":"A Charnes","year":"1958","unstructured":"Charnes, A., Cooper, W.W., Symonds, G.H.: Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil. Manag. Sci. 4(3), 235\u2013263 (1958). https:\/\/doi.org\/10.1287\/mnsc.4.3.235","journal-title":"Manag. Sci."},{"issue":"4","key":"2532_CR10","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1214\/aos\/1176344261","volume":"6","author":"M Cs\u00f6rg\u0151","year":"1978","unstructured":"Cs\u00f6rg\u0151, M., R\u00e9v\u00e9sz, P.: Strong approximation of the quantile process. Ann. Stat. 6(4), 882\u2013894 (1978). https:\/\/doi.org\/10.1214\/aos\/1176344261","journal-title":"Ann. Stat."},{"issue":"1","key":"2532_CR11","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1137\/19M1261985","volume":"28","author":"FE Curtis","year":"2018","unstructured":"Curtis, F.E., W\u00e4chter, A., Zavala, V.M.: A sequential algorithm for solving nonlinear optimization problems with chance constraints. SIAM J. Optim. 28(1), 930\u2013958 (2018). https:\/\/doi.org\/10.1137\/19M1261985","journal-title":"SIAM J. Optim."},{"key":"2532_CR12","doi-asserted-by":"publisher","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic subgradient method converges at the rate $$O(k^{-1\/4})$$ on weakly convex functions. Technical Report, arXiv:1802.02988 (2018). https:\/\/doi.org\/10.48550\/arXiv.1802.02988","DOI":"10.48550\/arXiv.1802.02988"},{"key":"2532_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/9781108591034","volume-title":"Probability: Theory and Examples","author":"R Durrett","year":"2019","unstructured":"Durrett, R.: Probability: Theory and Examples. Cambridge University Press, Cambridge (2019). https:\/\/doi.org\/10.1017\/9781108591034"},{"issue":"3","key":"2532_CR14","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1016\/j.ejor.2008.09.026","volume":"198","author":"J Garnier","year":"2009","unstructured":"Garnier, J., Omrane, A., Rouchdy, Y.: Asymptotic formulas for the derivatives of probability functions and their Monte Carlo estimations. Eur. J. Oper. Res. 198(3), 848\u2013858 (2009). https:\/\/doi.org\/10.1016\/j.ejor.2008.09.026","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2532_CR15","doi-asserted-by":"publisher","first-page":"1834","DOI":"10.1137\/19M1261985","volume":"27","author":"A Geletu","year":"2017","unstructured":"Geletu, A., Hoffmann, A., Kl\u00f6ppel, M., Li, P.: An inner-outer approximation approach to chance constrained optimization. SIAM J. Optim. 27(3), 1834\u20131857 (2017). https:\/\/doi.org\/10.1137\/19M1261985","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2532_CR16","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1287\/moor.1120.0544","volume":"37","author":"R Henrion","year":"2012","unstructured":"Henrion, R., M\u00f6ller, A.: A gradient formula for linear chance constraints under Gaussian distribution. Math. Oper. Res. 37(3), 475\u2013488 (2012). https:\/\/doi.org\/10.1287\/moor.1120.0544","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2532_CR17","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1287\/opre.1080.0531","volume":"57","author":"LJ Hong","year":"2009","unstructured":"Hong, L.J.: Estimating quantile sensitivities. Oper. Res. 57(1), 118\u2013130 (2009). https:\/\/doi.org\/10.1287\/opre.1080.0531","journal-title":"Oper. Res."},{"key":"2532_CR18","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2022.1214","author":"J Hu","year":"2022","unstructured":"Hu, J., Peng, Y., Zhang, G., Zhang, Q.: A stochastic approximation method for simulation-based quantile optimization. INFORMS J. Comput. (2022). https:\/\/doi.org\/10.1287\/ijoc.2022.1214","journal-title":"INFORMS J. Comput."},{"key":"2532_CR19","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10107-015-0929-7","volume":"158","author":"R Jiang","year":"2016","unstructured":"Jiang, R., Guan, Y.: Data-driven chance constrained stochastic program. Math. Program. 158, 291\u2013327 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0929-7","journal-title":"Math. Program."},{"key":"2532_CR20","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/s12532-020-00199-y","volume":"13","author":"R Kannan","year":"2021","unstructured":"Kannan, R., Luedtke, J.R.: A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs. Math. Program. Comput. 13, 705\u2013751 (2021). https:\/\/doi.org\/10.1007\/s12532-020-00199-y","journal-title":"Math. Program. Comput."},{"issue":"3","key":"2532_CR21","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0898-1221(95)00113-1","volume":"30","author":"AI Kibzun","year":"1995","unstructured":"Kibzun, A.I., Uryas\u2019ev, S.: Differentiation of probability functions: the transformation method. Comput. Math. Appl. 30(3), 361\u2013382 (1995). https:\/\/doi.org\/10.1016\/0898-1221(95)00113-1","journal-title":"Comput. Math. Appl."},{"issue":"6","key":"2532_CR22","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1080\/07362999808809581","volume":"16","author":"AI Kibzun","year":"1998","unstructured":"Kibzun, A.I., Uryas\u2019ev, S.: Differentiability of probability function. Stoch. Anal. Appl. 16(6), 1101\u20131128 (1998). https:\/\/doi.org\/10.1080\/07362999808809581","journal-title":"Stoch. Anal. Appl."},{"key":"2532_CR23","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10107-010-0385-3","volume":"132","author":"S K\u00fc\u00e7\u00fckyavuz","year":"2012","unstructured":"K\u00fc\u00e7\u00fckyavuz, S.: On mixing sets arising in chance-constrained programming. Math. Program. 132, 31\u201356 (2012). https:\/\/doi.org\/10.1007\/s10107-010-0385-3","journal-title":"Math. Program."},{"issue":"3","key":"2532_CR24","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s10589-016-9827-z","volume":"64","author":"J Larson","year":"2016","unstructured":"Larson, J., Billups, S.C.: Stochastic derivative-free optimization using a trust region framework. Comput. Optim. Appl. 64(3), 619\u2013645 (2016). https:\/\/doi.org\/10.1007\/s10589-016-9827-z","journal-title":"Comput. Optim. Appl."},{"key":"2532_CR25","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2021.1233","author":"J Liu","year":"2022","unstructured":"Liu, J., Lisser, A., Chen, Z.: Distributionally robust chance constrained geometric optimization. Math. Oper. Res. (2022). https:\/\/doi.org\/10.1287\/moor.2021.1233","journal-title":"Math. Oper. Res."},{"key":"2532_CR26","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107-014-0832-7","volume":"157","author":"X Liu","year":"2016","unstructured":"Liu, X., K\u00fc\u00e7\u00fckyavuz, S., Luedtke, J.: Decomposition algorithms for two-stage chance-constrained programs. Math. Program. 157, 219\u2013243 (2016). https:\/\/doi.org\/10.1007\/s10107-014-0832-7","journal-title":"Math. Program."},{"key":"2532_CR27","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10107-019-01447-3","volume":"191","author":"A Lodi","year":"2022","unstructured":"Lodi, A., Malaguti, E., Nannicini, G., Thomopulos, D.: Nonlinear chance-constrained problems with applications to hydro scheduling. Math. Program. 191, 405\u2013444 (2022). https:\/\/doi.org\/10.1007\/s10107-019-01447-3","journal-title":"Math. Program."},{"key":"2532_CR28","doi-asserted-by":"crossref","unstructured":"Lo\u00e8ve, M.: On almost sure convergence. Berkeley Symposium on Mathematical Statistics and Probability 2, 279\u2013303 (1951). https:\/\/projecteuclid.org\/ebook\/Download?urlid=bsmsp\/1200500235&isFullBook=false","DOI":"10.1525\/9780520411586-022"},{"key":"2532_CR29","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107-013-0684-6","volume":"146","author":"J Luedtke","year":"2014","unstructured":"Luedtke, J.: A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. Math. Program. 146, 219\u2013244 (2014). https:\/\/doi.org\/10.1007\/s10107-013-0684-6","journal-title":"Math. Program."},{"issue":"2","key":"2532_CR30","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/070702928","volume":"19","author":"J Luedtke","year":"2008","unstructured":"Luedtke, J., Ahmed, S.: A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. 19(2), 674\u2013699 (2008). https:\/\/doi.org\/10.1137\/070702928","journal-title":"SIAM J. Optim."},{"key":"2532_CR31","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-008-0247-4","volume":"122","author":"J Luedtke","year":"2010","unstructured":"Luedtke, J., Ahmed, S., Nemhauser, G.L.: An integer programming approach for linear programs with probabilistic constraints. Math. Program. 122, 247\u2013272 (2010). https:\/\/doi.org\/10.1007\/s10107-008-0247-4","journal-title":"Math. Program."},{"key":"2532_CR32","doi-asserted-by":"publisher","unstructured":"Luo, F., Larson, J.: Quantile optimization software (2023). https:\/\/doi.org\/10.5281\/zenodo.10044073","DOI":"10.5281\/zenodo.10044073"},{"issue":"1","key":"2532_CR33","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0022-247X(67)90163-1","volume":"17","author":"O Mangasarian","year":"1967","unstructured":"Mangasarian, O., Fromovitz, S.: The Fritz John necessary optimality conditions in the presence of equality and inequality constraints. J. Math. Anal. Appl. 17(1), 37\u201347 (1967). https:\/\/doi.org\/10.1016\/0022-247X(67)90163-1","journal-title":"J. Math. Anal. Appl."},{"key":"2532_CR34","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/1-84628-095-8_1","volume-title":"Probab. Random. Methods Des. Under Uncertainty","author":"A Nemirovski","year":"2005","unstructured":"Nemirovski, A., Shapiro, A.: Scenario approximation of chance constraints. In: Calafiore, G., Dabbene, F. (eds.) Probab. Random. Methods Des. Under Uncertainty, pp. 3\u201348. Springer, London (2005). https:\/\/doi.org\/10.1007\/1-84628-095-8_1"},{"issue":"3","key":"2532_CR35","doi-asserted-by":"publisher","first-page":"2221","DOI":"10.1137\/19M1261985","volume":"30","author":"A Pe\u00f1a-Ordieres","year":"2020","unstructured":"Pe\u00f1a-Ordieres, A., Luedtke, J.R., W\u00e4chter, A.: Solving chance-constrained problems via a smooth sample-based nonlinear approximation. SIAM J. Optim. 30(3), 2221\u20132250 (2020). https:\/\/doi.org\/10.1137\/19M1261985","journal-title":"SIAM J. Optim."},{"issue":"6","key":"2532_CR36","doi-asserted-by":"publisher","first-page":"1896","DOI":"10.1287\/opre.2019.1978","volume":"68","author":"Y Peng","year":"2020","unstructured":"Peng, Y., Fu, M.C., Heidergott, B., Lam, H.: Maximum likelihood estimation by Monte Carlo simulation: toward data-driven stochastic modeling. Oper. Res. 68(6), 1896\u20131912 (2020). https:\/\/doi.org\/10.1287\/opre.2019.1978","journal-title":"Oper. Res."},{"issue":"3","key":"2532_CR37","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1137\/S1052623403431639","volume":"15","author":"GC Pflug","year":"2005","unstructured":"Pflug, G.C., Weisshaupt, H.: Probability gradient estimation by set-valued calculus and applications in network design. SIAM J. Optim. 15(3), 898\u2013914 (2005). https:\/\/doi.org\/10.1137\/S1052623403431639","journal-title":"SIAM J. Optim."},{"key":"2532_CR38","doi-asserted-by":"publisher","unstructured":"Pr\u00e9kopa, A.: On probabilistic constrained programming. In: Proceedings of the Princeton Symposium on Mathematical Programming, pp. 113\u2013138 (1970). https:\/\/doi.org\/10.1515\/9781400869930-009","DOI":"10.1515\/9781400869930-009"},{"issue":"4","key":"2532_CR39","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1137\/S1052623497326629","volume":"10","author":"L Qi","year":"2000","unstructured":"Qi, L., Wei, Z.: On the constant positive linear independence condition and its application to SQP methods. SIAM J. Optim. 10(4), 963\u2013981 (2000). https:\/\/doi.org\/10.1137\/S1052623497326629","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2532_CR40","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1137\/20M1382490","volume":"32","author":"S Tong","year":"2022","unstructured":"Tong, S., Subramanyam, A., Rao, V.: Optimization under rare chance constraints. SIAM J. Optim. 32(2), 930\u2013958 (2022). https:\/\/doi.org\/10.1137\/20M1382490","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2532_CR41","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0377-0427(94)90388-3","volume":"56","author":"S Uryas\u2019ev","year":"1994","unstructured":"Uryas\u2019ev, S.: Derivatives of probability functions and integrals over sets given by inequalities. J. Comput. Appl. Math. 56(1), 197\u2013223 (1994). https:\/\/doi.org\/10.1016\/0377-0427(94)90388-3","journal-title":"J. Comput. Appl. Math."},{"key":"2532_CR42","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1137\/1.9781611974683.ch40","volume-title":"Advances and Trends in Optimization with Engineering Applications","author":"SM Wild","year":"2017","unstructured":"Wild, S.M.: Solving derivative-free nonlinear least squares problems with POUNDERS. In: Terlaky, T., Anjos, M.F., Ahmed, S. (eds.) Advances and Trends in Optimization with Engineering Applications, pp. 529\u2013540. SIAM, Philadelphia (2017). https:\/\/doi.org\/10.1137\/1.9781611974683.ch40"},{"key":"2532_CR43","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-019-01445-5","volume":"186","author":"W Xie","year":"2021","unstructured":"Xie, W.: On distributionally robust chance constrained programs with Wasserstein distance. Math. Program. 186, 115\u2013155 (2021). https:\/\/doi.org\/10.1007\/s10107-019-01445-5","journal-title":"Math. Program."},{"key":"2532_CR44","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/s10107-017-1190-z","volume":"172","author":"W Xie","year":"2018","unstructured":"Xie, W., Ahmed, S.: On quantile cuts and their closure for chance constrained optimization problems. Math. Program. 172, 621\u2013646 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1190-z","journal-title":"Math. Program."},{"issue":"2","key":"2532_CR45","doi-asserted-by":"publisher","first-page":"1664","DOI":"10.1137\/18M1229869","volume":"30","author":"Y Xu","year":"2020","unstructured":"Xu, Y.: Primal-dual stochastic gradient method for convex programs with many functional constraints. SIAM J. Optim. 30(2), 1664\u20131692 (2020). https:\/\/doi.org\/10.1137\/18M1229869","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02532-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02532-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02532-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T18:06:38Z","timestamp":1730484398000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02532-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["2532"],"URL":"http:\/\/dx.doi.org\/10.1007\/s10957-024-02532-0","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2024,10]]},"assertion":[{"value":"9 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}
