{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:52:15Z","timestamp":1761897135081,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"CNPQ","award":["302473\/2017-3","408151\/2016-1"],"award-info":[{"award-number":["302473\/2017-3","408151\/2016-1"]}]},{"name":"FAPEG-PRONEM","award":["201710267000532"],"award-info":[{"award-number":["201710267000532"]}]},{"name":"CNPQ","award":["406975\/2016-7"],"award-info":[{"award-number":["406975\/2016-7"]}]},{"name":"FAPEQ-PRONEM","award":["201710267000532"],"award-info":[{"award-number":["201710267000532"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s10957-019-01615-7","type":"journal-article","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T07:02:35Z","timestamp":1575874955000},"page":"507-533","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Iteration-Complexity and Asymptotic Analysis of Steepest Descent Method for Multiobjective Optimization on Riemannian Manifolds"],"prefix":"10.1007","volume":"184","author":[{"given":"Orizon P.","family":"Ferreira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4755-3505","authenticated-orcid":false,"given":"Mauricio S.","family":"Louzeiro","sequence":"additional","affiliation":[]},{"given":"Leandro F.","family":"Prudente","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,9]]},"reference":[{"issue":"3","key":"1615_CR1","doi-asserted-by":"crossref","first-page":"2690","DOI":"10.1137\/17M1126588","volume":"28","author":"LR Lucambio P\u00e9rez","year":"2018","unstructured":"Lucambio P\u00e9rez, L.R., Prudente, L.F.: Nonlinear conjugate gradient methods for vector optimization. SIAM J. Optim. 28(3), 2690\u20132720 (2018)","journal-title":"SIAM J. Optim."},{"key":"1615_CR2","doi-asserted-by":"publisher","unstructured":"Gon\u00e7alves, M.L.N., Prudente, L.F.: On the extension of the Hager\u2013Zhang conjugate gradient method for vector optimization. Comput. Optim. Appl. (forthcoming 2019). https:\/\/doi.org\/10.1007\/s10589-019-00146-1","DOI":"10.1007\/s10589-019-00146-1"},{"issue":"2","key":"1615_CR3","doi-asserted-by":"crossref","first-page":"1104","DOI":"10.1137\/16M107534X","volume":"28","author":"GC Bento","year":"2018","unstructured":"Bento, G.C., Cruz\u00a0Neto, J.X., L\u00f3pez, G., Soubeyran, A., Souza, J.C.O.: The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem. SIAM J. Optim. 28(2), 1104\u20131120 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1615_CR4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/02331934.2017.1387259","volume":"67","author":"O Montonen","year":"2018","unstructured":"Montonen, O., Karmitsa, N., M\u00e4kel\u00e4, M.M.: Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization. Optimization 67(1), 139\u2013158 (2018)","journal-title":"Optimization"},{"issue":"1\u20132, Ser. A","key":"1615_CR5","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10107-015-0962-6","volume":"159","author":"GA Carrizo","year":"2016","unstructured":"Carrizo, G.A., Lotito, P.A., Maciel, M.C.: Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem. Math. Program. 159(1\u20132, Ser. A), 339\u2013369 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"1615_CR6","doi-asserted-by":"crossref","first-page":"2091","DOI":"10.1137\/15M1016424","volume":"26","author":"J Fliege","year":"2016","unstructured":"Fliege, J., Vaz, A.I.F.: A method for constrained multiobjective optimization based on SQP techniques. SIAM J. Optim. 26(4), 2091\u20132119 (2016)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1615_CR7","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s11075-015-0058-7","volume":"72","author":"V Morovati","year":"2016","unstructured":"Morovati, V., Pourkarimi, L., Basirzadeh, H.: Barzilai and Borwein\u2019s method for multiobjective optimization problems. Numer. Algorithms 72(3), 539\u2013604 (2016)","journal-title":"Numer. Algorithms"},{"issue":"3","key":"1615_CR8","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s001860000043","volume":"51","author":"J Fliege","year":"2000","unstructured":"Fliege, J., Svaiter, B.F.: Steepest descent methods for multicriteria optimization. Math. Methods Oper. Res. 51(3), 479\u2013494 (2000)","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"1615_CR9","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10589-012-9501-z","volume":"54","author":"EH Fukuda","year":"2013","unstructured":"Fukuda, E.H., Gra\u00f1a Drummond, L.M.: Inexact projected gradient method for vector optimization. Comput. Optim. Appl. 54(3), 473\u2013493 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"8\u20139","key":"1615_CR10","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1080\/02331934.2010.522710","volume":"60","author":"EH Fukuda","year":"2011","unstructured":"Fukuda, E.H., Gra\u00f1a Drummond, L.M.: On the convergence of the projected gradient method for vector optimization. Optimization 60(8\u20139), 1009\u20131021 (2011)","journal-title":"Optimization"},{"issue":"2","key":"1615_CR11","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.cam.2004.06.018","volume":"175","author":"LM Gra\u00f1a Drummond","year":"2005","unstructured":"Gra\u00f1a Drummond, L.M., Svaiter, B.F.: A steepest descent method for vector optimization. J. Comput. Appl. Math. 175(2), 395\u2013414 (2005)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"1615_CR12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/B:COAP.0000018877.86161.8b","volume":"28","author":"LM Gra\u00f1a Drummond","year":"2004","unstructured":"Gra\u00f1a Drummond, L.M., Iusem, A.N.: A projected gradient method for vector optimization problems. Comput. Optim. Appl. 28(1), 5\u201329 (2004)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1615_CR13","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10957-013-0308-6","volume":"162","author":"JY Bello Cruz","year":"2014","unstructured":"Bello Cruz, J.Y., Bouza Allende, G.: A steepest descent-like method for variable order vector optimization problems. J. Optim. Theory Appl. 162(2), 371\u2013391 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"1615_CR14","doi-asserted-by":"crossref","first-page":"2169","DOI":"10.1137\/120866415","volume":"23","author":"JY Bello Cruz","year":"2013","unstructured":"Bello Cruz, J.Y.: A subgradient method for vector optimization problems. SIAM J. Optim. 23(4), 2169\u20132182 (2013)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"1615_CR15","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1080\/10556788.2018.1510928","volume":"34","author":"J Fliege","year":"2019","unstructured":"Fliege, J., Vaz, A.I.F., Vicente, L.N.: Complexity of gradient descent for multiobjective optimization. Optim. Methods Softw. 34(5), 949\u2013959 (2019)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"1615_CR16","doi-asserted-by":"crossref","first-page":"2517","DOI":"10.1137\/18M1180633","volume":"29","author":"OP Ferreira","year":"2019","unstructured":"Ferreira, O.P., Louzeiro, M.S., Prudente, L.F.: Gradient method for optimization on Riemannian manifolds with lower bounded curvature. SIAM J. Optim. 29(4), 2517\u20132541 (2019)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1615_CR17","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1007\/s10957-017-1093-4","volume":"173","author":"GC Bento","year":"2017","unstructured":"Bento, G.C., Ferreira, O.P., Melo, J.G.: Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds. J. Optim. Theory Appl. 173(2), 548\u2013562 (2017)","journal-title":"J. Optim. Theory Appl."},{"key":"1615_CR18","first-page":"379","volume":"39","author":"B Jeuris","year":"2012","unstructured":"Jeuris, B., Vandebril, R., Vandereycken, B.: A survey and comparison of contemporary algorithms for computing the matrix geometric mean. Electron. Trans. Numer. Anal. 39, 379\u2013402 (2012)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"1615_CR19","series-title":"Nonconvex Optimization and Its Applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6357-0","volume-title":"Smooth Nonlinear Optimization in $$R^n$$","author":"T Rapcs\u00e1k","year":"1997","unstructured":"Rapcs\u00e1k, T.: Smooth Nonlinear Optimization in $$R^n$$. Nonconvex Optimization and Its Applications, vol. 19. Kluwer Academic Publishers, Dordrecht (1997)"},{"issue":"1","key":"1615_CR20","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/140978168","volume":"25","author":"S Sra","year":"2015","unstructured":"Sra, S., Hosseini, R.: Conic geometric optimization on the manifold of positive definite matrices. SIAM J. Optim. 25(1), 713\u2013739 (2015)","journal-title":"SIAM J. Optim."},{"key":"1615_CR21","first-page":"4592","volume":"29","author":"H Zhang","year":"2016","unstructured":"Zhang, H., Reddi, S.J., Sra, S.: Riemannian SVRG: fast stochastic optimization on Riemannian manifolds. Adv. Neural Inf. Process. Syst. 29, 4592\u20134600 (2016)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"2","key":"1615_CR22","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0895479895290954","volume":"20","author":"A Edelman","year":"1999","unstructured":"Edelman, A., Arias, T.A., Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20(2), 303\u2013353 (1999)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1615_CR23","series-title":"Fields Institute Communications","first-page":"113","volume-title":"Hamiltonian and Gradient Flows, Algorithms and Control","author":"ST Smith","year":"1994","unstructured":"Smith, S.T.: Optimization techniques on Riemannian manifolds. Hamiltonian and Gradient Flows, Algorithms and Control. Fields Institute Communications, vol. 3, pp. 113\u2013136. American Mathematical Society, Providence (1994)"},{"key":"1615_CR24","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1287\/mnsc.18.11.620","volume":"18","author":"DG Luenberger","year":"1972","unstructured":"Luenberger, D.G.: The gradient projection method along geodesics. Manag. Sci. 18, 620\u2013631 (1972)","journal-title":"Manag. Sci."},{"key":"1615_CR25","series-title":"Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-8390-9","volume-title":"Convex Functions and Optimization Methods on Riemannian Manifolds","author":"C Udri\u015fte","year":"1994","unstructured":"Udri\u015fte, C.: Convex Functions and Optimization Methods on Riemannian Manifolds. Mathematics and its Applications, vol. 297. Kluwer Academic Publishers Group, Dordrecht (1994)"},{"key":"1615_CR26","doi-asserted-by":"crossref","DOI":"10.1515\/9781400830244","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"PA Absil","year":"2008","unstructured":"Absil, P.A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2008)"},{"issue":"4","key":"1615_CR27","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s102080010032","volume":"2","author":"YE Nesterov","year":"2002","unstructured":"Nesterov, Y.E., Todd, M.J.: On the Riemannian geometry defined by self-concordant barriers and interior-point methods. Found. Comput. Math. 2(4), 333\u2013361 (2002)","journal-title":"Found. Comput. Math."},{"issue":"4","key":"1615_CR28","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1137\/09075367X","volume":"21","author":"C Li","year":"2011","unstructured":"Li, C., Mordukhovich, B.S., Wang, J., Yao, J.C.: Weak sharp minima on Riemannian manifolds. SIAM J. Optim. 21(4), 1523\u20131560 (2011)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1615_CR29","doi-asserted-by":"crossref","first-page":"2486","DOI":"10.1137\/110834962","volume":"50","author":"C Li","year":"2012","unstructured":"Li, C., Yao, J.C.: Variational inequalities for set-valued vector fields on Riemannian manifolds: convexity of the solution set and the proximal point algorithm. SIAM J. Control Optim. 50(4), 2486\u20132514 (2012)","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"1615_CR30","doi-asserted-by":"crossref","first-page":"2334","DOI":"10.1137\/14099961X","volume":"25","author":"X Wang","year":"2015","unstructured":"Wang, X., Li, C., Wang, J., Yao, J.C.: Linear convergence of subgradient algorithm for convex feasibility on Riemannian manifolds. SIAM J. Optim. 25(4), 2334\u20132358 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1615_CR31","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/s10957-014-0568-9","volume":"164","author":"XM Wang","year":"2015","unstructured":"Wang, X.M., Li, C., Yao, J.C.: Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures. J. Optim. Theory Appl. 164(1), 202\u2013217 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1615_CR32","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00211-014-0630-4","volume":"129","author":"JH Manton","year":"2015","unstructured":"Manton, J.H.: A framework for generalising the Newton method and other iterative methods from Euclidean space to manifolds. Numer. Math. 129(1), 91\u2013125 (2015)","journal-title":"Numer. Math."},{"issue":"1","key":"1615_CR33","first-page":"1","volume":"49","author":"H Zhang","year":"2016","unstructured":"Zhang, H., Sra, S.: First-order methods for geodesically convex optimization. JMLR Workshop Conf. Proc. 49(1), 1\u201321 (2016)","journal-title":"JMLR Workshop Conf. Proc."},{"issue":"4","key":"1615_CR34","doi-asserted-by":"crossref","first-page":"2696","DOI":"10.1137\/15M1051257","volume":"26","author":"J Wang","year":"2016","unstructured":"Wang, J., Li, C., Lopez, G., Yao, J.C.: Proximal point algorithms on Hadamard manifolds: linear convergence and finite termination. SIAM J. Optim. 26(4), 2696\u20132729 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1615_CR35","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/s10957-011-9984-2","volume":"154","author":"GC Bento","year":"2012","unstructured":"Bento, G.C., Ferreira, O.P., Oliveira, P.R.: Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds. J. Optim. Theory Appl. 154(1), 88\u2013107 (2012)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1615_CR36","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/s10957-013-0305-9","volume":"159","author":"GC Bento","year":"2013","unstructured":"Bento, G.C., da Cruz Neto, J.X., Santos, P.S.M.: An inexact steepest descent method for multicriteria optimization on Riemannian manifolds. J. Optim. Theory Appl. 159(1), 108\u2013124 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"1615_CR37","series-title":"Mathematics Theory & Applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2201-7","volume-title":"Riemannian Geometry","author":"MP do Carmo","year":"1992","unstructured":"do Carmo, M.P.: Riemannian Geometry. Mathematics Theory & Applications. Birkh\u00e4user Boston, Inc., Boston (1992)"},{"key":"1615_CR38","series-title":"Translations of Mathematical Monographs","doi-asserted-by":"crossref","DOI":"10.1090\/mmono\/149","volume-title":"Riemannian Geometry","author":"T Sakai","year":"1996","unstructured":"Sakai, T.: Riemannian Geometry. Translations of Mathematical Monographs, vol. 149. American Mathematical Society, Providence (1996)"},{"issue":"2","key":"1615_CR39","first-page":"89","volume":"3","author":"J da Cruz Neto","year":"1998","unstructured":"da Cruz Neto, J., De Lima, L., Oliveira, P.: Geodesic algorithms in Riemannian geometry. Balk. J. Geom. Appl. 3(2), 89\u2013100 (1998)","journal-title":"Balk. J. Geom. Appl."},{"issue":"2","key":"1615_CR40","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1080\/02331939508844042","volume":"32","author":"R Burachik","year":"1995","unstructured":"Burachik, R., Drummond, L.M.G., Iusem, A.N., Svaiter, B.F.: Full convergence of the steepest descent method with inexact line searches. Optimization 32(2), 137\u2013146 (1995)","journal-title":"Optimization"},{"issue":"1","key":"1615_CR41","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"1615_CR42","doi-asserted-by":"publisher","unstructured":"Batista, E., Bento, G., Ferreira, O.: An extragradient-type algorithm for variational inequality on Hadamard manifolds. ESAIM Control Optim. Calc. Var. (forthcoming 2019). https:\/\/doi.org\/10.1051\/cocv\/2019040","DOI":"10.1051\/cocv\/2019040"},{"key":"1615_CR43","series-title":"Graduate Texts in Mathematics","volume-title":"Fundamentals of Differential Geometry","author":"S Lang","year":"1999","unstructured":"Lang, S.: Fundamentals of Differential Geometry. Graduate Texts in Mathematics, vol. 191. Springer, New York (1999)"},{"key":"1615_CR44","first-page":"2945","volume":"14","author":"B Lin","year":"2013","unstructured":"Lin, B., He, X., Zhang, C., Ji, M.: Parallel vector field embedding. J. Mach. Learn. Res. 14, 2945\u20132977 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"1615_CR45","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-26654-1","volume-title":"Riemannian Geometry","author":"P Petersen","year":"2016","unstructured":"Petersen, P.: Riemannian Geometry. Graduate Texts in Mathematics, vol. 171, 3rd edn. Springer, Cham (2016)","edition":"3"},{"issue":"4","key":"1615_CR46","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/3342104","volume":"45","author":"L. R. Lucambio P\u00e9rez","year":"2019","unstructured":"Lucambio P\u00e9rez, L.R., Prudente, L.F.: A Wolfe line search algorithm for vector optimization. ACM Trans. Math. Softw. (forthcoming 2019). https:\/\/doi.org\/10.1145\/3342104","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"key":"1615_CR47","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973365","volume-title":"Practical Augmented Lagrangian Methods for Constrained Optimization","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Practical Augmented Lagrangian Methods for Constrained Optimization. SIAM, Philadelphia (2014)"},{"issue":"2","key":"1615_CR48","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1137\/08071692X","volume":"20","author":"J Fliege","year":"2009","unstructured":"Fliege, J., Gra\u00f1a Drummond, L.M., Svaiter, B.F.: Newton\u2019s method for multiobjective optimization. SIAM J. Optim. 20(2), 602\u2013626 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1615_CR49","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/285861.285868","volume":"24","author":"RB Sidje","year":"1998","unstructured":"Sidje, R.B.: Expokit: a software package for computing matrix exponentials. ACM Trans. Math. Softw. 24(1), 130\u2013156 (1998)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"1615_CR50","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1145\/355921.355933","volume":"6","author":"DF Shanno","year":"1980","unstructured":"Shanno, D.F., Phua, K.H.: Remark on algorithm 500: minimization of unconstrained multivariate functions. ACM Trans. Math. Softw. 6(4), 618\u2013622 (1980)","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01615-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-019-01615-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01615-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T00:38:26Z","timestamp":1607387906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-019-01615-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,9]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["1615"],"URL":"https:\/\/doi.org\/10.1007\/s10957-019-01615-7","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2019,12,9]]},"assertion":[{"value":"7 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}