{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T15:19:22Z","timestamp":1772291962789,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T00:00:00Z","timestamp":1550102400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DGE-1650604"],"award-info":[{"award-number":["DGE-1650604"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006221","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2013003"],"award-info":[{"award-number":["2013003"]}],"id":[{"id":"10.13039\/100006221","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10898-019-00747-4","type":"journal-article","created":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T00:24:40Z","timestamp":1550103880000},"page":"95-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5560-750X","authenticated-orcid":false,"given":"Howard","family":"Heaton","sequence":"first","affiliation":[]},{"given":"Yair","family":"Censor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,14]]},"reference":[{"key":"747_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0024-3795(89)90375-3","volume":"120","author":"R Aharoni","year":"1989","unstructured":"Aharoni, R., Censor, Y.: Block-iterative projection methods for parallel computation of solutions to convex feasibility problems. Linear Algebra Appl. 120, 165\u2013175 (1989)","journal-title":"Linear Algebra Appl."},{"key":"747_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1011253113155","volume":"9","author":"F Alvarez","year":"2001","unstructured":"Alvarez, F., Attouch, H.: An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set-Valued Anal. 9, 3\u201311 (2001)","journal-title":"Set-Valued Anal."},{"key":"747_CR3","first-page":"1","volume":"4","author":"JB Bailion","year":"1978","unstructured":"Bailion, J.B., Bruck, R.E., Reich, S.: On the asymptotic behavior of nonexpansive mappings and semigroups in Banach spaces. Houston J. Math. 4, 1\u20139 (1978)","journal-title":"Houston J. Math."},{"key":"747_CR4","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"H Bauschke","year":"1996","unstructured":"Bauschke, H., Borwein, J.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"747_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"H Bauschke","year":"2017","unstructured":"Bauschke, H., Combettes, P.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, Berlin (2017)","edition":"2"},{"key":"747_CR6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11075-005-9010-6","volume":"41","author":"H Bauschke","year":"2006","unstructured":"Bauschke, H., Combettes, P., Kruk, S.: Extrapolation algorithm for affine-convex feasibility problems. Numer. Algorithms 41, 239\u2013274 (2006)","journal-title":"Numer. Algorithms"},{"key":"747_CR7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-4-431-54907-9_14","volume-title":"The Impact of Applications on Mathematics","author":"H Bauschke","year":"2014","unstructured":"Bauschke, H., Iorio, F., Koch, V.: The method of cyclic intrepid projections: convergence analysis and numerical experiments. In: Wakayama, M., Anderssen, R., Cheng, J., Fukumoto, Y., McKibbin, R., Polthier, K., Takagi, T., Toh, K.C. (eds.) The Impact of Applications on Mathematics, pp. 187\u2013200. Springer Japan, Tokyo (2014)"},{"key":"747_CR8","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D Bertsekas","year":"1989","unstructured":"Bertsekas, D., Tsitsiklis, J.: Parallel and Distributed Computation: Numerical Methods. Prentice Hall, Englewood Cliffs (1989)"},{"key":"747_CR9","volume-title":"Iterative Methods for Fixed Point Problems in Hilbert Spaces. Lecture Notes in Mathematics","author":"A Cegielski","year":"2012","unstructured":"Cegielski, A.: Iterative Methods for Fixed Point Problems in Hilbert Spaces. Lecture Notes in Mathematics, vol. 2057. Springer, Berlin (2012)"},{"key":"747_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0022-247X(85)90127-1","volume":"106","author":"Y Censor","year":"1985","unstructured":"Censor, Y.: An automatic relaxation method for solving interval linear inequalities. J. Math. Anal. Appl. 106, 19\u201325 (1985)","journal-title":"J. Math. Anal. Appl."},{"key":"747_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF01589408","volume":"42","author":"Y Censor","year":"1988","unstructured":"Censor, Y.: Parallel application of block-iterative methods in medical imaging and radiation therapy. Math. Program. 42, 307\u2013325 (1988)","journal-title":"Math. Program."},{"key":"747_CR12","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1088\/0266-5611\/4\/3\/006","volume":"4","author":"Y Censor","year":"1988","unstructured":"Censor, Y., Altschuler, M., Powlis, W.: On the use of Cimmino\u2019s simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning. Inverse Probl. 4, 607 (1988)","journal-title":"Inverse Probl."},{"key":"747_CR13","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1007\/s10589-011-9401-7","volume":"51","author":"Y Censor","year":"2012","unstructured":"Censor, Y., Chen, W., Combettes, P., Davidi, R., Herman, G.: On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints. Comput. Optim. Appl. 51, 1065\u20131088 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"747_CR14","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1137\/S089547980138705X","volume":"24","author":"Y Censor","year":"2002","unstructured":"Censor, Y., Elfving, T.: Block-iterative algorithms with diagonally scaled oblique projections for the linear feasibility problem. SIAM J. Matrix Anal. Appl. 24, 40\u201358 (2002)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"747_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S1570-579X(01)80009-4","volume-title":"Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications","author":"Y Censor","year":"2001","unstructured":"Censor, Y., Elfving, T., Herman, G.: Averaging strings of sequential iterations for convex feasibility problems. In: Butnariu, D., Censor, Y., Reich, S. (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, pp. 101\u2013113. Elsevier, Amsterdam (2001)"},{"key":"747_CR16","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/050639399","volume":"30","author":"Y Censor","year":"2008","unstructured":"Censor, Y., Elfving, T., Herman, G., Nikazad, T.: On diagonally relaxed orthogonal projection methods. SIAM J. Sci. Comput. 30, 473\u2013504 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"747_CR17","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1109\/42.959302","volume":"20","author":"Y Censor","year":"2001","unstructured":"Censor, Y., Gordon, D., Gordon, R.: BICAV: a block-iterative parallel algorithm for sparse systems with pixel-related weighting. IEEE Trans. Med. Imaging 20, 1050\u20131060 (2001)","journal-title":"IEEE Trans. Med. Imaging"},{"key":"747_CR18","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1016\/S0167-8191(00)00100-9","volume":"27","author":"Y Censor","year":"2001","unstructured":"Censor, Y., Gordon, D., Gordon, R.: Component averaging: an efficient iterative parallel algorithm for large and sparse unstructured problems. Parallel Comput. 27, 777\u2013808 (2001)","journal-title":"Parallel Comput."},{"key":"747_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10957-017-1174-4","volume":"176","author":"Y Censor","year":"2018","unstructured":"Censor, Y., Mansour, R.: Convergence analysis of processes with valiant projection operators in hilbert space. J. Optim. Theory Appl. 176, 35\u201356 (2018)","journal-title":"J. Optim. Theory Appl."},{"key":"747_CR20","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1080\/02331939608844225","volume":"37","author":"Y Censor","year":"1996","unstructured":"Censor, Y., Reich, S.: Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization. Optimization 37, 323\u2013339 (1996)","journal-title":"Optimization"},{"key":"747_CR21","volume-title":"Parallel Optimization: Theory, Algorithm, and Applications","author":"Y Censor","year":"1997","unstructured":"Censor, Y., Zenios, S.: Parallel Optimization: Theory, Algorithm, and Applications. Oxford University Press, New York (1997)"},{"key":"747_CR22","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0024-3795(69)90028-7","volume":"2","author":"D Chazan","year":"1969","unstructured":"Chazan, D., Miranker, W.: Chaotic relaxation. Linear Algebra Appl. 2, 199\u2013222 (1969)","journal-title":"Linear Algebra Appl."},{"key":"747_CR23","first-page":"326","volume":"1","author":"G Cimmino","year":"1938","unstructured":"Cimmino, G.: Cacolo approssimato per soluzioni dei sistemi di equazioni lineari. La Ricerca Scientifica XVI, Series II, Anno IX 1, 326\u2013333 (1938)","journal-title":"La Ricerca Scientifica XVI, Series II, Anno IX"},{"key":"747_CR24","volume-title":"The Convex Feasibility Problem in Image Recovery","author":"P Combettes","year":"1996","unstructured":"Combettes, P.: The Convex Feasibility Problem in Image Recovery, vol. 95. Academic Press, New York (1996)"},{"key":"747_CR25","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10107-016-1044-0","volume":"168","author":"P Combettes","year":"2018","unstructured":"Combettes, P., Eckstein, J.: Asynchronous block-iterative primal\u2013dual decomposition methods for monotone inclusions. Math. Program. 168, 645\u2013672 (2018)","journal-title":"Math. Program."},{"key":"747_CR26","doi-asserted-by":"publisher","first-page":"2356","DOI":"10.1137\/17M112806X","volume":"27","author":"P Combettes","year":"2017","unstructured":"Combettes, P., Glaudin, L.: Quasi-nonexpansive iterations on the affine hull of orbits: from Mann\u2019s mean value algorithm to inertial methods. SIAM J. Optim. 27, 2356\u20132380 (2017)","journal-title":"SIAM J. Optim."},{"key":"747_CR27","doi-asserted-by":"publisher","unstructured":"Dong, Q.L., Huang, J.Z., Li, X.H., Cho, Y.J., Rassias, T.M.: MiKM: multi-step inertial Krasnoselski\u2013Mann algorithm and its applications. J. Global Optim. (2018). \n                    https:\/\/doi.org\/10.1007\/s10898-018-0727-x","DOI":"10.1007\/s10898-018-0727-x"},{"key":"747_CR28","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10957-017-1074-7","volume":"173","author":"J Eckstein","year":"2017","unstructured":"Eckstein, J.: A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers. J. Optim. Theory Appl. 173, 155\u2013182 (2017)","journal-title":"J. Optim. Theory Appl."},{"key":"747_CR29","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01396232","volume":"62","author":"L Elsner","year":"1992","unstructured":"Elsner, L., Koltracht, I., Neumann, M.: Convergence of sequential and asynchronous nonlinear paracontractions. Numer. Math. 62, 305\u2013319 (1992)","journal-title":"Numer. Math."},{"key":"747_CR30","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0377-0427(00)00409-X","volume":"123","author":"A Frommer","year":"2000","unstructured":"Frommer, A., Szyld, D.: On asynchronous iterations. J. Comput. Appl. Math. 123, 201\u2013216 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"747_CR31","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/MC.2005.160","volume":"38","author":"D Geer","year":"2005","unstructured":"Geer, D.: Chip makers turn to multicore processors. Computer 38, 11\u201313 (2005)","journal-title":"Computer"},{"key":"747_CR32","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1137\/040609458","volume":"27","author":"D Gordon","year":"2005","unstructured":"Gordon, D., Gordon, R.: Component-averaged row projections: a robust, block-parallel scheme for sparse linear systems. SIAM J. Sci. Comput. 27, 1092\u20131117 (2005)","journal-title":"SIAM J. Sci. Comput."},{"key":"747_CR33","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/0022-5193(70)90109-8","volume":"29","author":"R Gordon","year":"1970","unstructured":"Gordon, R., Bender, R., Herman, G.: Algebraic reconstruction techniques (art) for three-dimensional electron microscopy and x-ray photography. J. Theor. Biol. 29, 471\u2013481 (1970)","journal-title":"J. Theor. Biol."},{"key":"747_CR34","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10915-017-0628-z","volume":"76","author":"R Hannah","year":"2018","unstructured":"Hannah, R., Yin, W.: On unbounded delays in asynchronous parallel fixed-point algorithms. J. Sci. Comput. 76, 299\u2013326 (2018)","journal-title":"J. Sci. Comput."},{"key":"747_CR35","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1016\/j.cam.2011.09.039","volume":"236","author":"PC Hansen","year":"2012","unstructured":"Hansen, P.C., Saxild-Hansen, M.: AIR Tools-A MATLAB package of algebraic iterative reconstruction methods. J. Comput. Appl. Math. 236, 2167\u20132178 (2012)","journal-title":"J. Comput. Appl. Math."},{"key":"747_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01580425","volume":"8","author":"G Herman","year":"1975","unstructured":"Herman, G.: A relaxation method for reconstructing objects from noisy x-rays. Math. Program. 8, 1\u201319 (1975)","journal-title":"Math. Program."},{"key":"747_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-723-7","volume-title":"Fundamentals of Computerized Tomography","author":"GT Herman","year":"2009","unstructured":"Herman, G.T.: Fundamentals of Computerized Tomography, 2nd edn. Springer, London (2009)","edition":"2"},{"key":"747_CR38","unstructured":"Johnstone, P.R., Eckstein, J.: Convergence Rates for Projective Splitting. arXiv preprint \n                    arXiv:1806.03920\n                    \n                   (2018)"},{"key":"747_CR39","unstructured":"Johnstone, P.R., Eckstein, J.: Projective Splitting with Forward Steps: Asynchronous and Block-Iterative Operator Splitting. arXiv preprint \n                    arXiv:1803.07043\n                    \n                   (2018)"},{"key":"747_CR40","first-page":"355","volume":"A35","author":"S Kaczmarz","year":"1937","unstructured":"Kaczmarz, S.: Angen\u00e4herte Aufl\u00f6sung von Systemen linearer Gleichungen. Bull. Int. Acad. Pol. Sci. Lett. A35, 355\u2013357 (1937)","journal-title":"Bull. Int. Acad. Pol. Sci. Lett."},{"key":"747_CR41","volume-title":"Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings","author":"G Kazimierz","year":"1984","unstructured":"Kazimierz, G., Reich, S.: Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings. Marcel Dekker, New York (1984)"},{"key":"747_CR42","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0024-3795(93)00089-I","volume":"215","author":"K Kiwiel","year":"1995","unstructured":"Kiwiel, K.: Block-iterative surrogate projection methods for convex feasibility problems. Linear Algebra Appl. 215, 225\u2013259 (1995)","journal-title":"Linear Algebra Appl."},{"key":"747_CR43","first-page":"123","volume":"10","author":"M Krasnosel\u2019skii","year":"1955","unstructured":"Krasnosel\u2019skii, M.: Two remarks on the method of successive approximations. Uspekhi Mat. Nauk 10, 123\u2013127 (1955). (in Russian)","journal-title":"Uspekhi Mat. Nauk"},{"key":"747_CR44","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10851-014-0523-2","volume":"51","author":"D Lorenz","year":"2015","unstructured":"Lorenz, D., Pock, T.: An inertial forward-backward algorithm for monotone inclusions. J. Math. Imaging Vis. 51, 311\u2013325 (2015)","journal-title":"J. Math. Imaging Vis."},{"key":"747_CR45","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.cam.2007.07.021","volume":"219","author":"PE Maing\u00e9","year":"2008","unstructured":"Maing\u00e9, P.E.: Convergence theorems for inertial KM-type algorithms. J. Comput. Appl. Math. 219, 223\u2013236 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"747_CR46","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1090\/S0002-9939-1953-0054846-3","volume":"4","author":"W Mann","year":"1953","unstructured":"Mann, W.: Mean value methods in iteration. Proc. Am. Math. Soc. 4, 506\u2013510 (1953)","journal-title":"Proc. Am. Math. Soc."},{"key":"747_CR47","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0377-0427(02)00906-8","volume":"155","author":"A Moudafi","year":"2003","unstructured":"Moudafi, A., Oliny, M.: Convergence of a splitting inertial proximal method for monotone operators. J. Comput. Appl. Math. 155, 447\u2013454 (2003)","journal-title":"J. Comput. Appl. Math."},{"key":"747_CR48","doi-asserted-by":"publisher","first-page":"A2851","DOI":"10.1137\/15M1024950","volume":"38","author":"Z Peng","year":"2016","unstructured":"Peng, Z., Xu, Y., Yan, M., Yin, W.: ARock: an algorithmic framework for asynchronous parallel coordinate updates. SIAM J. Sci. Comput. 38, A2851\u2013A2879 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"747_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"B Polyak","year":"1964","unstructured":"Polyak, B.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4, 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"747_CR50","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-247X(79)90024-6","volume":"67","author":"S Reich","year":"1979","unstructured":"Reich, S.: Weak convergence theorems for nonexpansive mappings in Banach spaces. J. Math. Anal. Appl. 67, 274\u2013276 (1979)","journal-title":"J. Math. Anal. Appl."},{"key":"747_CR51","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/0022-247X(83)90168-3","volume":"91","author":"S Reich","year":"1983","unstructured":"Reich, S.: A note on the mean ergodic theorem for nonlinear semigroups. J. Math. Anal. Appl. 91, 547\u2013551 (1983)","journal-title":"J. Math. Anal. Appl."},{"key":"747_CR52","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11075-015-0045-z","volume":"72","author":"S Reich","year":"2016","unstructured":"Reich, S., Zalas, R.: A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space. Numer. Algorithms 72, 297\u2013323 (2016)","journal-title":"Numer. Algorithms"},{"key":"747_CR53","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TNS.1974.6499235","volume":"21","author":"L Shepp","year":"1974","unstructured":"Shepp, L., Logan, B.: The Fourier reconstruction of a head section. IEEE Trans. Nucl. Sci. 21, 21\u201343 (1974)","journal-title":"IEEE Trans. Nucl. Sci."},{"key":"747_CR54","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0024-3795(95)00698-2","volume":"253","author":"J Strikwerda","year":"1997","unstructured":"Strikwerda, J.: A convergence theorem for chaotic asynchronous relaxation. Linear Algebra Appl. 253, 15\u201324 (1997)","journal-title":"Linear Algebra Appl."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00747-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00747-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00747-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T19:10:01Z","timestamp":1581621001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00747-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,14]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["747"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00747-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,14]]},"assertion":[{"value":"5 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}