{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:45:29Z","timestamp":1761745529709,"version":"3.37.3"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T00:00:00Z","timestamp":1633392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T00:00:00Z","timestamp":1633392000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12001367","12071306"],"award-info":[{"award-number":["12001367","12071306"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871347"],"award-info":[{"award-number":["11871347"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2019A1515011917"],"award-info":[{"award-number":["2019A1515011917"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Shenzhen","award":["JCYJ20190808173603590"],"award-info":[{"award-number":["JCYJ20190808173603590"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10898-021-01093-0","type":"journal-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T16:55:25Z","timestamp":1633452925000},"page":"717-748","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Nonconvex and Nonsmooth Sparse Optimization via Adaptively Iterative Reweighted Methods"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8821-7260","authenticated-orcid":false,"given":"Hao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yuanming","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Yaohua","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,5]]},"reference":[{"issue":"1","key":"1093_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/TSP.2013.2287685","volume":"62","author":"D Ba","year":"2014","unstructured":"Ba, D., Babadi, B., Purdon, P.L., Brown, E.N.: Convergence and stability of iteratively re-weighted least squares algorithms. IEEE Trans. Signal Process. 62(1), 183\u2013195 (2014)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"1093_CR2","first-page":"1","volume":"4","author":"F Bach","year":"2012","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G., et al.: Optimization with sparsity-inducing penalties. Foundations and Trends\u00ae. Mach. Learn. 4(1), 1\u2013106 (2012)","journal-title":"Mach. Learn."},{"issue":"4","key":"1093_CR3","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF00934938","volume":"13","author":"MS Bazaraa","year":"1974","unstructured":"Bazaraa, M.S., Goode, J., Nashed, M.Z.: On the cones of tangents with applications to mathematical programming. J. Optim. Theory Appl. 13(4), 389\u2013426 (1974)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"1093_CR4","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1287\/moor.2016.0837","volume":"42","author":"W Bian","year":"2017","unstructured":"Bian, W., Chen, X.: Optimality and complexity for constrained optimization problems with nonconvex regularization. Math. Oper. Res. 42(4), 1063\u20131084 (2017)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1093_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/ijoc.10.2.209","volume":"10","author":"PS Bradley","year":"1998","unstructured":"Bradley, P.S., Mangasarian, O.L., Street, W.N.: Feature selection via mathematical programming. INFORMS J. Comput. 10(2), 209\u2013217 (1998)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"1093_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1137\/130950239","volume":"25","author":"JV Burke","year":"2015","unstructured":"Burke, J.V., Curtis, F.E., Wang, H., Wang, J.: Iterative reweighted linear least squares for exact penalty subproblems on product sets. SIAM J. Optim. 25(1), 261\u2013294 (2015)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1093_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/MSP.2007.914731","volume":"25","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Wakin, M.B.: An introduction to compressive sampling. IEEE Signal Process. Mag. 25(2), 21\u201330 (2008)","journal-title":"IEEE Signal Process. Mag."},{"issue":"5\u20136","key":"1093_CR8","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Candes","year":"2008","unstructured":"Candes, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted 1 minimization. J. Fourier Anal. Appl. 14(5\u20136), 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"1093_CR9","doi-asserted-by":"crossref","unstructured":"Chartrand, R., Yin, W.: Iteratively reweighted algorithms for compressive sensing. In: Acoustics, speech and signal processing, 2008. ICASSP 2008. IEEE international conference on, pp. 3869\u20133872. IEEE (2008)","DOI":"10.1109\/ICASSP.2008.4518498"},{"key":"1093_CR10","volume-title":"Convergence of Reweighted l1 Minimization Algorithms and Unique Solution of Truncated lp Minimization","author":"X Chen","year":"2010","unstructured":"Chen, X., Zhou, W.: Convergence of Reweighted l1 Minimization Algorithms and Unique Solution of Truncated lp Minimization. The Hong Kong Polytechnic University, Department of Applied Mathematics (2010)"},{"issue":"1","key":"1093_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/cpa.20303","volume":"63","author":"I Daubechies","year":"2010","unstructured":"Daubechies, I., DeVore, R., Fornasier, M., G\u00fcnt\u00fcrk, C.S.: Iteratively reweighted least squares minimization for sparse recovery. Commun. Pure Appl. Math. 63(1), 1\u201338 (2010)","journal-title":"Commun. Pure Appl. Math."},{"issue":"456","key":"1093_CR12","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."},{"key":"1093_CR13","doi-asserted-by":"crossref","unstructured":"Fazel, M., Hindi, H., Boyd, S.P.: Log-det heuristic for matrix rank minimization with applications to hankel and euclidean distance matrices. In: American control conference, 2003. Proceedings of the 2003, vol.\u00a03, pp. 2156\u20132162. IEEE (2003)","DOI":"10.1109\/ACC.2003.1243393"},{"key":"1093_CR14","unstructured":"Grant, M., Boyd, S., Ye, Y.: CVX: Matlab software for disciplined convex programming (2008). (Web page and software.) http:\/\/stanford.edu\/~boyd\/cvx (2015)"},{"key":"1093_CR15","doi-asserted-by":"crossref","unstructured":"Harrell, F.E.: Ordinal logistic regression. In: Regression modeling strategies, pp. 311\u2013325. Springer (2015)","DOI":"10.1007\/978-3-319-19425-7_13"},{"key":"1093_CR16","doi-asserted-by":"publisher","DOI":"10.1201\/b18401","volume-title":"Statistical Learning with Sparsity: The Lasso and Generalizations","author":"T Hastie","year":"2015","unstructured":"Hastie, T., Tibshirani, R., Wainwright, M.: Statistical Learning with Sparsity: The Lasso and Generalizations. CRC Press, Boca Raton (2015)"},{"issue":"9","key":"1093_CR17","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1080\/03610927708827533","volume":"6","author":"PW Holland","year":"1977","unstructured":"Holland, P.W., Welsch, R.E.: Robust regression using iteratively reweighted least-squares. Commun. Stat. Theory Methods 6(9), 813\u2013827 (1977)","journal-title":"Commun. Stat. Theory Methods"},{"issue":"1","key":"1093_CR18","first-page":"960","volume":"18","author":"Y Hu","year":"2017","unstructured":"Hu, Y., Li, C., Meng, K., Qin, J., Yang, X.: Group sparse optimization via $$\\ell _{p, q}$$ regularization. J. Mach. Learn. Res. 18(1), 960\u20131011 (2017)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1093_CR19","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1109\/TSP.2010.2082536","volume":"59","author":"MA Khajehnejad","year":"2011","unstructured":"Khajehnejad, M.A., Dimakis, A.G., Xu, W., Hassibi, B.: Sparse recovery of nonnegative signals with minimal expansion. IEEE Trans. Signal Process. 59(1), 196\u2013208 (2011)","journal-title":"IEEE Trans. Signal Process."},{"key":"1093_CR20","unstructured":"Kruger, A.Y.: $$\\varepsilon $$-semidifferentials and $$\\varepsilon $$-normal elements. Depon. VINITI 1331,(1981)"},{"issue":"3","key":"1093_CR21","doi-asserted-by":"publisher","first-page":"3325","DOI":"10.1023\/A:1023673105317","volume":"116","author":"AY Kruger","year":"2003","unstructured":"Kruger, A.Y.: On fr\u00e9chet subdifferentials. J. Math. Sci. 116(3), 3325\u20133358 (2003)","journal-title":"J. Math. Sci."},{"issue":"1","key":"1093_CR22","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1137\/090775397","volume":"21","author":"MJ Lai","year":"2011","unstructured":"Lai, M.J., Wang, J.: An unconstrained $$\\ell _q$$ minimization with $$0\\le q \\le 1$$ for sparse solution of underdetermined linear systems. SIAM J. Optim. 21(1), 82\u2013101 (2011)","journal-title":"SIAM J. Optim."},{"key":"1093_CR23","doi-asserted-by":"crossref","unstructured":"Lanza, A., Morigi, S., Sgallari, F.: Convex image denoising via non-convex regularization. In: International Conference on Scale Space and Variational Methods in Computer Vision. Springer , pp. 666\u2013677 (2015)","DOI":"10.1007\/978-3-319-18461-6_53"},{"issue":"5","key":"1093_CR24","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TSP.2012.2236830","volume":"61","author":"Q Ling","year":"2013","unstructured":"Ling, Q., Wen, Z., Yin, W.: Decentralized jointly sparse optimization by reweighted $$\\ell _q$$ minimization. IEEE Trans. Signal Process. 61(5), 1165\u20131170 (2013)","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"1093_CR25","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/MSP.2018.2844952","volume":"35","author":"L Liu","year":"2018","unstructured":"Liu, L., Larsson, E.G., Yu, W., Popovski, P., Stefanovic, C., de Carvalho, E.: Sparse signal processing for grant-free massive connectivity: a future paradigm for random access protocols in the internet of things. IEEE Signal Process. Mag. 35(5), 88\u201399 (2018)","journal-title":"IEEE Signal Process. Mag."},{"issue":"1","key":"1093_CR26","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10479-006-0145-1","volume":"152","author":"MS Lobo","year":"2007","unstructured":"Lobo, M.S., Fazel, M., Boyd, S.: Portfolio optimization with linear and fixed transaction costs. Ann. Oper. Res. 152(1), 341\u2013365 (2007)","journal-title":"Ann. Oper. Res."},{"key":"1093_CR27","doi-asserted-by":"crossref","unstructured":"Lu, C., Wei, Y., Lin, Z., Yan, S.: Proximal iteratively reweighted algorithm with multiple splitting for nonconvex sparsity optimization. In: AAAI, pp. 1251\u20131257 (2014)","DOI":"10.1609\/aaai.v28i1.8897"},{"issue":"1\u20132","key":"1093_CR28","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10107-013-0722-4","volume":"147","author":"Z Lu","year":"2014","unstructured":"Lu, Z.: Iterative reweighted minimization methods for $$\\ell _p$$ regularized unconstrained nonlinear programming. Math. Program. 147(1\u20132), 277\u2013307 (2014)","journal-title":"Math. Program."},{"issue":"3","key":"1093_CR29","doi-asserted-by":"publisher","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(3), 619\u2013642 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"20","key":"1093_CR30","doi-asserted-by":"publisher","first-page":"5213","DOI":"10.1109\/TSP.2014.2340820","volume":"62","author":"M Malek-Mohammadi","year":"2014","unstructured":"Malek-Mohammadi, M., Babaie-Zadeh, M., Skoglund, M.: Iterative concave rank approximation for recovering low-rank matrices. IEEE Trans. Signal Process. 62(20), 5213\u20135226 (2014)","journal-title":"IEEE Trans. Signal Process."},{"issue":"6","key":"1093_CR31","doi-asserted-by":"publisher","first-page":"2424","DOI":"10.1109\/TSP.2009.2016889","volume":"57","author":"CJ Miosso","year":"2009","unstructured":"Miosso, C.J., von Borries, R., Argaez, M., Vel\u00e1zquez, L., Quintero, C., Potes, C.: Compressive sensing reconstruction with prior information by iteratively reweighted least-squares. IEEE Trans. Signal Process. 57(6), 2424\u20132431 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"1093_CR32","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1137\/140971518","volume":"8","author":"P Ochs","year":"2015","unstructured":"Ochs, P., Dosovitskiy, A., Brox, T., Pock, T.: On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision. SIAM J. Imaging Sci. 8(1), 331\u2013372 (2015)","journal-title":"SIAM J. Imaging Sci."},{"key":"1093_CR33","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"JM Ortega","year":"1970","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Siam, New Delhi (1970)"},{"issue":"3","key":"1093_CR34","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/MSP.2018.2789521","volume":"35","author":"Z Qin","year":"2018","unstructured":"Qin, Z., Fan, J., Liu, Y., Gao, Y., Li, G.Y.: Sparse representation for wireless communications: a compressive sensing approach. IEEE Signal Process. Mag. 35(3), 40\u201358 (2018)","journal-title":"IEEE Signal Process. Mag."},{"key":"1093_CR35","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, vol. 317. Springer Science & Business Media, New York (2009)"},{"issue":"4","key":"1093_CR36","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1109\/JSAC.2016.2544578","volume":"34","author":"Y Shi","year":"2016","unstructured":"Shi, Y., Cheng, J., Zhang, J., Bai, B., Chen, W., Letaief, K.B.: Smoothed $$l_p$$-minimization for green cloud-ran with user admission control. IEEE J. Sel. Areas Commun. 34(4), 1022\u20131036 (2016)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"6","key":"1093_CR37","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/MCOM.2018.1700472","volume":"56","author":"Y Shi","year":"2018","unstructured":"Shi, Y., Zhang, J., Chen, W., Letaief, K.B.: Generalized sparse and low-rank optimization for ultra-dense networks. IEEE Commun. Mag. 56(6), 42\u201348 (2018)","journal-title":"IEEE Commun. Mag."},{"issue":"5","key":"1093_CR38","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1109\/TWC.2014.040214.131770","volume":"13","author":"Y Shi","year":"2014","unstructured":"Shi, Y., Zhang, J., Letaief, K.B.: Group sparse beamforming for green cloud-ran. IEEE Trans. Wirel. Commun. 13(5), 2809\u20132823 (2014)","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"2","key":"1093_CR39","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1080\/00031305.1988.10475548","volume":"42","author":"JO Street","year":"1988","unstructured":"Street, J.O., Carroll, R.J., Ruppert, D.: A note on computing robust regression estimates via iteratively reweighted least squares. Am. Stat. 42(2), 152\u2013154 (1988)","journal-title":"Am. Stat."},{"key":"1093_CR40","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1146\/annurev-statistics-022513-115643","volume":"1","author":"MJ Wainwright","year":"2014","unstructured":"Wainwright, M.J.: Structured regularizers for high-dimensional problems: statistical and computational issues. Annu. Rev. Stat. Appl. 1, 233\u2013253 (2014)","journal-title":"Annu. Rev. Stat. Appl."},{"issue":"10","key":"1093_CR41","doi-asserted-by":"publisher","first-page":"2183","DOI":"10.1080\/02331934.2014.929678","volume":"64","author":"H Wang","year":"2015","unstructured":"Wang, H., Li, D.H., Zhang, X.J., Wu, L.: Optimality conditions for the constrained $$ \\ell _p $$-regularization. Optimization 64(10), 2183\u20132197 (2015)","journal-title":"Optimization"},{"key":"1093_CR42","first-page":"1439","volume":"3","author":"J Weston","year":"2003","unstructured":"Weston, J., Elisseeff, A., Sch\u00f6lkopf, B., Tipping, M.: Use of the zero-norm with linear models and kernel methods. J. Mach. Learn. Res. 3, 1439\u20131461 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"1093_CR43","volume-title":"Department of Statistics and Bioinformatics","author":"CH Zhang","year":"2007","unstructured":"Zhang, C.H.: Penalized linear unbiased selection. In: Department of Statistics and Bioinformatics. Rutgers University, New Jersey (2007)"},{"issue":"2","key":"1093_CR44","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"MJ Lai","year":"2013","unstructured":"Lai, M.J., Xu, Y.Y., Yin, W.T.: Improved iteratively reweighted least squares for unconstrained smoothed $$ell\\_q$$ minimization. SIAM J. Numer. Anal. 51(2), 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"1093_CR45","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10107-018-1327-8","volume":"176","author":"T Liu","year":"2019","unstructured":"Liu, T., Pong, T.K., Takeda, A.: A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems. Math. Program. 176(1), 339\u2013367 (2019)","journal-title":"Math. Program."},{"issue":"1","key":"1093_CR46","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jvcir.2012.10.006","volume":"24","author":"WF Cao","year":"2013","unstructured":"Cao, W.F., Sun, J., Xu, Z.B.: Fast image deconvolution using closed-form thresholding formulas of $$L_q$$ ($$q= 1\/2, 2\/3$$) regularization. J. Vis. Commun. Image Represent. 24(1), 31\u201341 (2013)","journal-title":"J. Vis. Commun. Image Represent."},{"issue":"3","key":"1093_CR47","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1137\/16M1084754","volume":"27","author":"MJ Ahn","year":"2017","unstructured":"Ahn, M.J., 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":"07130","key":"1093_CR48","first-page":"31","volume":"1812","author":"SS Cao","year":"2018","unstructured":"Cao, S.S., Huo, X.M., Pang, J.S.: A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC). Regularizations 1812(07130), 31\u201341 (2018). arXiv:1812.07130","journal-title":"Regularizations"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01093-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01093-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01093-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:07:29Z","timestamp":1725876449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01093-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,5]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["1093"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01093-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,10,5]]},"assertion":[{"value":"31 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}