iBet uBet web content aggregator. Adding the entire web to your favor.

Link to original content: https://api.crossref.org/works/10.1007/S10589-020-00194-Y

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:10:55Z","timestamp":1725520255109},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T00:00:00Z","timestamp":1589500800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T00:00:00Z","timestamp":1589500800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Research Grants Council of the Hong Kong Special Administrative Region","award":["UGC\/FDS14\/P02\/17"]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"crossref","award":["2019A1515011917"],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11871347"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of Shenzhen","award":["JCYJ20190808173603590","JCYJ20170817100950436","JCYJ20170818091621856"]},{"name":"Interdisciplinary Innovation Team of Shenzhen University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10589-020-00194-y","type":"journal-article","created":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T07:04:50Z","timestamp":1589526290000},"page":"183-212","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Convergence rates of subgradient methods for quasi-convex optimization problems"],"prefix":"10.1007","volume":"77","author":[{"given":"Yaohua","family":"Hu","sequence":"first","affiliation":[]},{"given":"Jiawen","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0787-5382","authenticated-orcid":false,"given":"Carisa Kwok Wai","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,15]]},"reference":[{"key":"194_CR1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10898-015-0367-3","volume":"64","author":"HCF Apolinario","year":"2016","unstructured":"Apolinario, H.C.F., Papa Quiroz, E.A., Oliveira, P.R.: A scalarization proximal point method for quasiconvex multiobjective minimization. J. Glob. Optim. 64, 79\u201396 (2016)","journal-title":"J. Glob. Optim."},{"key":"194_CR2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10107-007-0147-z","volume":"120","author":"A Auslender","year":"2009","unstructured":"Auslender, A., Teboulle, M.: Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities. Math. Program. 120, 27\u201348 (2009)","journal-title":"Math. Program."},{"key":"194_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1023\/A:1008728926224","volume":"8","author":"D Aussel","year":"2000","unstructured":"Aussel, D., Daniilidis, A.: Normal characterization of the main classes of quasiconvex functions. Set-Valued Anal. 8, 219\u2013236 (2000)","journal-title":"Set-Valued Anal."},{"key":"194_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-7600-2","volume-title":"Generalized Concavity","author":"M Avriel","year":"1988","unstructured":"Avriel, M., Diewert, W.E., Schaible, S., Zang, I.: Generalized Concavity. Plenum Press, New York (1988)"},{"key":"194_CR5","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/s10589-019-00111-y","volume":"74","author":"J Bao","year":"2019","unstructured":"Bao, J., Yu, C.K.W., Wang, J., Hu, Y., Yao, J.C.: Modified inexact Levenberg\u2013Marquardt methods for solving nonlinear least squares problems. Comput. Optim. Appl. 74, 547\u2013582 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"194_CR6","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Cambridge (1999)"},{"key":"194_CR7","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10107-016-1091-6","volume":"165","author":"J Bolte","year":"2017","unstructured":"Bolte, J., Nguyen, T.P., Peypouquet, J., Suter, B.W.: From error bounds to the complexity of first-order descent methods for convex functions. Math. Program. 165, 471\u2013507 (2017)","journal-title":"Math. Program."},{"key":"194_CR8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01585999","volume":"71","author":"U Br\u00e4nnlund","year":"1995","unstructured":"Br\u00e4nnlund, U.: A generalized subgradient method with relaxation step. Math. Program. 71, 207\u2013219 (1995)","journal-title":"Math. Program."},{"key":"194_CR9","first-page":"439","volume":"31","author":"JV Burke","year":"2002","unstructured":"Burke, J.V., Deng, S.: Weak sharp minima revisited, part I: basic theory. Control Cybern. 31, 439\u2013469 (2002)","journal-title":"Control Cybern."},{"key":"194_CR10","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.1137\/0331063","volume":"31","author":"JV Burke","year":"1993","unstructured":"Burke, J.V., Ferris, M.C.: Weak sharp minima in mathematical programming. SIAM J. Control Optim. 31, 1340\u20131359 (1993)","journal-title":"SIAM J. Control Optim."},{"key":"194_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-3341-8","volume-title":"Generalized Convexity, Generalized Monotonicity","author":"JP Crouzeix","year":"1998","unstructured":"Crouzeix, J.P., Martinez-Legaz, J.E., Volle, M.: Generalized Convexity, Generalized Monotonicity. Kluwer, Dordrecht (1998)"},{"key":"194_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01071403","volume":"2","author":"YM Ermoliev","year":"1966","unstructured":"Ermoliev, Y.M.: Methods of solution of nonlinear extremal problems. Cybern. Syst. Anal. 2, 1\u201314 (1966)","journal-title":"Cybern. Syst. Anal."},{"key":"194_CR13","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01594944","volume":"50","author":"MC Ferris","year":"1991","unstructured":"Ferris, M.C.: Finite termination of the proximal point algorithm. Math. Program. 50, 359\u2013366 (1991)","journal-title":"Math. Program."},{"key":"194_CR14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Logist. Q. 3, 95\u2013110 (1956)","journal-title":"Nav. Res. Logist. Q."},{"key":"194_CR15","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s10107-017-1164-1","volume":"170","author":"RM Freund","year":"2018","unstructured":"Freund, R.M., Lu, H.: New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure. Math. Program. 170, 445\u2013477 (2018)","journal-title":"Math. Program."},{"key":"194_CR16","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01584346","volume":"13","author":"JL Goffin","year":"1977","unstructured":"Goffin, J.L.: On convergence rates of subgradient optimization methods. Math. Program. 13, 329\u2013347 (1977)","journal-title":"Math. Program."},{"key":"194_CR17","first-page":"437","volume":"15","author":"HJ Greenberg","year":"1973","unstructured":"Greenberg, H.J., Pierskalla, W.P.: Quasiconjugate functions and surrogate duality. Cahiers Centre \u00c9tudes Recherche Opertionnelle 15, 437\u2013448 (1973)","journal-title":"Cahiers Centre \u00c9tudes Recherche Opertionnelle"},{"key":"194_CR18","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/15M1049695","volume":"27","author":"M G\u00fcrb\u00fczbalaban","year":"2017","unstructured":"G\u00fcrb\u00fczbalaban, M., Ozdaglar, A., Ribeiro, P.A.: On the convergence rate of incremental aggregated gradient algorithms. SIAM J. Optim. 27, 1035\u20131048 (2017)","journal-title":"SIAM J. Optim."},{"key":"194_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/b101428","volume-title":"Handbook of Generalized Convexity and Generalized Monotonicity","author":"N Hadjisavvas","year":"2005","unstructured":"Hadjisavvas, N., Koml\u00f3si, S., Schaible, S.: Handbook of Generalized Convexity and Generalized Monotonicity. Springer, New York (2005)"},{"key":"194_CR20","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1137\/140993090","volume":"26","author":"Y Hu","year":"2016","unstructured":"Hu, Y., Li, C., Yang, X.: On convergence rates of linearized proximal algorithms for convex composite optimization with applications. SIAM J. Optim. 26, 1207\u20131235 (2016)","journal-title":"SIAM J. Optim."},{"key":"194_CR21","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2014.05.017","volume":"240","author":"Y Hu","year":"2015","unstructured":"Hu, Y., Yang, X., Sim, C.K.: Inexact subgradient methods for quasi-convex optimization problems. Eur. J. Oper. Res. 240, 315\u2013327 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"194_CR22","first-page":"83","volume":"2","author":"Y Hu","year":"2017","unstructured":"Hu, Y., Yang, X., Yu, C.K.W.: Subgradient methods for saddle point problems of quasiconvex optimization. Pure Appl. Funct. Anal. 2, 83\u201397 (2017)","journal-title":"Pure Appl. Funct. Anal."},{"key":"194_CR23","first-page":"2143","volume":"17","author":"Y Hu","year":"2016","unstructured":"Hu, Y., Yu, C.K.W., Li, C., Yang, X.: Conditional subgradient methods for constrained quasi-convex optimization problems. J. Nonlinear Convex Anal. 17, 2143\u20132158 (2016)","journal-title":"J. Nonlinear Convex Anal."},{"key":"194_CR24","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1287\/moor.28.3.533.16395","volume":"28","author":"XX Huang","year":"2003","unstructured":"Huang, X.X., Yang, X.Q.: A unified augmented Lagrangian approach to duality and exact penalization. Math. Oper. Res. 28, 533\u2013552 (2003)","journal-title":"Math. Oper. Res."},{"key":"194_CR25","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10107-018-01361-0","volume":"180","author":"PR Johnstone","year":"2020","unstructured":"Johnstone, P.R., Moulin, P.: Faster subgradient methods for functions with H\u00f6lderian growth. Math. Program. 180, 417\u2013450 (2020)","journal-title":"Math. Program."},{"key":"194_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00011414","volume":"90","author":"KC Kiwiel","year":"2001","unstructured":"Kiwiel, K.C.: Convergence and efficiency of subgradient methods for quasiconvex minimization. Math. Program. 90, 1\u201325 (2001)","journal-title":"Math. Program."},{"key":"194_CR27","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/S1052623400376366","volume":"14","author":"KC Kiwiel","year":"2004","unstructured":"Kiwiel, K.C.: Convergence of approximate and incremental subgradient methods for convex optimization. SIAM J. Optim. 14, 807\u2013840 (2004)","journal-title":"SIAM J. Optim."},{"key":"194_CR28","doi-asserted-by":"crossref","first-page":"2760","DOI":"10.1007\/BF02110582","volume":"71","author":"IV Konnov","year":"1994","unstructured":"Konnov, I.V.: On properties of supporting and quasi-supporting vectors. J. Math. Sci. 71, 2760\u20132763 (1994)","journal-title":"J. Math. Sci."},{"key":"194_CR29","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1080\/1055678031000111236","volume":"18","author":"IV Konnov","year":"2003","unstructured":"Konnov, I.V.: On convergence properties of a subgradient method. Optim. Methods Softw. 18, 53\u201362 (2003)","journal-title":"Optim. Methods Softw."},{"key":"194_CR30","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/0377-2217(94)00200-2","volume":"88","author":"T Larsson","year":"1996","unstructured":"Larsson, T., Patriksson, M., Str\u00f6mberg, A.B.: Conditional subgradient optimization-theory and applications. Eur. J. Oper. Res. 88, 382\u2013403 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"194_CR31","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s10589-017-9933-6","volume":"68","author":"Z Lu","year":"2017","unstructured":"Lu, Z., Zhang, Y., Lu, J.: $$\\ell _p$$ Regularized low-rank approximation via iterative reweighted singular value minimization. Comput. Optim. Appl. 68, 619\u2013642 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"194_CR32","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1287\/moor.2015.0711","volume":"40","author":"M Mastrogiacomo","year":"2015","unstructured":"Mastrogiacomo, M., Gianin, E.R.: Portfolio optimization with quasiconvex risk measures. Math. Oper. Res. 40, 1042\u20131059 (2015)","journal-title":"Math. Oper. Res."},{"key":"194_CR33","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1137\/16M1101702","volume":"28","author":"A Mokhtari","year":"2018","unstructured":"Mokhtari, A., G\u00fcrb\u00fczbalaban, M., Ribeiro, A.: Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate. SIAM J. Optim. 28, 1420\u20131447 (2018)","journal-title":"SIAM J. Optim."},{"key":"194_CR34","doi-asserted-by":"crossref","unstructured":"Nedi\u0107, A., Bertsekas, D.P.: Convergence rate of incremental subgradient algorithms. In: Uryasev, S., Pardalos, P.M., (eds.) Stochastic Optimization: Algorithms and Applications, pp. 223\u2013264. Springer, Berlin (2001)","DOI":"10.1007\/978-1-4757-6594-6_11"},{"key":"194_CR35","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/S1052623499362111","volume":"12","author":"A Nedi\u0107","year":"2001","unstructured":"Nedi\u0107, A., Bertsekas, D.P.: Incremental subgradient methods for nondifferentiable optimization. SIAM J. Optim. 12, 109\u2013138 (2001)","journal-title":"SIAM J. Optim."},{"key":"194_CR36","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10957-009-9522-7","volume":"142","author":"A Nedi\u0107","year":"2009","unstructured":"Nedi\u0107, A., Ozdaglar, A.: Subgradient methods for saddle-point problems. J. Optim. Theory Appl. 142, 205\u2013228 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"194_CR37","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y Nesterov","year":"2009","unstructured":"Nesterov, Y.: Primal-dual subgradient methods for convex problems. Math. Program. 120, 221\u2013259 (2009)","journal-title":"Math. Program."},{"key":"194_CR38","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1016\/j.ejor.2017.09.043","volume":"270","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y., Shikhman, V.: Dual subgradient method with averaging for optimal resource allocation. Eur. J. Oper. Res. 270, 907\u2013916 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"194_CR39","doi-asserted-by":"crossref","first-page":"1547","DOI":"10.1137\/070711712","volume":"20","author":"ESH Neto","year":"2009","unstructured":"Neto, E.S.H., Pierro, A.R.D.: Incremental subgradients for constrained convex optimization: a unified framework and new methods. SIAM J. Optim. 20, 1547\u20131572 (2009)","journal-title":"SIAM J. Optim."},{"key":"194_CR40","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01588952","volume":"14","author":"BT Poljak","year":"1978","unstructured":"Poljak, B.T.: Nonlinear programming methods in the presence of noise. Math. Program. 14, 87\u201397 (1978)","journal-title":"Math. Program."},{"key":"194_CR41","first-page":"593","volume":"8","author":"BT Polyak","year":"1967","unstructured":"Polyak, B.T.: A general method for solving extremum problems. Sov. Math. Doklady 8, 593\u2013597 (1967)","journal-title":"Sov. Math. Doklady"},{"key":"194_CR42","volume-title":"Introduction to Optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, New York (1987)"},{"key":"194_CR43","doi-asserted-by":"crossref","first-page":"1028","DOI":"10.1007\/s10957-019-01582-z","volume":"183","author":"EA Papa Quiroz","year":"2019","unstructured":"Papa Quiroz, E.A., Apolinario, H.C.F., Villacorta, K.D., Oliveira, P.R.: A linear scalarization proximal point method for quasiconvex multiobjective minimization. J. Optim. Theory Appl. 183, 1028\u20131052 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"194_CR44","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.ejor.2011.07.019","volume":"216","author":"EA Papa Quiroz","year":"2012","unstructured":"Papa Quiroz, E.A., Oliveira, P.R.: An extension of proximal methods for quasiconvex minimization on the nonnegative orthant. Eur. J. Oper. Res. 216, 26\u201332 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"194_CR45","first-page":"49","volume":"16","author":"EA Papa Quiroz","year":"2009","unstructured":"Papa Quiroz, E.A., Oliveira, P.R.: Proximal point methods for quasiconvex and convex functions with Bregman distances on Hadamard manifolds. J. Convex Anal. 16, 49\u201369 (2009)","journal-title":"J. Convex Anal."},{"key":"194_CR46","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.jmaa.2007.10.010","volume":"341","author":"EA Papa Quiroz","year":"2008","unstructured":"Papa Quiroz, E.A., Quispe Cardenas, E.M., Oliveira, P.R.: Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds. J. Math. Anal. Appl. 341, 467\u2013477 (2008)","journal-title":"J. Math. Anal. Appl."},{"key":"194_CR47","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1016\/j.ejor.2015.05.041","volume":"246","author":"EA Papa Quiroz","year":"2015","unstructured":"Papa Quiroz, E.A., Ramirez, L.M., Oliveira, P.R.: An inexact proximal method for quasiconvex minimization. Eur. J. Oper. Res. 246, 721\u2013729 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"194_CR48","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s101070050078","volume":"86","author":"SM Robinson","year":"1999","unstructured":"Robinson, S.M.: Linear convergence of epsilon-subgradient descent methods for a class of convex functions. Math. Program. 86, 41\u201350 (1999)","journal-title":"Math. Program."},{"key":"194_CR49","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization Methods for Non-differentiable Functions","author":"NZ Shor","year":"1985","unstructured":"Shor, N.Z.: Minimization Methods for Non-differentiable Functions. Springer, New York (1985)"},{"key":"194_CR50","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-0035-6","volume-title":"Fractional Programming","author":"IM Stancu-Minasian","year":"1997","unstructured":"Stancu-Minasian, I.M.: Fractional Programming. Kluwer, Dordrecht (1997)"},{"key":"194_CR51","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1137\/S0363012996301269","volume":"38","author":"M Studniarski","year":"1999","unstructured":"Studniarski, M., Ward, D.E.: Weak sharp minima: characterizations and sufficient conditions. SIAM J. Control Optim. 38, 219\u2013236 (1999)","journal-title":"SIAM J. Control Optim."},{"key":"194_CR52","doi-asserted-by":"crossref","first-page":"055017","DOI":"10.1088\/1361-6420\/aa6699","volume":"33","author":"J Wang","year":"2017","unstructured":"Wang, J., Hu, Y., Li, C., Yao, J.-C.: Linear convergence of CQ algorithms and applications in gene regulatory network inference. Inverse Probl. 33, 055017 (2017)","journal-title":"Inverse Probl."},{"key":"194_CR53","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, 2696\u20132729 (2016)","journal-title":"SIAM J. Optim."},{"key":"194_CR54","unstructured":"Xu, Y., Lin, Q., Yang, T.: Accelerate stochastic subgradient method by leveraging local error bound. arXiv:1607.01027 (2018)"},{"key":"194_CR55","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1080\/02331934.2018.1455831","volume":"68","author":"CKW Yu","year":"2019","unstructured":"Yu, C.K.W., Hu, Y., Yang, X., Choy, S.K.: Abstract convergence theorem for quasi-convex optimization problems with applications. Optimization 68, 1289\u20131304 (2019)","journal-title":"Optimization"},{"key":"194_CR56","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1007\/s10107-016-1100-9","volume":"165","author":"Z Zhou","year":"2017","unstructured":"Zhou, Z., So, A.M.C.: A unified approach to error bounds for structured convex optimization problems. Math. Program. 165, 689\u2013728 (2017)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00194-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-020-00194-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00194-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T23:18:50Z","timestamp":1621034330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-020-00194-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,15]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["194"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00194-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,15]]},"assertion":[{"value":"28 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}