{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T19:15:11Z","timestamp":1784747711770,"version":"3.55.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,3,5]],"date-time":"2018-03-05T00:00:00Z","timestamp":1520208000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation","doi-asserted-by":"crossref","award":["0928427"],"award-info":[{"award-number":["0928427"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation","doi-asserted-by":"crossref","award":["1222507"],"award-info":[{"award-number":["1222507"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation","doi-asserted-by":"crossref","award":["1522383"],"award-info":[{"award-number":["1522383"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s10107-018-1236-x","type":"journal-article","created":{"date-parts":[[2018,3,5]],"date-time":"2018-03-05T11:34:23Z","timestamp":1520249663000},"page":"307-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":112,"title":["Minimization of transformed $$L_1$$ L 1 penalty: theory, difference of convex function algorithm, and robust application in compressed sensing"],"prefix":"10.1007","volume":"169","author":[{"given":"Shuai","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jack","family":"Xin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,3,5]]},"reference":[{"issue":"3","key":"1236_CR1","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1137\/16M1084754","volume":"27","author":"M Ahn","year":"2017","unstructured":"Ahn, M., Pang, J.-S., Xin, J.: Difference-of-convex learning: directional stationarity, optimality, and sparsity. SIAM J. Optim. 27(3), 1637\u20131665 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1236_CR2","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":"12","key":"1236_CR3","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"E Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1236_CR4","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E., Rudelson, M., Tao, T., Vershynin, R.: Error correction via linear programming, In: 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 668\u2013681 (2005)","DOI":"10.1109\/SFCS.2005.5464411"},{"issue":"2","key":"1236_CR5","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete Fourier information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1236_CR6","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., Romberg, J., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. 59(8), 1207\u20131223 (2006)","journal-title":"Commun. Pure Appl. Math."},{"issue":"6","key":"1236_CR7","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1007\/s00041-013-9292-3","volume":"19","author":"E Cand\u00e8s","year":"2013","unstructured":"Cand\u00e8s, E., Fernandez-Granda, C.: Super-resolution from noisy data. J. Fourier Anal. Appl. 19(6), 1229\u20131254 (2013)","journal-title":"J. Fourier Anal. Appl."},{"issue":"1","key":"1236_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jvcir.2012.10.006","volume":"24","author":"W Cao","year":"2013","unstructured":"Cao, W., Sun, J., Xu, Z.: Fast image deconvolution using closed-form thresholding formulas of regularization. J. Vis. Commun. Image Represent. 24(1), 31\u201341 (2013)","journal-title":"J. Vis. Commun. Image Represent."},{"key":"1236_CR9","first-page":"III 889","volume":"3","author":"R Chartrand","year":"2007","unstructured":"Chartrand, R.: Nonconvex compressed sensing and error correction. ICASSP 3, III 889 (2007)","journal-title":"ICASSP"},{"key":"1236_CR10","doi-asserted-by":"crossref","unstructured":"Chartrand, R., Yin, W.: Iteratively reweighted algorithms for compressive sensing. In: ICASSP pp. 3869\u20133872 (2008)","DOI":"10.1109\/ICASSP.2008.4518498"},{"key":"1236_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1090\/S0894-0347-08-00610-3","volume":"22","author":"A Cohen","year":"2009","unstructured":"Cohen, A., Dahmen, W., DeVore, R.: Compressed sensing and the best k-term approximation. J. Am. Math. Soc. 22, 211\u2013231 (2009)","journal-title":"J. Am. Math. Soc."},{"issue":"4","key":"1236_CR12","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D Donoho","year":"2006","unstructured":"Donoho, D.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1236_CR13","doi-asserted-by":"publisher","first-page":"2197","DOI":"10.1073\/pnas.0437847100","volume":"100","author":"D Donoho","year":"2003","unstructured":"Donoho, D., Elad, M.: Optimally sparse representation in general (nonorthogonal) dictionaries via $$\\ell _1$$ \u2113 1 minimization. Proc. Natl. Acad. Sci. USA 100, 2197\u20132202 (2003)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"1236_CR14","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1137\/13090540X","volume":"6","author":"E Esser","year":"2013","unstructured":"Esser, E., Lou, Y., Xin, J.: A method for finding structured sparse solutions to non-negative least squares problems with applications. SIAM J. Imaging Sci. 6, 2010\u20132046 (2013)","journal-title":"SIAM J. Imaging Sci."},{"issue":"456","key":"1236_CR15","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"1236_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1137\/110838509","volume":"5","author":"A Fannjiang","year":"2012","unstructured":"Fannjiang, A., Liao, W.: Coherence pattern\u2013guided compressive sensing with unresolved grids. SIAM J. Imaging Sci. 5(1), 179\u2013202 (2012)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"1236_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/080725891","volume":"2","author":"T Goldstein","year":"2009","unstructured":"Goldstein, T., Osher, S.: The split Bregman method for $$\\ell _1$$ \u2113 1 -regularized problems. SIAM J. Imaging Sci. 2(1), 323\u2013343 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"1236_CR18","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"M Lai","year":"2013","unstructured":"Lai, M., Xu, Y., Yin, W.: Improved iteratively reweighted least squares for unconstrained smoothed $$\\ell _q$$ \u2113 q minimization. SIAM J. Numer. Anal. 51(2), 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"key":"1236_CR19","doi-asserted-by":"crossref","unstructured":"Le Thi, H.A., Thi, B.T.N., Le, H.M.: Sparse signal recovery by difference of convex functions algorithms. In: Selamat, A., Nguyen, N.T., Haron, H. (eds.) Intelligent Information and Database Systems, pp. 387\u2013397. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-36543-0_40"},{"key":"1236_CR20","doi-asserted-by":"crossref","unstructured":"Le Thi, H.A., Huynh, V.N., Dinh, T.: DC programming and DCA for general DC programs. In: Do, T.V., Le Thi, H.A. Nguyen, N.T. (eds.) Advanced Computational Methods for Knowledge Engineering, pp. 15\u201335. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-06569-4_2"},{"issue":"1","key":"1236_CR21","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ejor.2014.11.031","volume":"244","author":"HA Thi Le","year":"2015","unstructured":"Le Thi, H.A., Pham Dinh, T., Le, H.M., Vo, X.T.: DC approximation approaches for sparse optimization. Eur. J. Oper. Res. 244(1), 26\u201346 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1236_CR22","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1007\/s10915-016-0169-x","volume":"68","author":"Y Lou","year":"2016","unstructured":"Lou, Y., Yin, P., Xin, J.: Point source super-resolution via non-convex L1 based methods. J. Sci. Comput. 68(3), 1082\u20131100 (2016)","journal-title":"J. Sci. Comput."},{"key":"1236_CR23","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/s10915-014-9930-1","volume":"64","author":"Y Lou","year":"2015","unstructured":"Lou, Y., Yin, P., He, Q., Xin, J.: Computing sparse representation in a highly coherent dictionary based on difference of L1 and L2. J. Sci. Comput. 64, 178\u2013196 (2015)","journal-title":"J. Sci. Comput."},{"issue":"4","key":"1236_CR24","doi-asserted-by":"publisher","first-page":"2448","DOI":"10.1137\/100808071","volume":"23","author":"Z Lu","year":"2013","unstructured":"Lu, Z., Zhang, Y.: Sparse approximation via penalty decomposition methods. SIAM J. Optim. 23(4), 2448\u20132478 (2013)","journal-title":"SIAM J. Optim."},{"issue":"6A","key":"1236_CR25","doi-asserted-by":"publisher","first-page":"3498","DOI":"10.1214\/09-AOS683","volume":"37","author":"J Lv","year":"2009","unstructured":"Lv, J., Fan, Y.: A unified approach to model selection and sparse recovery using regularized least squares. Ann. Stat. 37(6A), 3498\u20133528 (2009)","journal-title":"Ann. Stat."},{"issue":"12","key":"1236_CR26","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"S Mallat","year":"1993","unstructured":"Mallat, S., Zhang, Z.: Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Process. 41(12), 3397\u20133415 (1993)","journal-title":"IEEE Trans. Signal Process."},{"issue":"495","key":"1236_CR27","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1198\/jasa.2011.tm09738","volume":"106","author":"R Mazumder","year":"2011","unstructured":"Mazumder, R., Friedman, J., Hastie, T.: SparseNet: coordinate descent with nonconvex penalties. J. Am. Stat. Assoc. 106(495), 1125\u20131138 (2011)","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"1236_CR28","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"B Natarajan","year":"1995","unstructured":"Natarajan, B.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1236_CR29","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/JSTSP.2010.2042412","volume":"4","author":"D Needell","year":"2010","unstructured":"Needell, D., Vershynin, R.: Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit. IEEE J. Sel. Top. Signal Process. 4(2), 310\u2013316 (2010)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"1236_CR30","doi-asserted-by":"crossref","unstructured":"Nguyen, T.B.T., Le Thi, H.A., Le, H.M., Vo, X.T.: DC approximation approach for $$\\ell _0$$ \u2113 0 -minimization in compressed sensing. In: Do, T.V., Le Thi, H.A. , Nguyen N.T. ( eds.) Advanced Computational Methods for Knowledge Engineering, pp. 37\u201348. Springer, Berlin (2015)","DOI":"10.1007\/978-3-319-17996-4_4"},{"issue":"2","key":"1236_CR31","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1137\/S0036139997327794","volume":"61","author":"M Nikolova","year":"2000","unstructured":"Nikolova, M.: Local strong homogeneity of a regularized estimator. SIAM J. Appl. Math. 61(2), 633\u2013658 (2000)","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"1236_CR32","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1080\/10556788.2011.652630","volume":"28","author":"CS Ong","year":"2013","unstructured":"Ong, C.S., Le Thi, H.A.: Learning sparse classifiers with difference of convex functions algorithms. Optim. Methods Softw. 28(4), 830\u2013854 (2013)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1236_CR33","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, A.: Convex analysis approach to d.c. programming: theory, algorithms and applications. Acta Math. Vietnam. 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"issue":"2","key":"1236_CR34","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T Pham Dinh","year":"1998","unstructured":"Pham Dinh, T., Le Thi, H.A.: A DC optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8(2), 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1236_CR35","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/151003714","volume":"8","author":"E Soubies","year":"2015","unstructured":"Soubies, E., Blanc-F\u00e9raud, L., Aubert, G.: A continuous exact $$\\ell _0$$ \u2113 0 penalty (CEL0) for least squares regularized problem. SIAM J. Imaging Sci. 8(3), 1607\u20131639 (2015)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"1236_CR36","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc."},{"key":"1236_CR37","unstructured":"Tran, H., Webster, C.: Unified sufficient conditions for uniform recovery of sparse signals via nonconvex minimizations. arXiv:1701.07348 . 19 Oct 2017"},{"issue":"12","key":"1236_CR38","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"J Tropp","year":"2007","unstructured":"Tropp, J., Gilbert, A.: Signal recovery from partial information via orthogonal matching pursuit. IEEE Trans. Inf. Theory 53(12), 4655\u20134666 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1236_CR39","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1016\/j.sigpro.2012.10.019","volume":"93","author":"F Xu","year":"2013","unstructured":"Xu, F., Wang, S.: A hybrid simulated annealing thresholding algorithm for compressed sensing. Signal Process. 93, 1577\u20131585 (2013)","journal-title":"Signal Process."},{"issue":"7","key":"1236_CR40","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"Z Xu","year":"2012","unstructured":"Xu, Z., Chang, X., Xu, F., Zhang, H.: $$L_{1\/2}$$ L 1 \/ 2 regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neural Netw. Learn. Syst. 23(7), 1013\u20131027 (2012)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"1","key":"1236_CR41","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"Yang, J., Zhang, Y.: Alternating direction algorithms for $$l_1$$ l 1 problems in compressive sensing. SIAM J. Sci. Comput. 33(1), 250\u2013278 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1236_CR42","doi-asserted-by":"publisher","first-page":"A536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of $$\\ell _{1-2}$$ \u2113 1 - 2 for compressed sensing. SIAM J. Sci. Comput. 37(1), A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"1236_CR43","doi-asserted-by":"publisher","first-page":"437","DOI":"10.4208\/jcm.1610-m2016-0620","volume":"35","author":"P Yin","year":"2017","unstructured":"Yin, P., Xin, J.: Iterative $$\\ell _1$$ \u2113 1 minimization for non-convex compressed sensing. J. Comput. Math. 35(4), 437\u2013449 (2017)","journal-title":"J. Comput. Math."},{"issue":"1","key":"1236_CR44","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/070703983","volume":"1","author":"W Yin","year":"2008","unstructured":"Yin, W., Osher, S., Goldfarb, D., Darbon, J.: Bregman iterative algorithms for $$l_1$$ l 1 -minimization with applications to compressed sensing. SIAM J. Imaging Sci. 1(1), 143\u2013168 (2008)","journal-title":"SIAM J. Imaging Sci."},{"issue":"9","key":"1236_CR45","doi-asserted-by":"publisher","first-page":"2317","DOI":"10.1109\/TSP.2014.2309076","volume":"62","author":"J Zeng","year":"2014","unstructured":"Zeng, J., Lin, S., Wang, Y., Xu, Z.: $$L_{1\/2}$$ L 1 \/ 2 regularization: convergence of iterative half thresholding algorithm. IEEE Trans. Signal Process. 62(9), 2317\u20132329 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"1236_CR46","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"C Zhang","year":"2010","unstructured":"Zhang, C.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38, 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"issue":"2","key":"1236_CR47","doi-asserted-by":"publisher","first-page":"511","DOI":"10.4310\/CMS.2017.v15.n2.a9","volume":"15","author":"S Zhang","year":"2017","unstructured":"Zhang, S., Xin, J.: Minimization of transformed $$L_1$$ L 1 penalty: closed form representation and iterative thresholding algorithms. Commun. Math. Sci. 15(2), 511\u2013537 (2017)","journal-title":"Commun. Math. Sci."},{"issue":"3","key":"1236_CR48","doi-asserted-by":"publisher","first-page":"839","DOI":"10.4310\/CMS.2017.v15.n3.a12","volume":"15","author":"S Zhang","year":"2017","unstructured":"Zhang, S., Yin, P., Xin, J.: Transformed Schatten-1 Iterative thresholding algorithms for low rank matrix completion. Commun. Math. Sci. 15(3), 839\u2013862 (2017)","journal-title":"Commun. Math. Sci."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1236-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1236-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1236-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T19:00:17Z","timestamp":1720119617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1236-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,5]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["1236"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1236-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,5]]},"assertion":[{"value":"23 February 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}