{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:31:24Z","timestamp":1771702284553,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10208-015-9282-8","type":"journal-article","created":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T17:38:03Z","timestamp":1441042683000},"page":"35-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["An Extragradient-Based Alternating Direction Method for Convex Minimization"],"prefix":"10.1007","volume":"17","author":[{"given":"Tianyi","family":"Lin","sequence":"first","affiliation":[]},{"given":"Shiqian","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Shuzhong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,1]]},"reference":[{"key":"9282_CR1","first-page":"485","volume":"9","author":"O Banerjee","year":"2008","unstructured":"O.\u00a0Banerjee, L.\u00a0El\u00a0Ghaoui, and A.\u00a0d\u2019Aspremont. Model selection through sparse maximum likelihood estimation for multivariate gaussian for binary data. Journal of Machine Learning Research, 9:485\u2013516, 2008.","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"9282_CR2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"A.\u00a0Beck and M.\u00a0Teboulle. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sciences, 2(1):183\u2013202, 2009.","journal-title":"SIAM J. Imaging Sciences"},{"key":"9282_CR3","doi-asserted-by":"crossref","first-page":"095001","DOI":"10.1088\/0266-5611\/27\/9\/095001","volume":"27","author":"S Bonettini","year":"2011","unstructured":"S.\u00a0Bonettini and V.\u00a0Ruggiero. An alternating extragradient method for total variation based image restoration from Poisson data. Inverse Problems, 27:095001, 2011.","journal-title":"Inverse Problems"},{"issue":"1","key":"9282_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"S.\u00a0Boyd, N.\u00a0Parikh, E.\u00a0Chu, B.\u00a0Peleato, and J.\u00a0Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1):1\u2013122, 2011.","journal-title":"Foundations and Trends in Machine Learning"},{"issue":"3","key":"9282_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"E.\u00a0J. Cand\u00e8s, X.\u00a0Li, Y.\u00a0Ma, and J.\u00a0Wright. Robust principal component analysis? Journal of ACM, 58(3):1\u201337, 2011.","journal-title":"Journal of ACM"},{"issue":"2","key":"9282_CR6","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1137\/090761793","volume":"21","author":"V Chandrasekaran","year":"2011","unstructured":"V.\u00a0Chandrasekaran, S.\u00a0Sanghavi, P.\u00a0Parrilo, and A.\u00a0Willsky. Rank-sparsity incoherence for matrix decomposition. SIAM Journal on Optimization, 21(2):572\u2013596, 2011.","journal-title":"SIAM Journal on Optimization"},{"key":"9282_CR7","unstructured":"D.\u00a0Davis and W.\u00a0Yin. Convergence rate analysis of several splitting schemes. UCLA CAM Report 14-51, 2014."},{"key":"9282_CR8","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1090\/S0002-9947-1956-0084194-4","volume":"82","author":"J Douglas","year":"1956","unstructured":"J.\u00a0Douglas and H.\u00a0H. Rachford. On the numerical solution of the heat conduction problem in 2 and 3 space variables. Transactions of the American Mathematical Society, 82:421\u2013439, 1956.","journal-title":"Transactions of the American Mathematical Society"},{"key":"9282_CR9","unstructured":"J.\u00a0Eckstein. Splitting methods for monotone operators with applications to parallel optimization. PhD thesis, Massachusetts Institute of Technology, 1989."},{"key":"9282_CR10","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"J.\u00a0Eckstein and D.\u00a0P. Bertsekas. On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Mathematical Programming, 55:293\u2013318, 1992.","journal-title":"Mathematical Programming"},{"key":"9282_CR11","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10107-012-0528-9","volume":"141","author":"J Eckstein","year":"2013","unstructured":"J.\u00a0Eckstein and P.\u00a0J.\u00a0S. Silva. A practical relative error criterion for augmented lagrangians. Mathematical Programming, 141:319\u2013348, 2013.","journal-title":"Mathematical Programming"},{"key":"9282_CR12","unstructured":"M.\u00a0Fortin and R.\u00a0Glowinski. Augmented Lagrangian methods: applications to the numerical solution of boundary-value problems. North-Holland Pub. Co., 1983."},{"issue":"3","key":"9282_CR13","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1093\/biostatistics\/kxm045","volume":"9","author":"J Friedman","year":"2008","unstructured":"J.\u00a0Friedman, T.\u00a0Hastie, and R.\u00a0Tibshirani. Sparse inverse covariance estimation with the graphical lasso. Biostatistics, 9(3):432\u2013441, 2008.","journal-title":"Biostatistics"},{"key":"9282_CR14","volume-title":"Augmented Lagrangian Methods: Applications to the Solution of Boundary Value Problems","author":"D Gabay","year":"1983","unstructured":"D.\u00a0Gabay. Applications of the method of multipliers to variational inequalities. In M.\u00a0Fortin and R.\u00a0Glowinski, editors, Augmented Lagrangian Methods: Applications to the Solution of Boundary Value Problems. North-Hollan, Amsterdam, 1983."},{"key":"9282_CR15","unstructured":"X.\u00a0Gao, B.\u00a0Jiang, and S.\u00a0Zhang. On the information-adaptive variants of the ADMM: an iteration complexity perspective. Optimization Online http:\/\/www.optimization-online.org\/DB_FILE\/2014\/11\/4633.pdf , 2014."},{"key":"9282_CR16","unstructured":"P.\u00a0E. Gill, W.\u00a0Murray, and M.\u00a0A. Saunders. Users guide for SQOPT 5.3: a Fortran package for large-scale linear and quadratic programming. Technical report, Technical Report NA 97-4. University of California, San Diego., 1997."},{"key":"9282_CR17","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970838","volume-title":"Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics","author":"R Glowinski","year":"1989","unstructured":"R.\u00a0Glowinski and P.\u00a0Le\u00a0Tallec. Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics. SIAM, Philadelphia, Pennsylvania, 1989."},{"key":"9282_CR18","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/080725891","volume":"2","author":"T Goldstein","year":"2009","unstructured":"T.\u00a0Goldstein and S.\u00a0Osher. The split Bregman method for L1-regularized problems. SIAM J. Imaging Sci., 2:323\u2013343, 2009.","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"9282_CR19","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"ET Hale","year":"2008","unstructured":"E.\u00a0T. Hale, W.\u00a0Yin, and Y.\u00a0Zhang. Fixed-point continuation for $$\\ell _1$$ \u2113 1 -minimization: Methodology and convergence. SIAM Journal on Optimization, 19(3):1107\u20131130, 2008.","journal-title":"SIAM Journal on Optimization"},{"key":"9282_CR20","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s101070100280","volume":"92","author":"B He","year":"2002","unstructured":"B.\u00a0He, L.\u00a0Liao, D.\u00a0Han, and H.\u00a0Yang. A new inexact alternating direction method for monotone variational inequalities. Mathematical Programming, 92:103\u2013118, 2002.","journal-title":"Mathematical Programming"},{"key":"9282_CR21","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"B.\u00a0He and X.\u00a0Yuan. On the $${\\cal {O}}(1\/n)$$ O ( 1 \/ n ) convergence rate of douglas-rachford alternating direction method. SIAM Journal on Numerical Analysis, 50:700\u2013709, 2012.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"9282_CR22","unstructured":"G.\u00a0Korpelevich. The extragradient method for finding saddle points and other problems. Ekonomika i Matematicheskie Metody, 12:747\u2013756, 1976. (in Russian; English translation in Matekon)."},{"key":"9282_CR23","unstructured":"G.\u00a0Korpelevich. Extrapolation gradient methods and relation to modified lagrangeans. Ekonomika i Matematicheskie Metody, 19:694\u2013703, 1983. (in Russian; English translation in Matekon)."},{"key":"9282_CR24","doi-asserted-by":"publisher","unstructured":"T.\u00a0Lin, S.\u00a0Ma, and S.\u00a0Zhang. On the sublinear convergence rate of multi-block ADMM. Journal of the Operations Research Society of China. doi: 10.1007\/s40305-015-0092-0 , 2015.","DOI":"10.1007\/s40305-015-0092-0"},{"key":"9282_CR25","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"P.\u00a0L. Lions and B.\u00a0Mercier. Splitting algorithms for the sum of two nonlinear operators. SIAM Journal on Numerical Analysis, 16:964\u2013979, 1979.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"9282_CR26","doi-asserted-by":"crossref","unstructured":"J.\u00a0Liu, J.\u00a0Chen, and J.\u00a0Ye. Large-scale sparse logistic regression. In SIGKDD, 2009.","DOI":"10.1145\/1557019.1557082"},{"issue":"2","key":"9282_CR27","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s40305-013-0016-9","volume":"1","author":"S Ma","year":"2013","unstructured":"S.\u00a0Ma. Alternating direction method of multipliers for sparse principal component analysis. Journal of the Operations Research Society of China, 1(2):253\u2013274, 2013.","journal-title":"Journal of the Operations Research Society of China"},{"key":"9282_CR28","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S Ma","year":"2011","unstructured":"S.\u00a0Ma, D.\u00a0Goldfarb, and L.\u00a0Chen. Fixed point and Bregman iterative methods for matrix rank minimization. Mathematical Programming Series A, 128:321\u2013353, 2011.","journal-title":"Mathematical Programming Series A"},{"key":"9282_CR29","doi-asserted-by":"crossref","first-page":"2755","DOI":"10.1137\/090753127","volume":"20","author":"RDC Monteiro","year":"2010","unstructured":"R.\u00a0D.\u00a0C. Monteiro and B.\u00a0F. Svaiter. On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean. SIAM Journal on Optimization, 20:2755\u20132787, 2010.","journal-title":"SIAM Journal on Optimization"},{"key":"9282_CR30","doi-asserted-by":"crossref","first-page":"1688","DOI":"10.1137\/100801652","volume":"21","author":"RDC Monteiro","year":"2011","unstructured":"R.\u00a0D.\u00a0C. Monteiro and B.\u00a0F. Svaiter. Complexity of variants of Tseng\u2019s modified F-B splitting and Korpelevich\u2019s methods for hemi-variational inequalities with applications to saddle point and convex optimization problems. SIAM Journal on Optimization, 21:1688\u20131720, 2011.","journal-title":"SIAM Journal on Optimization"},{"key":"9282_CR31","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1137\/110849468","volume":"23","author":"RDC Monteiro","year":"2013","unstructured":"R.\u00a0D.\u00a0C. Monteiro and B.\u00a0F. Svaiter. Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers. SIAM Journal on Optimization, 23:475\u2013507, 2013.","journal-title":"SIAM Journal on Optimization"},{"issue":"11","key":"9282_CR32","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1109\/TAC.2008.2007159","volume":"53","author":"I Necoara","year":"2008","unstructured":"I.\u00a0Necoara and J.\u00a0Suykens. Application of a smoothing technique to decomposition in convex optimization. IEEE Trans. Automat. Contr., 53(11):2674\u20132679, 2008.","journal-title":"IEEE Trans. Automat. Contr."},{"issue":"1","key":"9282_CR33","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2005","unstructured":"A.\u00a0Nemirovski. Prox-method with rate of convergence $$O(1\/t)$$ O ( 1 \/ t ) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM Journal on Optimization, 15(1):229\u2013251, 2005.","journal-title":"SIAM Journal on Optimization"},{"key":"9282_CR34","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"YE Nesterov","year":"2005","unstructured":"Y.\u00a0E. Nesterov. Smooth minimization for non-smooth functions. Math. Program. Ser. A, 103:127\u2013152, 2005.","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"9282_CR35","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0022-247X(03)00023-4","volume":"277","author":"MA Noor","year":"2003","unstructured":"M.\u00a0A. Noor. New extragradient-type methods for general variational inequalities. Journal of Mathematical Analysis and Applications, 277(2):379\u2013394, 2003.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"9282_CR36","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0103003","volume":"3","author":"DH Peaceman","year":"1955","unstructured":"D.\u00a0H. Peaceman and H.\u00a0H. Rachford. The numerical solution of parabolic elliptic differential equations. SIAM Journal on Applied Mathematics, 3:28\u201341, 1955.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"2","key":"9282_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richtarik","year":"2014","unstructured":"P.\u00a0Richtarik and M.\u00a0Takac. Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Mathematical Programming, 144(2):1\u201338, 2014.","journal-title":"Mathematical Programming"},{"key":"9282_CR38","doi-asserted-by":"crossref","unstructured":"P.\u00a0Richtarik and M.\u00a0Takac. Parallel coordinate descent methods for big data optimization. Mathematical Programming, 2015.","DOI":"10.1007\/s10107-015-0901-6"},{"key":"9282_CR39","doi-asserted-by":"crossref","unstructured":"K.\u00a0Scheinberg, S.\u00a0Ma, and D.\u00a0Goldfarb. Sparse inverse covariance selection via alternating linearization methods. In NIPS, 2010.","DOI":"10.7551\/mitpress\/8996.003.0019"},{"key":"9282_CR40","doi-asserted-by":"crossref","unstructured":"S.\u00a0Shalev-Shwartz and T.\u00a0Zhang. Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization. Mathematical Programming, 2015.","DOI":"10.1007\/s10107-014-0839-0"},{"key":"9282_CR41","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1023\/A:1008777829180","volume":"7","author":"MV Solodov","year":"1999","unstructured":"M.\u00a0V. Solodov and B.\u00a0F. Svaiter. A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Anal., 7:323\u2013345, 1999.","journal-title":"Set-Valued Anal."},{"key":"9282_CR42","unstructured":"T.\u00a0Suzuki. Stochastic dual coordinate ascent with alternating direction multiplier method. In ICML, 2014."},{"key":"9282_CR43","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/100781894","volume":"21","author":"M Tao","year":"2011","unstructured":"M.\u00a0Tao and X.\u00a0Yuan. Recovering low-rank and sparse components of matrices from incomplete and noisy observations. SIAM J. Optim., 21:57\u201381, 2011.","journal-title":"SIAM J. Optim."},{"key":"9282_CR44","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"R.\u00a0Tibshirani. Regression shrinkage and selection via the lasso. Journal Royal Statistical Society B, 58:267\u2013288, 1996.","journal-title":"Journal Royal Statistical Society B"},{"issue":"1","key":"9282_CR45","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"R Tibshirani","year":"2005","unstructured":"R.\u00a0Tibshirani, M.\u00a0Saunders, S.\u00a0Rosset, J.\u00a0Zhu, and K.\u00a0Knight. Sparsity and smoothness via the fused lasso. J. R. Stat. Soc. Ser. B Stat. Methodol., 67(1):91\u2013108, 2005.","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"key":"9282_CR46","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10898-013-0085-7","volume":"59","author":"Q Tran Dinh","year":"2014","unstructured":"Q.\u00a0Tran\u00a0Dinh, I.\u00a0Necoara, and M.\u00a0Diehl. Path-following gradient-based decomposition algorithms for separable convex optimization. Journal of Global Optimization, 59:59\u201380, 2014.","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"9282_CR47","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1137\/080724265","volume":"1","author":"Y Wang","year":"2008","unstructured":"Y.\u00a0Wang, J.\u00a0Yang, W.\u00a0Yin, and Y.\u00a0Zhang. A new alternating minimization algorithm for total variation image reconstruction. SIAM Journal on Imaging Sciences, 1(3):248\u2013272, 2008.","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"9282_CR48","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"Z Wen","year":"2010","unstructured":"Z.\u00a0Wen, D.\u00a0Goldfarb, and W.\u00a0Yin. Alternating direction augmented Lagrangian methods for semidefinite programming. Mathematical Programming Computation, 2:203\u2013230, 2010.","journal-title":"Mathematical Programming Computation"},{"issue":"281","key":"9282_CR49","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1090\/S0025-5718-2012-02598-1","volume":"82","author":"J Yang","year":"2013","unstructured":"J.\u00a0Yang and X.\u00a0Yuan. Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization. Mathematics of Computation, 82(281):301\u2013329, 2013.","journal-title":"Mathematics of Computation"},{"issue":"1","key":"9282_CR50","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"J.\u00a0Yang and Y.\u00a0Zhang. Alternating direction algorithms for $$\\ell _1$$ \u2113 1 problems in compressive sensing. SIAM Journal on Scientific Computing, 33(1):250\u2013278, 2011.","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"4","key":"9282_CR51","doi-asserted-by":"crossref","first-page":"1552","DOI":"10.1016\/j.csda.2010.10.021","volume":"55","author":"G Ye","year":"2011","unstructured":"G.\u00a0Ye and X.\u00a0Xie. Split Bregman method for large scale fused Lasso. Computational Statistics and Data Analysis, 55(4):1552\u20131569, 2011.","journal-title":"Computational Statistics and Data Analysis"},{"issue":"1","key":"9282_CR52","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1093\/biomet\/asm018","volume":"94","author":"M Yuan","year":"2007","unstructured":"M.\u00a0Yuan and Y.\u00a0Lin. Model selection and estimation in the Gaussian graphical model. Biometrika, 94(1):19\u201335, 2007.","journal-title":"Biometrika"},{"key":"9282_CR53","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10915-011-9507-1","volume":"51","author":"X Yuan","year":"2012","unstructured":"X.\u00a0Yuan. Alternating direction methods for sparse covariance selection. Journal of Scientific Computing, 51:261\u2013273, 2012.","journal-title":"Journal of Scientific Computing"},{"key":"9282_CR54","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1137\/090746379","volume":"3","author":"X Zhang","year":"2010","unstructured":"X.\u00a0Zhang, M.\u00a0Burger, X.\u00a0Bresson, and S.\u00a0Osher. Bregmanized nonlocal regularization for deconvolution and sparse reconstruction. SIAM Journal on Imaging Science, 3:253\u2013276, 2010.","journal-title":"SIAM Journal on Imaging Science"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9282-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-015-9282-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9282-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9282-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T21:00:53Z","timestamp":1718053253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-015-9282-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,1]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9282"],"URL":"https:\/\/doi.org\/10.1007\/s10208-015-9282-8","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,1]]}}}