{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T15:50:47Z","timestamp":1776873047321,"version":"3.51.2"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,9,27]],"date-time":"2018-09-27T00:00:00Z","timestamp":1538006400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,9,27]],"date-time":"2018-09-27T00:00:00Z","timestamp":1538006400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["DMS-1619884"],"award-info":[{"award-number":["DMS-1619884"]}],"id":[{"id":"10.13039\/100000121","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":[[2019,1]]},"DOI":"10.1007\/s10589-018-0033-z","type":"journal-article","created":{"date-parts":[[2018,9,27]],"date-time":"2018-09-27T14:57:33Z","timestamp":1538060253000},"page":"1-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Proximal alternating penalty algorithms for nonsmooth constrained convex optimization"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1077-2579","authenticated-orcid":false,"given":"Quoc","family":"Tran-Dinh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,27]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","unstructured":"Attouch, H., Chbani, Z., Riahi, H.: Rate of convergence of the Nesterov accelerated gradient method in the subcritical case $$\\alpha \\le 3$$. ESAIM: COCV (2017). \n                    https:\/\/doi.org\/10.1051\/cocv\/2017083","DOI":"10.1051\/cocv\/2017083"},{"issue":"3","key":"33_CR2","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16(3), 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"33_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operators Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.: Convex Analysis and Monotone Operators Theory in Hilbert Spaces, 2nd edn. Springer, Berlin (2017)","edition":"2"},{"issue":"1","key":"33_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding agorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"33_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12532-011-0029-5","volume":"3","author":"S Becker","year":"2011","unstructured":"Becker, S., Cand\u00e8s, E.J., Grant, M.: Templates for convex cone problems with applications to sparse signal recovery. Math. Program. Comput. 3(3), 165\u2013218 (2011)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"33_CR6","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1093\/biomet\/asr043","volume":"94","author":"A Belloni","year":"2011","unstructured":"Belloni, A., Chernozhukov, V., Wang, L.: Square-root LASSO: pivotal recovery of sparse signals via conic programming. Biometrika 94(4), 791\u2013806 (2011)","journal-title":"Biometrika"},{"key":"33_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, Volume 3 of MPS\/SIAM Series on Optimization","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, Volume 3 of MPS\/SIAM Series on Optimization. SIAM, Philadelphia (2001)"},{"key":"33_CR8","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Nashua (1999)","edition":"2"},{"issue":"1","key":"33_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"33_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. University Press, Cambridge (2004)"},{"issue":"1","key":"33_CR11","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"issue":"1\u20132","key":"33_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10107-015-0957-3","volume":"159","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: On the ergodic convergence rates of a first-order primal\u2013dual algorithm. Math. Program. 159(1\u20132), 253\u2013287 (2016)","journal-title":"Math. Program."},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01582566","volume":"64","author":"G Chen","year":"1994","unstructured":"Chen, G., Teboulle, M.: A proximal-based decomposition method for convex minimization problems. Math. Program. 64, 81\u2013101 (1994)","journal-title":"Math. Program."},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s10957-012-0245-9","volume":"158","author":"L Condat","year":"2013","unstructured":"Condat, L.: A primal\u2013dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms. J. Optim. Theory Appl. 158, 460\u2013479 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"33_CR15","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1137\/151003076","volume":"25","author":"D Davis","year":"2015","unstructured":"Davis, D.: Convergence rate analysis of primal\u2013dual splitting schemes. SIAM J. Optim. 25(3), 1912\u20131943 (2015)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"33_CR16","doi-asserted-by":"publisher","first-page":"1760","DOI":"10.1137\/140992291","volume":"25","author":"D Davis","year":"2015","unstructured":"Davis, D.: Convergence rate analysis of the forward-Douglas\u2013Rachford splitting scheme. SIAM J. Optim. 25(3), 1760\u20131786 (2015)","journal-title":"SIAM J. Optim."},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1287\/moor.2016.0827","volume":"42","author":"D Davis","year":"2014","unstructured":"Davis, D., Yin, W.: Faster convergence rates of relaxed Peaceman\u2013Rachford and ADMM under regularity assumptions. Math. Oper. Res. 42, 783\u2013805 (2014)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"33_CR18","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1137\/15M103217X","volume":"27","author":"Y Du","year":"2017","unstructured":"Du, Y., Lin, X., Ruszczy\u0144ski, A.: A selective linearization method for multiblock convex optimization. SIAM J. Optim. 27(2), 1102\u20131117 (2017)","journal-title":"SIAM J. Optim."},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293\u2013318 (1992)","journal-title":"Math. Program."},{"issue":"4","key":"33_CR20","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1137\/09076934X","volume":"3","author":"E Esser","year":"2010","unstructured":"Esser, E., Zhang, X., Chan, T.: A general framework for a class of first order primal-dual algorithms for TV-minimization. SIAM J. Imaging Sci. 3(4), 1015\u20131046 (2010)","journal-title":"SIAM J. Imaging Sci."},{"key":"33_CR21","volume-title":"Practical Methods of Optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization, 2nd edn. Wiley, Chichester (1987)","edition":"2"},{"issue":"1","key":"33_CR22","first-page":"349","volume":"141","author":"D Goldfarb","year":"2012","unstructured":"Goldfarb, D., Ma, S., Scheinberg, K.: Fast alternating linearization methods of minimization of the sum of two convex functions. Math. Program. Ser. A 141(1), 349\u2013382 (2012)","journal-title":"Math. Program. Ser. A"},{"issue":"3","key":"33_CR23","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1137\/120896219","volume":"7","author":"T Goldstein","year":"2012","unstructured":"Goldstein, T., O\u2019Donoghue, B., Setzer, S.: Fast alternating direction optimization methods. SIAM J. Imaging Sci. 7(3), 1588\u20131623 (2012)","journal-title":"SIAM J. Imaging Sci."},{"key":"33_CR24","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/0-387-30528-9_7","volume-title":"Global Optimization: From Theory to Implementation, Nonconvex Optimization and Its Applications","author":"M Grant","year":"2006","unstructured":"Grant, M., Boyd, S., Ye, Y.: Disciplined convex programming. In: Liberti, L., Maculan, N. (eds.) Global Optimization: From Theory to Implementation, Nonconvex Optimization and Its Applications, pp. 155\u2013210. Springer, Berlin (2006)"},{"key":"33_CR25","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"BS He","year":"2012","unstructured":"He, B.S., Yuan, X.M.: On the $${O}(1\/n)$$ convergence rate of the Douglas\u2013Rachford alternating direction method. SIAM J. Numer. Anal. 50, 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"33_CR26","first-page":"427","volume":"28","author":"M Jaggi","year":"2013","unstructured":"Jaggi, M.: Revisiting Frank\u2013Wolfe: projection-free sparse convex optimization. JMLR W&CP 28(1), 427\u2013435 (2013)","journal-title":"JMLR W&CP"},{"key":"33_CR27","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: Burges, C.J.C., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K.Q. (eds.), Advances in Neural Information Processing Systems (NIPS), pp. 315\u2013323. NIPS Foundation Inc., Lake Tahoe (2013)"},{"issue":"3","key":"33_CR28","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1137\/S1052623495288064","volume":"9","author":"KC Kiwiel","year":"1999","unstructured":"Kiwiel, K.C., Rosa, C.H., Ruszczy\u0144ski, A.: Proximal decomposition via alternating linearization. SIAM J. Optim. 9(3), 668\u2013689 (1999)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"33_CR29","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-012-0588-x","volume":"138","author":"G Lan","year":"2013","unstructured":"Lan, G., Monteiro, R.D.C.: Iteration complexity of first-order penalty methods for convex programming. Math. Program. 138(1), 115\u2013139 (2013)","journal-title":"Math. Program."},{"key":"33_CR30","doi-asserted-by":"publisher","unstructured":"Necoara, I., Nesterov, Yu., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program. (2018). \n                    https:\/\/doi.org\/10.1007\/s10107-018-1232-1","DOI":"10.1007\/s10107-018-1232-1"},{"key":"33_CR31","doi-asserted-by":"publisher","unstructured":"Necoara, I., Patrascu, A., Glineur, F.: Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming. Optim. Method Softw. (2017). \n                    https:\/\/doi.org\/10.1080\/10556788.2017.1380642","DOI":"10.1080\/10556788.2017.1380642"},{"issue":"3","key":"33_CR32","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s10957-009-9566-8","volume":"143","author":"I Necoara","year":"2009","unstructured":"Necoara, I., Suykens, J.A.K.: Interior-point Lagrangian decomposition method for separable convex optimization. J. Optim. Theory Appl. 143(3), 567\u2013588 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"33_CR33","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A Nemirovskii","year":"1983","unstructured":"Nemirovskii, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley Interscience, New York (1983)"},{"key":"33_CR34","unstructured":"Nesterov, Y.: A method for unconstrained convex minimization problem with the rate of convergence $${\\cal{O}} (1\/k^2)$$. Doklady AN SSSR 269, 543\u2013547 (1983). Translated as Soviet Math. Dokl"},{"key":"33_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course, Volume 87 of Applied Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, Volume 87 of Applied Optimization. Kluwer Academic Publishers, Dordrecht (2004)"},{"issue":"2","key":"33_CR36","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"33_CR37","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective function. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"33_CR38","unstructured":"Nguyen, V.Q., Fercoq, O., Cevher, V.: Smoothing technique for nonsmooth composite minimization with linear operator. ArXiv preprint (\n                    arXiv:1706.05837\n                    \n                  ) (2017)"},{"key":"33_CR39","series-title":"Springer Series in Operations Research and Financial Engineering","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"33_CR40","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019Donoghue","year":"2015","unstructured":"O\u2019Donoghue, B., Candes, E.: Adaptive Restart for Accelerated Gradient Schemes. Found. Comput. Math. 15, 715\u2013732 (2015)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"33_CR41","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/14095697X","volume":"8","author":"Y Ouyang","year":"2015","unstructured":"Ouyang, Y., Chen, Y., Lan, G., Pasiliao, E\u00a0.J.R.: An accelerated linearized alternating direction method of multiplier. SIAM J. Imaging Sci. 8(1), 644\u2013681 (2015)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"33_CR42","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"33_CR43","volume-title":"Convex Analysis, Volume\u00a028 of Princeton Mathematics Series","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis, Volume\u00a028 of Princeton Mathematics Series. Princeton University Press, Princeton (1970)"},{"issue":"1","key":"33_CR44","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s13675-015-0048-5","volume":"4","author":"R Shefi","year":"2016","unstructured":"Shefi, R., Teboulle, M.: On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems. EURO J. Comput. Optim. 4(1), 27\u201346 (2016)","journal-title":"EURO J. Comput. Optim."},{"key":"33_CR45","volume-title":"Optimization for Machine Learning","author":"S Sra","year":"2012","unstructured":"Sra, S., Nowozin, S., Wright, S.J.: Optimization for Machine Learning. MIT Press, Cambridge (2012)"},{"key":"33_CR46","doi-asserted-by":"crossref","unstructured":"Tran-Dinh, Q., Alacaoglu, A., Fercoq, O., Cevher, V.: Self-adaptive double-loop primal\u2013dual algorithm for nonsmooth convex optimization. ArXiv preprint (\n                    arXiv:1808.04648\n                    \n                  ), pp. 1\u201338 (2018)","DOI":"10.1007\/s12532-019-00173-3"},{"key":"33_CR47","unstructured":"Tran-Dinh, Q., Cevher, V.: A primal\u2013dual algorithmic framework for constrained convex minimization. ArXiv preprint (\n                    arXiv:1406.5403\n                    \n                  ), Technical Report, pp. 1\u201354 (2014)"},{"key":"33_CR48","unstructured":"Tran-Dinh, Q., Cevher, V.: Constrained convex minimization via model-based excessive gap. In: Proceedings of the Neural Information Processing Systems (NIPS), vol. 27, pp. 721\u2013729, Montreal, Canada, December (2014)"},{"key":"33_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/16M1093094","volume":"28","author":"Q Tran-Dinh","year":"2018","unstructured":"Tran-Dinh, Q., Fercoq, O., Cevher, V.: A smooth primal\u2013dual optimization framework for nonsmooth composite convex minimization. SIAM J. Optim. 28, 1\u201335 (2018)","journal-title":"SIAM J. Optim."},{"key":"33_CR50","unstructured":"Tran-Dinh, Q.: Construction and iteration-complexity of primal sequences in alternating minimization algorithms. ArXiv preprint (\n                    arXiv:1511.03305\n                    \n                  ) (2015)"},{"issue":"3","key":"33_CR51","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10589-016-9873-6","volume":"66","author":"Q Tran-Dinh","year":"2016","unstructured":"Tran-Dinh, Q.: Adaptive smoothing algorithms for nonsmooth composite convex minimization. Comput. Optim. Appl. 66(3), 425\u2013451 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"33_CR52","unstructured":"Tran-Dinh, Q.: Non-Ergodic alternating proximal augmented Lagrangian algorithms with optimal rates. In: The 32nd Conference on Neural Information Processing Systems (NIPS), pp. 1\u20139, NIPS Foundation Inc., Montreal, Canada, December (2018)"},{"key":"33_CR53","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/0329006","volume":"29","author":"P Tseng","year":"1991","unstructured":"Tseng, P.: Applications of splitting algorithm to decomposition in convex programming and variational inequalities. SIAM J. Control Optim. 29, 119\u2013138 (1991)","journal-title":"SIAM J. Control Optim."},{"key":"33_CR54","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. Submitted to SIAM J. Optim. (2008)"},{"issue":"3","key":"33_CR55","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s10444-011-9254-8","volume":"38","author":"CB Vu","year":"2013","unstructured":"Vu, C.B.: A splitting algorithm for dual monotone inclusions involving co-coercive operators. Adv. Comput. Math. 38(3), 667\u2013681 (2013)","journal-title":"Adv. Comput. Math."},{"key":"33_CR56","unstructured":"Woodworth, B.E., Srebro, N.: Tight complexity bounds for optimizing composite objectives. In: Lee, D.D., Sugiyama, M., Luxburg, U.V., Guyon, I., Garnett, R. (eds.), Advances in Neural Information Processing Systems (NIPS), pp. 3639\u20133647. NIPS Foundation Inc., Barcelona, Spain (2016)"},{"issue":"3","key":"33_CR57","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1137\/16M1082305","volume":"27","author":"Y Xu","year":"2017","unstructured":"Xu, Y.: Accelerated first-order primal\u2013dual proximal methods for linearly constrained composite convex programming. SIAM J. Optim. 27(3), 1459\u20131484 (2017)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"33_CR58","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., Hastie, T.: Regularization and variable selection via the elastic net. J. R. Stat. Soc. Ser. B 67(2), 301\u2013320 (2005)","journal-title":"J. R. Stat. Soc. Ser. B"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0033-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0033-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0033-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T11:00:39Z","timestamp":1589713239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0033-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,27]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["33"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0033-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,27]]},"assertion":[{"value":"9 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}