{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T03:00:06Z","timestamp":1782961206881,"version":"3.54.5"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,11,8]],"date-time":"2017-11-08T00:00:00Z","timestamp":1510099200000},"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":["Math. Program."],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10107-017-1205-9","type":"journal-article","created":{"date-parts":[[2017,11,7]],"date-time":"2017-11-07T23:17:12Z","timestamp":1510096632000},"page":"37-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights"],"prefix":"10.1007","volume":"173","author":[{"given":"Caihua","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Min","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5705-0805","authenticated-orcid":false,"given":"Xin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,11,8]]},"reference":[{"issue":"2","key":"1205_CR1","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1214\/12-AOS1000","volume":"40","author":"A Agarwal","year":"1997","unstructured":"Agarwal, A., Negahban, S., Wainwright, M.J.: Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions. Ann. Stat. 40(2), 1171\u20131197 (1997)","journal-title":"Ann. Stat."},{"key":"1205_CR2","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1205_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/13094829X","volume":"25","author":"A Beck","year":"2015","unstructured":"Beck, A.: On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes. SIAM J. Optim. 25(1), 185\u2013209 (2015)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1205_CR4","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1137\/120887679","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent type methods. SIAM J. Optim. 23(2), 2037\u20132060 (2013)","journal-title":"SIAM J. Optim."},{"key":"1205_CR5","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena-Scientific, Belmont (1999)","edition":"2"},{"key":"1205_CR6","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. In: Parallel and Distributed Computation: Numerical Methods, 2nd ed. Athena Scientific, Belmont, MA (1997)"},{"key":"1205_CR7","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S.Y., Teboulle, M.: Proximal alternating linearized minimization nonconvex and nonsmooth problems. Math. Program. 146, 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"1205_CR8","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."},{"issue":"1","key":"1205_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10589-016-9860-y","volume":"66","author":"X Cai","year":"2017","unstructured":"Cai, X., Han, D., Yuan, X.: On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function. Comput. Optim. Appl. 66(1), 39\u201373 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1205_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10107-014-0826-5","volume":"155","author":"C Chen","year":"2016","unstructured":"Chen, C., He, B., Ye, Y., Yuan, X.: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent. Math. Program. 155(1), 57\u201379 (2016)","journal-title":"Math. Program."},{"key":"1205_CR11","doi-asserted-by":"crossref","unstructured":"Chen, C., Shen, Y., You, Y.: On the convergence analysis of the alternating direction method of multipliers with three blocks. Abstract and Applied Analysis, 2013, Article ID 183961, 7 pages","DOI":"10.1155\/2013\/183961"},{"issue":"2","key":"1205_CR12","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10589-016-9864-7","volume":"66","author":"L Chen","year":"2017","unstructured":"Chen, L., Sun, D., Toh, K.-C.: A note on the convergence of ADMM for linearly constrained convex optimization problems. Comput. Optim. Appl. 66(2), 327\u2013343 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1205_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-016-1007-5","volume":"161","author":"L Chen","year":"2017","unstructured":"Chen, L., Sun, D., Toh, K.-C.: An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming. Math. Program. 161(1), 237\u2013270 (2017)","journal-title":"Math. Program."},{"issue":"3","key":"1205_CR14","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1007\/s10957-016-0877-2","volume":"169","author":"Y Cui","year":"2016","unstructured":"Cui, Y., Li, X., Sun, D., Toh, K.-C.: On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions. J. Optim. Theory Appl. 169(3), 1013\u20131041 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"1205_CR15","unstructured":"Davis, D., Yin, W.: Convergence rate analysis of several splitting schemes. UCLA CAM Report, 14\u201351 (2014)"},{"issue":"2","key":"1205_CR16","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/s10915-016-0318-2","volume":"71","author":"W Deng","year":"2017","unstructured":"Deng, W., Lai, M., Peng, Z., Yin, W.: Parallel multi-block ADMM with \n                    \n                      \n                    \n                    $$o(1\/k)$$\n                    \n                      \n                        \n                          o\n                          (\n                          1\n                          \/\n                          k\n                          )\n                        \n                      \n                    \n                   convergence. J. Sci. Comput. 71(2), 712\u2013736 (2017)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"1205_CR17","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/s10915-015-0048-x","volume":"66","author":"W Deng","year":"2016","unstructured":"Deng, W., Yin, W.: On the global and linear convergence of the generalized alternating direction method of multipliers. J. Sci. Comput. 66(3), 889\u2013916 (2016)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"1205_CR18","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55(1), 293\u2013318 (1992)","journal-title":"Math. Program."},{"issue":"8","key":"1205_CR19","doi-asserted-by":"publisher","first-page":"2145","DOI":"10.1109\/TPDS.2017.2658620","volume":"28","author":"C Feng","year":"2017","unstructured":"Feng, C., Xu, H., Li, B.C.: An alternating direction method approach to cloud traffic management. IEEE Trans. Parallel Distrib. Syst. 28(8), 2145\u20132158 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1205_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2, 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"issue":"2","key":"1205_CR21","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s40305-016-0131-5","volume":"5","author":"X Gao","year":"2017","unstructured":"Gao, X., Zhang, S.: First-order algorithms for convex optimization with nonseparable objective and coupled constraints. J. Oper. Res. Soc. China 5(2), 131\u2013159 (2017)","journal-title":"J. Oper. Res. Soc. China"},{"key":"1205_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12613-4","volume-title":"Numerical Methods for Nonlinear Variational Problems","author":"R Glowinski","year":"1984","unstructured":"Glowinski, R.: Numerical Methods for Nonlinear Variational Problems. Springer, New York (1984)"},{"key":"1205_CR23","first-page":"41","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marroco, A.: Sur l\u2019approximation, par elements finis d\u2019ordre un, et la resolution, par penalisation-dualite, d\u2019une classe de problemes de dirichlet non lineares. Revue Franqaise d\u2019Automatique, Informatique et Recherche Opirationelle 9, 41\u201376 (1975)","journal-title":"Revue Franqaise d\u2019Automatique, Informatique et Recherche Opirationelle"},{"issue":"1","key":"1205_CR24","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10957-012-0003-z","volume":"155","author":"D Han","year":"2012","unstructured":"Han, D., Yuan, X.: A note on the alternating direction method of multipliers. J. Optim. Theory Appl. 155(1), 227\u2013238 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"1205_CR25","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10589-012-9510-y","volume":"54","author":"D Han","year":"2013","unstructured":"Han, D., Yuan, X., Zhang, W., Cai, X.: An ADM-based splitting method for separable convex programming. Comput. Optim. Appl. 54, 343\u2013369 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"1205_CR26","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1093\/imanum\/drt060","volume":"35","author":"B He","year":"2015","unstructured":"He, B., Tao, M., Yuan, X.: A splitting method for separable convex programming. IMA J. Numer. Anal. 35, 394\u2013426 (2015)","journal-title":"IMA J. Numer. Anal."},{"key":"1205_CR27","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/110822347","volume":"22","author":"B He","year":"2012","unstructured":"He, B., Tao, M., Yuan, X.: Alternating direction method with Gaussian back substitution for separable convex programming. SIAM J. Optim. 22, 313\u2013340 (2012)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1205_CR28","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: On the O\n                    \n                      \n                    \n                    $$(1\/n)$$\n                    \n                      \n                        \n                          (\n                          1\n                          \/\n                          n\n                          )\n                        \n                      \n                    \n                   convergence rate of the Douglas-Rachford alternating direction method. SIAM J. Numer. Anal. 50(2), 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"key":"1205_CR29","unstructured":"Hong, M., Chang, T., Wang, X., Razaviyayn, M., Ma, S., Luo, Z.: A block successive upper bound minimization method of multipliers for linearly constrained convex optimization. \n                    arXiv:1401.7079\n                    \n                   (2014)"},{"key":"1205_CR30","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10107-016-1034-2","volume":"162","author":"M Hong","year":"2017","unstructured":"Hong, M., Luo, Z.: On the linear convergence of the alternating direction method of multipliers. Math. Program. 162, 165\u2013199 (2017)","journal-title":"Math. Program."},{"issue":"1","key":"1205_CR31","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1137\/140990309","volume":"26","author":"M Hong","year":"2016","unstructured":"Hong, M., Luo, Z., Razaviyayn, M.: Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems. SIAM J. Optim. 26(1), 337\u2013364 (2016)","journal-title":"SIAM J. Optim."},{"key":"1205_CR32","unstructured":"Hong, M., Wang, X., Razaviyayn, M., Luo, Z.: Iteration complexity analysis of block coordinate descent methods. \n                    arXiv:1310.6957v2\n                    \n                   (2014)"},{"key":"1205_CR33","doi-asserted-by":"publisher","first-page":"1550024","DOI":"10.1142\/S0217595915500244","volume":"32","author":"M Li","year":"2015","unstructured":"Li, M., Sun, D., Toh, K.-C.: A convergent 3-block semi-proximal ADMM for convex minimization problems with one strongly convex block. Asia Pac. J Oper. Res. 32, 1550024 (2015)","journal-title":"Asia Pac. J Oper. Res."},{"issue":"2","key":"1205_CR34","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1137\/140999025","volume":"26","author":"M Li","year":"2016","unstructured":"Li, M., Sun, D., Toh, K.-C.: A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization. SIAM J. Optim. 26(2), 922\u2013950 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1205_CR35","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10107-014-0850-5","volume":"155","author":"X Li","year":"2016","unstructured":"Li, X., Sun, D., Toh, K.-C.: A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions. Math. Program. 155(1), 333\u2013373 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"1205_CR36","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/s10915-016-0182-0","volume":"69","author":"T Lin","year":"2016","unstructured":"Lin, T., Ma, S., Zhang, S.: Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity. J. Sci. Comput. 69(1), 52\u201381 (2016)","journal-title":"J. Sci. Comput."},{"key":"1205_CR37","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1137\/140971178","volume":"25","author":"T Lin","year":"2015","unstructured":"Lin, T., Ma, S., Zhang, S.: On the global linear convergence of the ADMM with multi-block variables. SIAM J. Optim. 25, 1478\u20131497 (2015)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1205_CR38","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s40305-015-0092-0","volume":"3","author":"T Lin","year":"2015","unstructured":"Lin, T., Ma, S., Zhang, S.: On the sublinear convergence rate of multi-block ADMM. J. Oper. Res. Soc. China 3(3), 251\u2013274 (2015)","journal-title":"J. Oper. Res. Soc. China"},{"key":"1205_CR39","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s10107-014-0800-2","volume":"152","author":"Z Lu","year":"2015","unstructured":"Lu, Z., Xiao, L.: On the complexity analysis of randomized block-coordinate descent methods. Math. Program. 152, 615\u2013642 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"1205_CR40","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1137\/110849468","volume":"23","author":"R Monteiro","year":"2013","unstructured":"Monteiro, R., Svaiter, B.: Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers. SIAM J. Optim. 23(1), 475\u2013507 (2013)","journal-title":"SIAM J. Optim."},{"issue":"7","key":"1205_CR41","doi-asserted-by":"publisher","first-page":"2004","DOI":"10.1109\/TAC.2014.2365686","volume":"60","author":"JFC Mota","year":"2015","unstructured":"Mota, J.F.C., Xavier, J.M.F., Aguiar, P.M.F., Puschel, M.: Distributed optimization with local domains: Applications in MPC and network flows. IEEE Trans. Autom. Control 60(7), 2004\u20132009 (2015)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1205_CR42","doi-asserted-by":"publisher","first-page":"2233","DOI":"10.1109\/TPAMI.2011.282","volume":"34","author":"YG Peng","year":"2012","unstructured":"Peng, Y.G., Ganesh, A., Wright, J., Xu, W.L., Ma, Y.: Robust alignment by sparse and low-rank decomposition for linearly correlated images. IEEE Trans. Pattern Anal. Mach. Intell. 34, 2233\u20132246 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"1205_CR43","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1137\/120891009","volume":"23","author":"M Razaviyayn","year":"2013","unstructured":"Razaviyayn, M., Hong, M., Luo, Z.: A unified convergence analysis of block successive minimization methods for nonsmooth optimization. SIAM J. Optim. 23(2), 1126\u20131153 (2013)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1205_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richt\u00e1rik","year":"2014","unstructured":"Richt\u00e1rik, P., Tak\u00e1c\u0306, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math. Program. 144(2), 1\u201338 (2014)","journal-title":"Math. Program."},{"key":"1205_CR45","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz, S., Zhang, T.: Stochastic dual coordinate ascent methods for regularized loss. J. Mach. Learn. Res. 14, 567\u2013599 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1205_CR46","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."},{"issue":"2","key":"1205_CR47","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/140964357","volume":"25","author":"D Sun","year":"2015","unstructured":"Sun, D., Toh, K.-C., Yang, L.: A convergent 3-block semi-proximal alternating direction method of multipliers for conic programming with 4-block constraints. SIAM J. Optim. 25(2), 882\u2013915 (2015)","journal-title":"SIAM J. Optim."},{"key":"1205_CR48","unstructured":"Sun, R., Luo, Z., Ye, Y.: On the expected convergence of randomly permuted ADMM. \n                    arXiv:1503.06387v1\n                    \n                   (2015)"},{"key":"1205_CR49","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P Tseng","year":"2001","unstructured":"Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109, 475\u2013494 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"1205_CR50","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117, 387\u2013423 (2009)","journal-title":"Math. Program."},{"issue":"1","key":"1205_CR51","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"S Wright","year":"2015","unstructured":"Wright, S.: Coordinate descent algorithms. Math. Program. 151(1), 3\u201334 (2015)","journal-title":"Math. Program."},{"key":"1205_CR52","unstructured":"Zhang Y (2010) Convergence of a class of stationary iterative methods for saddle point problems. Rice University Technique Report, TR10-24"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1205-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1205-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1205-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T13:13:54Z","timestamp":1576847634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1205-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,8]]},"references-count":52,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["1205"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1205-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,8]]},"assertion":[{"value":"27 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}