{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T22:04:44Z","timestamp":1759701884009,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T00:00:00Z","timestamp":1595980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T00:00:00Z","timestamp":1595980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100011033","name":"Agencia Estatal de Investigaci\u00f3n","doi-asserted-by":"publisher","award":["TEC2015-698-C2-R ADVENTURE"],"award-info":[{"award-number":["TEC2015-698-C2-R ADVENTURE"]}],"id":[{"id":"10.13039\/501100011033","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012818","name":"Comunidad de Madrid","doi-asserted-by":"publisher","award":["CASICAM-CM S2013\/ICE-2845"],"award-info":[{"award-number":["CASICAM-CM S2013\/ICE-2845"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006318","name":"Universidad Carlos III de Madrid","doi-asserted-by":"publisher","award":["UC3M-Santander Chair of Excellence"],"award-info":[{"award-number":["UC3M-Santander Chair of Excellence"]}],"id":[{"id":"10.13039\/501100006318","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2020,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce and analyze a parallel sequential Monte Carlo methodology for the numerical solution of optimization problems that involve the minimization of a cost function that consists of the sum of many individual components.  The proposed scheme is a stochastic zeroth-order optimization algorithm which demands only the capability to evaluate small subsets of components of the cost function. It can be depicted as a bank of samplers that generate particle approximations of several sequences of probability measures. These measures are constructed in such a way that they have associated probability density functions whose global maxima coincide with the global minima of the original cost function. The algorithm selects the best performing sampler and uses it to approximate a global minimum of the cost function. We prove analytically that the resulting estimator converges to a global minimum of the cost function almost surely and provide explicit convergence rates in terms of the number of generated Monte Carlo samples and the dimension of the search space. We show, by way of numerical examples, that the algorithm can tackle cost functions with multiple minima or with broad \u201cflat\u201d regions which are hard to minimize using gradient-based techniques.<\/jats:p>","DOI":"10.1007\/s11222-020-09964-4","type":"journal-article","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T17:02:46Z","timestamp":1596042166000},"page":"1645-1663","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Parallel sequential Monte Carlo for stochastic gradient-free nonconvex optimization"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5248-1219","authenticated-orcid":false,"given":"\u00d6mer Deniz","family":"Akyildiz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Crisan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joaqu\u00edn","family":"M\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,29]]},"reference":[{"issue":"2","key":"9964_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s11222-019-09884-y","volume":"30","author":"\u00d6D Akyildiz","year":"2020","unstructured":"Akyildiz, \u00d6.D., M\u00edguez, J.: Nudging the particle filter. Stat. Comput. 30(2), 305\u2013330 (2020)","journal-title":"Stat. Comput."},{"key":"9964_CR2","unstructured":"Akyildiz, O.D., Mari\u00f1o, I.P., M\u00edguez, J.: Adaptive noisy importance sampling for stochastic optimization. In: Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 2017 IEEE 7th International Workshop on, IEEE, pp 1\u20135 (2017)"},{"key":"9964_CR3","unstructured":"Akyildiz, O.D., Elvira, V., Miguez, J.: The Incremental Proximal Method: A Probabilistic Perspective. In: Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Calgary, Canada (2018)"},{"issue":"1\u20132","key":"9964_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s11222-014-9521-x","volume":"26","author":"P Alquier","year":"2016","unstructured":"Alquier, P., Friel, N., Everitt, R., Boland, A.: Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels. Stat. Comput. 26(1\u20132), 29\u201347 (2016)","journal-title":"Stat. Comput."},{"issue":"3","key":"9964_CR5","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1137\/S105262340240063X","volume":"14","author":"M Appel","year":"2004","unstructured":"Appel, M., Labarre, R., Radulovic, D.: On accelerated random search. SIAM J. Optim. 14(3), 708\u2013731 (2004)","journal-title":"SIAM J. Optim."},{"key":"9964_CR6","unstructured":"Bach, F., Perchet, V.: Highly-smooth zero-th order online optimization. In: Conference on Learning Theory, pp 257\u2013283 (2016)"},{"key":"9964_CR7","first-page":"1","volume":"2010","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P.: Incremental gradient, subgradient, and proximal methods for convex optimization: a survey. Optim. Mach. Learn. 2010, 1\u201338 (2011)","journal-title":"Optim. Mach. Learn."},{"key":"9964_CR8","volume-title":"Pattern Recognition and Machine Learning","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Springer, Secaucus (2006)"},{"issue":"2","key":"9964_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. Siam Rev. 60(2), 223\u2013311 (2018)","journal-title":"Siam Rev."},{"key":"9964_CR10","unstructured":"Chen, C., Carlson, D., Gan, Z., Li, C., Carin, L.: Bridging the gap between stochastic gradient MCMC and stochastic optimization. In: Artificial Intelligence and Statistics, pp 1051\u20131060 (2016)"},{"key":"9964_CR11","unstructured":"Chen, R., Wild, S.: Randomized derivative-free optimization of noisy convex functions. arXiv preprint arXiv:1507.03332 (2015)"},{"key":"9964_CR12","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to derivative-free optimization, MPS-SIAM Series on Optimization, vol\u00a08. SIAM (2009)","DOI":"10.1137\/1.9780898718768"},{"issue":"4","key":"9964_CR13","doi-asserted-by":"publisher","first-page":"1879","DOI":"10.3150\/13-BEJ545","volume":"20","author":"D Crisan","year":"2014","unstructured":"Crisan, D., M\u00edguez, J.: Particle-kernel estimation of the filter density in state-space models. Bernoulli 20(4), 1879\u20131929 (2014)","journal-title":"Bernoulli"},{"issue":"4A","key":"9964_CR14","doi-asserted-by":"publisher","first-page":"3039","DOI":"10.3150\/17-BEJ954","volume":"24","author":"D Crisan","year":"2018","unstructured":"Crisan, D., Miguez, J.: Nested particle filters for online parameter estimation in discrete-time state-space markov models. Bernoulli 24(4A), 3039\u20133086 (2018)","journal-title":"Bernoulli"},{"key":"9964_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9393-1","volume-title":"Feynman\u2013Kac Formulae: Genealogical and Interacting Particle Systems with Applications","author":"P Del Moral","year":"2004","unstructured":"Del Moral, P.: Feynman\u2013Kac Formulae: Genealogical and Interacting Particle Systems with Applications. Springer, Berlin (2004)"},{"issue":"4","key":"9964_CR16","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1137\/S0040585X97977161","volume":"43","author":"P Del Moral","year":"1999","unstructured":"Del Moral, P., Doisy, M.: Maslov idempotent probability calculus, I. Theory Probab Appl 43(4), 562\u2013576 (1999)","journal-title":"Theory Probab Appl"},{"issue":"3","key":"9964_CR17","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1111\/j.1467-9868.2006.00553.x","volume":"68","author":"P Del Moral","year":"2006","unstructured":"Del Moral, P., Doucet, A., Jasra, A.: Sequential Monte Carlo samplers. J. R. Stat. Soc. Ser. B Stat. Methodol. 68(3), 411\u2013436 (2006)","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"key":"9964_CR18","doi-asserted-by":"crossref","unstructured":"Douc, R., Capp\u00e9, O.: Comparison of resampling schemes for particle filtering. In: Image and Signal Processing and Analysis, 2005. ISPA 2005. In: Proceedings of the 4th International Symposium on, IEEE, pp 64\u201369 (2005)","DOI":"10.1109\/ISPA.2005.195385"},{"key":"9964_CR19","first-page":"2121","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learning Res. 12, 2121\u20132159 (2011)","journal-title":"J. Mach. Learning Res."},{"issue":"7","key":"9964_CR20","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1109\/TSP.2016.2637324","volume":"65","author":"V Elvira","year":"2017","unstructured":"Elvira, V., M\u00edguez, J., Djuri\u0107, P.M.: Adapting the number of particles in sequential monte carlo methods through an online scheme for convergence assessment. IEEE Trans. Signal Process. 65(7), 1781\u20131794 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"456","key":"9964_CR21","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"4","key":"9964_CR22","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first-and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"key":"9964_CR23","unstructured":"G\u00fcrb\u00fczbalaban, M., Ozdaglar, A., Parrilo, P.: Why random reshuffling beats stochastic gradient descent. arXiv preprint arXiv:1510.08560 (2015)"},{"issue":"2","key":"9964_CR24","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evolut. Comput. 9(2), 159\u2013195 (2001)","journal-title":"Evolut. Comput."},{"key":"9964_CR25","doi-asserted-by":"crossref","unstructured":"Hu J, Wang Y, Zhou E, Fu MC, Marcus SI (2012) A survey of some model-based methods for global optimization. In: Hern\u00e1ndez-Hern\u00e1ndez, D., Minj\u00e1rez, J.A. (eds.) Optimization, Control, and Applications of Stochastic Systems, Springer, pp 157\u2013179","DOI":"10.1007\/978-0-8176-8337-5_10"},{"issue":"1","key":"9964_CR26","doi-asserted-by":"publisher","first-page":"288","DOI":"10.3182\/20050703-6-CZ-1902.00702","volume":"38","author":"E Ikonen","year":"2005","unstructured":"Ikonen, E., Najim, K., Del Moral, P.: Application of genealogical decision trees for open-loop tracking control. IFAC Proc. Vol. 38(1), 288\u2013293 (2005)","journal-title":"IFAC Proc. Vol."},{"key":"9964_CR27","unstructured":"Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv:1412.6980 (2014)"},{"issue":"4598","key":"9964_CR28","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"4","key":"9964_CR29","doi-asserted-by":"publisher","first-page":"2753","DOI":"10.1137\/18M1192536","volume":"29","author":"G Lan","year":"2019","unstructured":"Lan, G., Yang, Y.: Accelerated stochastic algorithms for nonconvex finite-sum and multiblock optimization. SIAM J. Optim. 29(4), 2753\u20132784 (2019)","journal-title":"SIAM J. Optim."},{"key":"9964_CR30","doi-asserted-by":"crossref","unstructured":"Liu B, Cheng S, Shi Y (2016) Particle filter optimization: A brief introduction. In: International Conference on Swarm Intelligence, Springer, pp 95\u2013104","DOI":"10.1007\/978-3-319-41000-5_10"},{"issue":"5","key":"9964_CR31","doi-asserted-by":"publisher","first-page":"057203","DOI":"10.1103\/PhysRevE.76.057203","volume":"76","author":"IP Mari\u00f1o","year":"2007","unstructured":"Mari\u00f1o, I.P., M\u00edguez, J.: Monte Carlo method for multiparameter estimation in coupled chaotic systems. Phys. Rev. E 76(5), 057203 (2007)","journal-title":"Phys. Rev. E"},{"issue":"6A","key":"9964_CR32","doi-asserted-by":"publisher","first-page":"2747","DOI":"10.1214\/17-AOS1637","volume":"46","author":"S Mei","year":"2018","unstructured":"Mei, S., Bai, Y., Montanari, A.: The landscape of empirical risk for nonconvex losses. Ann. Stat. 46(6A), 2747\u20132774 (2018)","journal-title":"Ann. Stat."},{"issue":"1","key":"9964_CR33","first-page":"56","volume":"19","author":"T Homem-de Mello","year":"2014","unstructured":"Homem-de Mello, T., Bayraksan, G.: Monte carlo sampling-based methods for stochastic optimization. Surv. Oper. Res. Manag. Sci. 19(1), 56\u201385 (2014)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"issue":"5","key":"9964_CR34","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1016\/j.sigpro.2009.11.007","volume":"90","author":"J Miguez","year":"2010","unstructured":"Miguez, J.: Analysis of a sequential Monte Carlo method for optimization in dynamical systems. Signal Process. 90(5), 1609\u20131622 (2010)","journal-title":"Signal Process."},{"issue":"1","key":"9964_CR35","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s11222-011-9294-4","volume":"23","author":"J M\u00edguez","year":"2013","unstructured":"M\u00edguez, J., Crisan, D., Djuri\u0107, P.M.: On the convergence of two sequential monte carlo methods for maximum a posteriori sequence estimation and stochastic global optimization. Stat. Comput. 23(1), 91\u2013107 (2013)","journal-title":"Stat. Comput."},{"key":"9964_CR36","doi-asserted-by":"crossref","unstructured":"Morse, G., Stanley, K.O.: Simple evolutionary optimization can rival stochastic gradient descent in neural networks. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, ACM, pp 477\u2013484 (2016)","DOI":"10.1145\/2908812.2908916"},{"key":"9964_CR37","unstructured":"Nesterov, Y., Spokoiny, V.: Random gradient-free minimization of convex functions. Technical report, Universit\u00e9 catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2011)"},{"issue":"2","key":"9964_CR38","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/JSTSP.2015.2496908","volume":"10","author":"M Pereyra","year":"2015","unstructured":"Pereyra, M., Schniter, P., Chouzenoux, E., Pesquet, J.C., Tourneret, J.Y., Hero, A.O., McLaughlin, S.: A survey of stochastic simulation and optimization methods in signal processing. IEEE J. Select. Top. Signal Process. 10(2), 224\u2013241 (2015)","journal-title":"IEEE J. Select. Top. Signal Process."},{"key":"9964_CR39","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22, 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"9964_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4145-2","volume-title":"Monte Carlo statistical methods","author":"CP Robert","year":"2004","unstructured":"Robert, C.P., Casella, G.: Monte Carlo statistical methods. Wiley, New York (2004)"},{"key":"9964_CR41","unstructured":"Salimans, T., Ho, J., Chen, X., Sidor, S., Sutskever, I.: Evolution strategies as a scalable alternative to reinforcement learning. arXiv preprint arXiv:1703.03864 (2017)"},{"key":"9964_CR42","unstructured":"Shamir, O.: Without-replacement sampling for stochastic gradient methods. In: Advances in Neural Information Processing Systems, pp 46\u201354 (2016)"},{"key":"9964_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2539-1","volume-title":"Probability","author":"AN Shiryaev","year":"1996","unstructured":"Shiryaev, A.N.: Probability. Springer, Berlin (1996)"},{"key":"9964_CR44","volume-title":"Density Estimation for Statistics and Data Analysis","author":"BW Silverman","year":"1998","unstructured":"Silverman, B.W.: Density Estimation for Statistics and Data Analysis. Routledge, Abingdon (1998)"},{"key":"9964_CR45","volume-title":"Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control","author":"JC Spall","year":"2005","unstructured":"Spall, J.C.: Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control, vol. 65. Wiley, New York (2005)"},{"issue":"4","key":"9964_CR46","doi-asserted-by":"publisher","first-page":"2002","DOI":"10.1016\/j.jcp.2011.11.019","volume":"231","author":"P Stinis","year":"2012","unstructured":"Stinis, P.: Stochastic global optimization as a filtering problem. J. Comput. Phys. 231(4), 2002\u20132014 (2012)","journal-title":"J. Comput. Phys."},{"issue":"2","key":"9964_CR47","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s11222-013-9429-x","volume":"25","author":"C Verg\u00e9","year":"2015","unstructured":"Verg\u00e9, C., Dubarry, C., Del Moral, P., Moulines, E.: On parallel implementation of sequential monte carlo methods: the island particle model. Stat. Comput. 25(2), 243\u2013260 (2015)","journal-title":"Stat. Comput."},{"key":"9964_CR48","doi-asserted-by":"publisher","DOI":"10.1201\/b14876","volume-title":"Kernel Smoothing","author":"MP Wand","year":"1994","unstructured":"Wand, M.P., Jones, M.C.: Kernel Smoothing. Chapman and Hall\/CRC, Boca Raton (1994)"},{"key":"9964_CR49","unstructured":"Welling, M., Teh, Y.W.: Bayesian learning via stochastic gradient langevin dynamics. In: Proceedings of the 28th International Conference on Machine Learning (ICML-11), pp 681\u2013688 (2011)"},{"key":"9964_CR50","unstructured":"Wibisono, A., Wainwright, M.J., Jordan, M.I., Duchi, J.C.: Finite sample convergence rates of zero-order stochastic optimization methods. In: Advances in Neural Information Processing Systems, pp 1439\u20131447 (2012)"},{"issue":"1","key":"9964_CR51","first-page":"949","volume":"15","author":"D Wierstra","year":"2014","unstructured":"Wierstra, D., Schaul, T., Glasmachers, T., Sun, Y., Peters, J., Schmidhuber, J.: Natural evolution strategies. J. Mach. Learn. Res. 15(1), 949\u2013980 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"9964_CR52","doi-asserted-by":"crossref","unstructured":"Zhou, E., Chen, X.: Sequential monte carlo simulated annealing. J. Global Optim. 55(1), 101\u2013124 (2013)","DOI":"10.1007\/s10898-011-9838-3"},{"issue":"4","key":"9964_CR53","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1109\/TAC.2013.2281132","volume":"59","author":"E Zhou","year":"2013","unstructured":"Zhou, E., Fu, M.C., Marcus, S.I.: Particle filtering framework for a class of randomized optimization algorithms. IEEE Trans. Autom. Contr. 59(4), 1025\u20131030 (2013)","journal-title":"IEEE Trans. Autom. Contr."},{"key":"9964_CR54","unstructured":"Zinkevich, M., Weimer, M., Li, L., Smola, A.J.: Parallelized stochastic gradient descent. In: Advances in neural information processing systems, pp 2595\u20132603 (2010)"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-020-09964-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-020-09964-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-020-09964-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T23:13:17Z","timestamp":1627513997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-020-09964-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,29]]},"references-count":54,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["9964"],"URL":"https:\/\/doi.org\/10.1007\/s11222-020-09964-4","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"type":"print","value":"0960-3174"},{"type":"electronic","value":"1573-1375"}],"subject":[],"published":{"date-parts":[[2020,7,29]]},"assertion":[{"value":"3 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}