{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T14:13:00Z","timestamp":1774620780104,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,10,26]],"date-time":"2019-10-26T00:00:00Z","timestamp":1572048000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,26]],"date-time":"2019-10-26T00:00:00Z","timestamp":1572048000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"crossref","award":["302666\/2017-6"],"award-info":[{"award-number":["302666\/2017-6"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005285","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Goi\u00e1s","doi-asserted-by":"publisher","award":["PRONEM-201710267000532"],"award-info":[{"award-number":["PRONEM-201710267000532"]}],"id":[{"id":"10.13039\/501100005285","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005285","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Goi\u00e1s","doi-asserted-by":"publisher","award":["PRONEM-201710267000532"],"award-info":[{"award-number":["PRONEM-201710267000532"]}],"id":[{"id":"10.13039\/501100005285","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["424860\/2018-0"],"award-info":[{"award-number":["424860\/2018-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005285","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Goi\u00e1s","doi-asserted-by":"publisher","award":["PPP03\/15-201810267001725"],"award-info":[{"award-number":["PPP03\/15-201810267001725"]}],"id":[{"id":"10.13039\/501100005285","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["408123\/2018-4"],"award-info":[{"award-number":["408123\/2018-4"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10589-019-00146-1","type":"journal-article","created":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T17:14:26Z","timestamp":1572455666000},"page":"889-916","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":59,"title":["On the extension of the Hager\u2013Zhang conjugate gradient method for vector optimization"],"prefix":"10.1007","volume":"76","author":[{"given":"M. L. N.","family":"Gon\u00e7alves","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1098-4317","authenticated-orcid":false,"given":"L. F.","family":"Prudente","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,26]]},"reference":[{"issue":"11","key":"146_CR1","doi-asserted-by":"crossref","first-page":"2289","DOI":"10.1080\/02331934.2014.947500","volume":"64","author":"MA Ansary","year":"2015","unstructured":"Ansary, M.A., Panda, G.: A modified quasi-Newton method for vector optimization problem. Optimization 64(11), 2289\u20132306 (2015)","journal-title":"Optimization"},{"issue":"4","key":"146_CR2","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."},{"key":"146_CR3","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, New York (2014)"},{"issue":"4","key":"146_CR4","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1137\/S1052623403429093","volume":"15","author":"H Bonnel","year":"2005","unstructured":"Bonnel, H., Iusem, A.N., Svaiter, B.F.: Proximal methods in vector optimization. SIAM J. Optim. 15(4), 953\u2013970 (2005)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"146_CR5","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10957-010-9667-4","volume":"146","author":"LC Ceng","year":"2010","unstructured":"Ceng, L.C., Mordukhovich, B.S., Yao, J.C.: Hybrid approximate proximal method with auxiliary variational inequality for vector optimization. J. Optim. Theory Appl. 146(2), 267\u2013303 (2010)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"146_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2006.09.070","volume":"183","author":"LC Ceng","year":"2007","unstructured":"Ceng, L.C., Yao, J.C.: Approximate proximal methods in vector optimization. Eur. J. Oper. Res. 183(1), 1\u201319 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"146_CR7","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1080\/01630563.2011.587072","volume":"32","author":"TD Chuong","year":"2011","unstructured":"Chuong, T.D.: Generalized proximal method for efficient solutions in vector optimization. Numer. Funct. Anal. Optim. 32(8), 843\u2013857 (2011)","journal-title":"Numer. Funct. Anal. Optim."},{"issue":"3","key":"146_CR8","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s10589-012-9495-6","volume":"54","author":"TD Chuong","year":"2013","unstructured":"Chuong, T.D.: Newton-like methods for efficient solutions in vector optimization. Comput. Optim. Appl. 54(3), 495\u2013516 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"146_CR9","first-page":"257","volume":"12","author":"TD Chuong","year":"2011","unstructured":"Chuong, T.D., Mordukhovich, B.S., Yao, J.C.: Hybrid approximate proximal algorithms for efficient solutions in vector optimization. J. Nonlinear Convex Anal. 12(2), 257\u2013285 (2011)","journal-title":"J. Nonlinear Convex Anal."},{"issue":"10","key":"146_CR10","doi-asserted-by":"crossref","first-page":"1811","DOI":"10.1080\/00036811.2011.640629","volume":"91","author":"TD Chuong","year":"2012","unstructured":"Chuong, T.D., Yao, J.C.: Steepest descent methods for critical points in vector optimization problems. Appl. Anal. 91(10), 1811\u20131829 (2012)","journal-title":"Appl. Anal."},{"issue":"1","key":"146_CR11","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/100813026","volume":"23","author":"Y Dai","year":"2013","unstructured":"Dai, Y., Kou, C.: A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search. SIAM J. Optim. 23(1), 296\u2013320 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"146_CR12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"YH Dai","year":"1999","unstructured":"Dai, Y.H., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10(1), 177\u2013182 (1999)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"146_CR13","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das, I., Dennis, J.: Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J. Optim. 8(3), 631\u2013657 (1998)","journal-title":"SIAM J. Optim."},{"key":"146_CR14","volume-title":"Practical Methods of Optimization, Unconstrained Optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization, Unconstrained Optimization, vol. 1. John Wiley & Sons, New York (1987)"},{"issue":"2","key":"146_CR15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1964","unstructured":"Fletcher, R., Reeves, C.M.: Function minimization by conjugate gradients. Comput. J. 7(2), 149\u2013154 (1964)","journal-title":"Comput. J."},{"issue":"2","key":"146_CR16","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":"3","key":"146_CR17","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":"8\u20139","key":"146_CR18","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":"3","key":"146_CR19","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":"1","key":"146_CR20","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"JC Gilbert","year":"1992","unstructured":"Gilbert, J.C., Nocedal, J.: Global convergence properties of conjugate gradient methods for optimization. SIAM J. Optim. 2(1), 21\u201342 (1992)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"146_CR21","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":"5","key":"146_CR22","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1080\/02331934.2012.693082","volume":"63","author":"LM Gra\u00f1a\u00a0Drummond","year":"2014","unstructured":"Gra\u00f1a\u00a0Drummond, L.M., Raupp, F.M.P., Svaiter, B.F.: A quadratically convergent Newton method for vector optimization. Optimization 63(5), 661\u2013677 (2014)","journal-title":"Optimization"},{"issue":"2","key":"146_CR23","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":"3","key":"146_CR24","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF02614362","volume":"78","author":"L Grippo","year":"1997","unstructured":"Grippo, L., Lucidi, S.: A globally convergent version of the Polak\u2013Ribi\u00e8re conjugate gradient method. Math. Program. 78(3), 375\u2013391 (1997)","journal-title":"Math. Program."},{"issue":"1","key":"146_CR25","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager, W.W., Zhang, H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16(1), 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"146_CR26","first-page":"35","volume":"2","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2(1), 35\u201358 (2006)","journal-title":"Pac. J. Optim."},{"key":"146_CR27","volume-title":"Methods of Conjugate Gradients for Solving Linear Systems","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of Conjugate Gradients for Solving Linear Systems, vol. 49. Journal of Research of the National Bureau of Standards, Washington, DC (1952)"},{"issue":"3","key":"146_CR28","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1023\/A:1017536311488","volume":"110","author":"C Hillermeier","year":"2001","unstructured":"Hillermeier, C.: Generalized homotopy approach to multiobjective optimization. J. Optim. Theory Appl. 110(3), 557\u2013583 (2001)","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"146_CR29","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","volume":"10","author":"S Huband","year":"2006","unstructured":"Huband, S., Hingston, P., Barone, L., While, L.: A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans. Evol. Comput. 10(5), 477\u2013506 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"146_CR30","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00158-004-0465-1","volume":"29","author":"I Kim","year":"2005","unstructured":"Kim, I., de Weck, O.: Adaptive weighted-sum method for bi-objective optimization: Pareto front generation. Struct. Multidiscip. Optim. 29(2), 149\u2013158 (2005)","journal-title":"Struct. Multidiscip. Optim."},{"issue":"1","key":"146_CR31","first-page":"503","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45(1), 503\u2013528 (1989)","journal-title":"Math. Program."},{"issue":"8","key":"146_CR32","doi-asserted-by":"crossref","first-page":"1567","DOI":"10.1080\/00036811.2013.839781","volume":"93","author":"F Lu","year":"2014","unstructured":"Lu, F., Chen, C.R.: Newton-like methods for solving vector optimization problems. Appl. Anal. 93(8), 1567\u20131586 (2014)","journal-title":"Appl. Anal."},{"key":"146_CR33","doi-asserted-by":"crossref","unstructured":"Luc, D.T.: Theory of Vector Optimization, Lectures Notes in Economics and Mathematical Systems, vol. 319. Springer, Berlin (1989)","DOI":"10.1007\/978-3-642-50280-4"},{"issue":"3","key":"146_CR34","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":"146_CR35","doi-asserted-by":"publisher","DOI":"10.1145\/3342104","author":"LR 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. Soft. (2019). https:\/\/doi.org\/10.1145\/3342104","journal-title":"ACM Trans. Math. Soft."},{"issue":"3","key":"146_CR36","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/j.ejor.2007.05.015","volume":"188","author":"E Miglierina","year":"2008","unstructured":"Miglierina, E., Molho, E., Recchioni, M.: Box-constrained multi-objective optimization: a gradient-like method without a priori scalarization. Eur. J. Oper. Res. 188(3), 662\u2013682 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"146_CR37","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10898-019-00802-0","volume":"75","author":"K Mita","year":"2019","unstructured":"Mita, K., Fukuda, E.H., Yamashita, N.: Nonmonotone line searches for unconstrained multiobjective optimization problems. J. Glob. Optim. 75(1), 63\u201390 (2019)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"146_CR38","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7(1), 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"146_CR39","doi-asserted-by":"crossref","first-page":"167","DOI":"10.55937\/sut\/1424782608","volume":"50","author":"Y Narushima","year":"2014","unstructured":"Narushima, Y., Yabe, H.: A survey of sufficient descent conjugate gradient methods for unconstrained optimization. SUT J. Math. 50(2), 167\u2013203 (2014)","journal-title":"SUT J. Math."},{"issue":"1","key":"146_CR40","first-page":"35","volume":"3","author":"E Polak","year":"1969","unstructured":"Polak, E., Ribi\u00e8re, G.: Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. Revue fran\u00e7aise d\u2019informatique et de recherche op\u00e9rationnelle, s\u00e9rie rouge 3(1), 35\u201343 (1969)","journal-title":"Revue fran\u00e7aise d\u2019informatique et de recherche op\u00e9rationnelle, s\u00e9rie rouge"},{"issue":"4","key":"146_CR41","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B.T.: The conjugate gradient method in extremal problems. USSR Comput. Math. Math. Phys. 9(4), 94\u2013112 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"146_CR42","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/11844297_52","volume-title":"Parallel Problem Solving from Nature\u2014PPSN IX","author":"M Preuss","year":"2006","unstructured":"Preuss, M., Naujoks, B., Rudolph, G.: Pareto set and EMOA behavior for simple multimodal multiobjective functions. In: Runarsson, T.P., Beyer, H.G., Burke, E., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) Parallel Problem Solving from Nature\u2014PPSN IX, pp. 513\u2013522. Springer, Berlin (2006)"},{"issue":"5","key":"146_CR43","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.orl.2011.07.008","volume":"39","author":"S Qu","year":"2011","unstructured":"Qu, S., Goh, M., Chan, F.T.: Quasi-Newton methods for solving multiobjective optimization. Oper. Res. Lett. 39(5), 397\u2013399 (2011)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"146_CR44","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s10898-007-9265-7","volume":"41","author":"O Sch\u00fctze","year":"2008","unstructured":"Sch\u00fctze, O., Laumanns, M., Coello Coello, C.A., Dellnitz, M., Talbi, E.G.: Convergence of stochastic search algorithms to finite size Pareto set approximations. J. Glob. Optim. 41(4), 559\u2013577 (2008)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"146_CR45","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1016\/j.ejor.2006.09.066","volume":"182","author":"ZJ Shi","year":"2007","unstructured":"Shi, Z.J., Shen, J.: Convergence of Liu\u2013Storey conjugate gradient method. Eur. J. Oper. Res. 182(2), 552\u2013560 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"146_CR46","unstructured":"Toint, P.L.: Test problems for partially separable optimization and results for the routine PSPMIN. Technical Report, The University of Namur, Department of Mathematics, Belgium (1983)"},{"issue":"3","key":"146_CR47","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.ejor.2011.05.006","volume":"214","author":"KD Villacorta","year":"2011","unstructured":"Villacorta, K.D., Oliveira, P.R.: An interior proximal method in vector optimization. Eur. J. Oper. Res. 214(3), 485\u2013492 (2011)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00146-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00146-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00146-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T00:28:58Z","timestamp":1664756938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00146-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,26]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["146"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00146-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,26]]},"assertion":[{"value":"15 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}