{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:30Z","timestamp":1740122670423,"version":"3.37.3"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T00:00:00Z","timestamp":1666915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T00:00:00Z","timestamp":1666915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10589-022-00425-4","type":"journal-article","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T17:05:26Z","timestamp":1666976726000},"page":"363-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Inexact gradient projection method with relative error tolerance"],"prefix":"10.1007","volume":"84","author":[{"given":"A. A.","family":"Aguiar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5758-0320","authenticated-orcid":false,"given":"O. P.","family":"Ferreira","sequence":"additional","affiliation":[]},{"given":"L. F.","family":"Prudente","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,28]]},"reference":[{"key":"425_CR1","doi-asserted-by":"crossref","unstructured":"Aguiar, A.A., Ferreira, O.P., Prudente, L.F.: Subgradient method with feasible inexact projections for constrained convex optimization problems. arXiv:2006.08770, (June 2020)","DOI":"10.1080\/02331934.2021.1902520"},{"key":"425_CR2","unstructured":"Allen-Zhu, Z., Hazan, E., Hu, W., Li, Y.: Linear convergence of a Frank-Wolfe type algorithm over trace-norm balls. In: Advances in Neural Information Processing Systems, pp. 6191\u20136200, (2017)"},{"key":"425_CR3","doi-asserted-by":"crossref","unstructured":"Beck, A.: Introduction to nonlinear optimization, volume\u00a019 of MOS-SIAM Series on Optimization. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA; Mathematical Optimization Society, Philadelphia, PA, (2014). Theory, algorithms, and applications with MATLAB","DOI":"10.1137\/1.9781611973655"},{"issue":"9","key":"425_CR4","doi-asserted-by":"publisher","first-page":"2917","DOI":"10.1016\/j.na.2010.06.051","volume":"73","author":"JYB Cruz","year":"2010","unstructured":"Cruz, J.Y.B., P\u00e9rez, L.R.L.: Convergence of a projected gradient method variant for quasiconvex objectives. Nonlinear Anal. 73(9), 2917\u20132922 (2010)","journal-title":"Nonlinear Anal."},{"issue":"2","key":"425_CR5","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TAC.1976.1101194","volume":"AC\u201321","author":"DP Bertsekas","year":"1976","unstructured":"Bertsekas, D.P.: On the Goldstein\u2013Levitin\u2013Polyak gradient projection method. IEEE Trans. Autom. Control AC\u201321(2), 174\u2013184 (1976)","journal-title":"IEEE Trans. Autom. Control"},{"key":"425_CR6","series-title":"Athena Scientific Optimization and Computation Series","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific Optimization and Computation Series, 2nd edn. Athena Scientific, Belmont, MA (1999)","edition":"2"},{"issue":"4","key":"425_CR7","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10(4), 1196\u20131211 (2000). https:\/\/doi.org\/10.1137\/S1052623497330963","journal-title":"SIAM J. Optim."},{"issue":"4","key":"425_CR8","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1093\/imanum\/23.4.539","volume":"23","author":"EG Birgin","year":"2003","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Inexact spectral projected gradient methods on convex sets. IMA J. Numer. Anal. 23(4), 539\u2013559 (2003)","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"425_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"425_CR10","doi-asserted-by":"crossref","unstructured":"Boyd, S., El\u00a0Ghaoui, L., Feron, E., Balakrishnan, V.: Linear matrix inequalities in system and control theory, volume\u00a015 of SIAM Studies in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, (1994)","DOI":"10.1137\/1.9781611970777"},{"issue":"3\u20134","key":"425_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1561\/2200000050","volume":"8","author":"S Bubeck","year":"2015","unstructured":"Bubeck, S.: Convex optimization: Algorithms and complexity. Found. Trends \u00ae Mach. Learn. 8(3\u20134), 231\u2013357 (2015)","journal-title":"Found. Trends \u00ae Mach. Learn."},{"issue":"2","key":"425_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1080\/02331939508844042","volume":"32","author":"R Burachik","year":"1995","unstructured":"Burachik, R., Drummond, L.M.G., Iusem, A.N., Svaiter, B.F.: Full convergence of the steepest descent method with inexact line searches. Optimization 32(2), 137\u2013146 (1995)","journal-title":"Optimization"},{"issue":"1","key":"425_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10589-018-0040-0","volume":"72","author":"FR de Oliveira","year":"2019","unstructured":"de Oliveira, F.R., Ferreira, O.P., Silva, G.N.: Newton\u2019s method with feasible inexact projections for solving constrained generalized equations. Comput. Optim. Appl. 72(1), 159\u2013177 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"425_CR14","unstructured":"Mill\u00e1n, R.D., Ferreira, O.P., Prudente, L.F.: Alternating conditional gradient method for convex feasibility problems. arXiv e-prints, arXiv:1912.04247, (2019)"},{"issue":"6","key":"425_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0898-1221(98)00020-0","volume":"35","author":"R Escalante","year":"1998","unstructured":"Escalante, R., Raydan, M.: Dykstra\u2019s algorithm for constrained least-squares rectangular matrix problems. Comput. Math. Appl. 35(6), 73\u201379 (1998)","journal-title":"Comput. Math. Appl."},{"issue":"2","key":"425_CR16","doi-asserted-by":"publisher","first-page":"1940008","DOI":"10.1142\/S0217595919400086","volume":"36","author":"J Fan","year":"2019","unstructured":"Fan, J., Wang, L., Yan, A.: An inexact projected gradient method for sparsity-constrained quadratic measurements regression. Asia-Pac. J. Oper. Res. 36(2), 1940008 (2019)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"1","key":"425_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10589-021-00331-1","volume":"81","author":"OP Ferreira","year":"2022","unstructured":"Ferreira, O.P., Lemes, M., Prudente, L.F.: On the inexact scaled gradient projection method. Comput. Optim. Appl. 81(1), 91\u2013125 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"425_CR18","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"MAT Figueiredo","year":"2007","unstructured":"Figueiredo, M.A.T., Nowak, R.D., Wright, S.J.: Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. IEEE J. Selected Topics Signal Process. 1(4), 586\u2013597 (2007)","journal-title":"IEEE J. Selected Topics Signal Process."},{"issue":"3","key":"425_CR19","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0902021","volume":"2","author":"R Fletcher","year":"1981","unstructured":"Fletcher, R.: A nonlinear programming problem in statistics (educational testing). SIAM J. Sci. Stat. Comput. 2(3), 257\u2013267 (1981). https:\/\/doi.org\/10.1137\/0902021","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"5","key":"425_CR20","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1080\/10556788.2018.1510928","volume":"34","author":"J Fliege","year":"2019","unstructured":"Fliege, J., Vaz, A.I.F., Vicente, L.N.: Complexity of gradient descent for multiobjective optimization. Optim. Methods Softw. 34(5), 949\u2013959 (2019)","journal-title":"Optim. Methods Softw."},{"key":"425_CR21","doi-asserted-by":"crossref","unstructured":"Fukushima, M., Luo, Z.-Q., Tseng, P.: Smoothing functions for second-order-cone complementarity problems. SIAM J. Optim., 12(2):436\u2013460, (2001\/02)","DOI":"10.1137\/S1052623400380365"},{"issue":"10","key":"425_CR22","doi-asserted-by":"publisher","first-page":"6707","DOI":"10.1109\/TIT.2018.2841379","volume":"64","author":"M Golbabaee","year":"2018","unstructured":"Golbabaee, M., Davies, M.E.: Inexact gradient projection and fast data driven compressed sensing. IEEE Trans. Inf. Theory 64(10), 6707\u20136721 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"425_CR23","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1090\/S0002-9904-1964-11178-2","volume":"70","author":"AA Goldstein","year":"1964","unstructured":"Goldstein, A.A.: Convex programming in Hilbert space. Bull. Am. Math. Soc. 70, 709\u2013710 (1964)","journal-title":"Bull. Am. Math. Soc."},{"issue":"2","key":"425_CR24","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1080\/10556788.2015.1082105","volume":"31","author":"D Gon\u00e7alves","year":"2016","unstructured":"Gon\u00e7alves, D., Gomes-Ruggiero, M., Lavor, C.: A projected gradient method for optimization over density matrices. Optim. Methods Softw. 31(2), 328\u2013341 (2016). https:\/\/doi.org\/10.1080\/10556788.2015.1082105","journal-title":"Optim. Methods Softw."},{"key":"425_CR25","unstructured":"Gon\u00e7alves, D.S., Gon\u00e7alves, M.L., Oliveira, F.R.: Levenberg-marquardt methods with inexact projections for constrained nonlinear systems. arXiv preprint arXiv:1908.06118, (2019)"},{"key":"425_CR26","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, D.S., Gon\u00e7alves, M.L.N., Menezes, T.C.: Inexact variable metric method for convex-constrained optimization problems. Optimization-Online e-prints, (2020)","DOI":"10.1080\/02331934.2021.1887181"},{"issue":"1","key":"425_CR27","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1080\/10556788.2020.1734806","volume":"37","author":"MLN Gon\u00e7alves","year":"2022","unstructured":"Gon\u00e7alves, M.L.N., Melo, J.G., Monteiro, R.D.C.: Projection-free accelerated method for convex optimization. Optim. Methods Softw. 37(1), 214\u2013240 (2022). https:\/\/doi.org\/10.1080\/10556788.2020.1734806","journal-title":"Methods Softw"},{"issue":"17","key":"425_CR28","doi-asserted-by":"publisher","first-page":"2754","DOI":"10.1016\/j.neucom.2011.02.019","volume":"74","author":"P Gong","year":"2011","unstructured":"Gong, P., Gai, K., Zhang, C.: Efficient euclidean projections via piecewise root finding and its application in gradient projection. Neurocomputing 74(17), 2754\u20132766 (2011)","journal-title":"Neurocomputing"},{"issue":"1","key":"425_CR29","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1590\/S0101-82052003000100003","volume":"22","author":"AN Iusem","year":"2003","unstructured":"Iusem, A.N.: On the convergence properties of the projected gradient method for convex optimization. Comput. Appl. Math. 22(1), 37\u201352 (2003)","journal-title":"Comput. Appl. Math."},{"issue":"2","key":"425_CR30","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1051\/ro\/1995290201231","volume":"29","author":"AN Iusem","year":"1995","unstructured":"Iusem, A.N., Svaiter, B.F.: A proximal regularization of the steepest descent method. RAIRO Rech. Op\u00e9r. 29(2), 123\u2013130 (1995)","journal-title":"RAIRO Rech. Op\u00e9r."},{"key":"425_CR31","unstructured":"Jaggi, M.: Revisiting Frank-Wolfe: Projection-free sparse convex optimization. In: Dasgupta, S., McAllester, D. (Eds), Proceedings of the 30th International Conference on Machine Learning, volume\u00a028 of Proceedings of Machine Learning Research, pp. 427\u2013435, Atlanta, Georgia, USA, 17\u201319 (2013). PMLR"},{"issue":"1","key":"425_CR32","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02192649","volume":"89","author":"KC Kiwiel","year":"1996","unstructured":"Kiwiel, K.C., Murty, K.: Convergence of the steepest descent method for minimizing Quasiconvex functions. J. Optim. Theory Appl. 89(1), 221\u2013226 (1996)","journal-title":"J. Optim. Theory Appl."},{"key":"425_CR33","unstructured":"Lan, G.: The Complexity of Large-scale Convex Programming under a Linear Optimization Oracle. arXiv e-prints, arXiv:1309.5550, (2013)"},{"issue":"2","key":"425_CR34","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1137\/140992382","volume":"26","author":"G Lan","year":"2016","unstructured":"Lan, G., Zhou, Y.: Conditional gradient sliding for convex optimization. SIAM J. Optim. 26(2), 1379\u20131409 (2016)","journal-title":"SIAM J. Optim."},{"key":"425_CR35","unstructured":"Lee, C.-P., Wright, S.: First-order algorithms converge faster than $$o(1\/k)$$ on convex problems. In: Chaudhuri, K., Salakhutdinov, R. (Eds.) Proceedings of the 36th International Conference on Machine Learning, volume\u00a097 of Proceedings of Machine Learning Research, pp. 3754\u20133762, Long Beach, California, USA, 09\u201315 (2019). PMLR"},{"key":"425_CR36","doi-asserted-by":"publisher","unstructured":"Lehoucq, R.B., Sorensen, D.C., Yang, C.: ARPACK Users\u2019 Guide. Society for Industrial and Applied Mathematics, (1998) https:\/\/doi.org\/10.1137\/1.9780898719628","DOI":"10.1137\/1.9780898719628"},{"issue":"5","key":"425_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"E Levitin","year":"1966","unstructured":"Levitin, E., Polyak, B.: Constrained minimization methods. USSR Comput. Math. Math. Phys. 6(5), 1\u201350 (1966)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"425_CR38","doi-asserted-by":"crossref","unstructured":"Ma, G., Hu, Y., Gao, H.: An accelerated momentum based gradient projection method for image deblurring. In: 2015 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC), pp. 1\u20134, (2015)","DOI":"10.1109\/ICSPCC.2015.7338964"},{"key":"425_CR39","doi-asserted-by":"crossref","unstructured":"Mangasarian, O.L.: Nonlinear programming, volume\u00a010 of Classics in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, (1994). Corrected reprint of the 1969 original","DOI":"10.1137\/1.9781611971255"},{"key":"425_CR40","unstructured":"Mor\u00e9, J.J.: Gradient projection techniques for large-scale optimization problems. In: Proceedings of the 28th IEEE Conference on Decision and Control, Vol. 1\u20133 (Tampa, FL, 1989), pp. 378\u2013381. IEEE, New York, (1989)"},{"key":"425_CR41","unstructured":"Mor\u00e9, J.J.: On the performance of algorithms for large-scale bound constrained problems. In: Large-scale numerical optimization (Ithaca. NY, 1989), pp. 32\u201345. SIAM, Philadelphia, PA (1990)"},{"key":"425_CR42","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory lectures on convex optimization, volume\u00a087 of Applied Optimization. Kluwer Academic Publishers, Boston, MA, (2004). A basic course","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"425_CR43","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1017\/S096249291300007X","volume":"22","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y., Nemirovski, A.: On first-order algorithms for $$\\ell _1$$\/nuclear norm minimization. Acta Numer. 22, 509\u2013575 (2013)","journal-title":"Acta Numer."},{"key":"425_CR44","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, New York (2006)","edition":"2"},{"issue":"10","key":"425_CR45","doi-asserted-by":"publisher","first-page":"3317","DOI":"10.1109\/TAC.2018.2805727","volume":"63","author":"A Patrascu","year":"2018","unstructured":"Patrascu, A., Necoara, I.: On the convergence of inexact projection primal first-order methods for convex minimization. IEEE Trans. Automat. Control 63(10), 3317\u20133329 (2018)","journal-title":"IEEE Trans. Automat. Control"},{"key":"425_CR46","unstructured":"Schmidt, M., Roux, N.L., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: Proceedings of the 24th International Conference on Neural Information Processing Systems, NIPS\u201911, pp. 1458-1466, Red Hook, NY, USA, (2011). Curran Associates Inc"},{"issue":"4","key":"425_CR47","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1080\/10556788.2017.1296439","volume":"32","author":"AM-C So","year":"2017","unstructured":"So, A.M.-C., Zhou, Z.: Non-asymptotic convergence analysis of inexact gradient methods for machine learning without strong convexity. Optim. Methods Softw. 32(4), 963\u2013992 (2017)","journal-title":"Optim. Methods Softw."},{"key":"425_CR48","series-title":"Neural Information Processing Series","volume-title":"Optimization for Machine Learning","author":"S Sra","year":"2012","unstructured":"Sra, S., Nowozin, S., Wright, S.: Optimization for Machine Learning. Neural Information Processing Series, MIT Press, Cambridge (2012)"},{"issue":"3","key":"425_CR49","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0895479800371529","volume":"23","author":"GW Stewart","year":"2002","unstructured":"Stewart, G.W.: A Krylov-Schur algorithm for large eigenproblems. SIAM J. Matrix Anal. Appl. 23(3), 601\u2013614 (2002). https:\/\/doi.org\/10.1137\/S0895479800371529","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"425_CR50","unstructured":"Tang, J., Golbabaee, M., Davies, M.E.: Gradient projection iterative sketch for large-scale constrained least-squares. In: Precup, D., Teh, Y.W. (Eds), Proceedings of the 34th International Conference on Machine Learning, volume\u00a070 of Proceedings of Machine Learning Research, pp. 3377\u20133386, International Convention Centre, Sydney, Australia, 06\u201311 (2017). PMLR"},{"issue":"3","key":"425_CR51","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/110844805","volume":"23","author":"S Villa","year":"2013","unstructured":"Villa, S., Salzo, S., Baldassarre, L., Verri, A.: Accelerated and inexact forward-backward algorithms. SIAM J. Optim. 23(3), 1607\u20131633 (2013)","journal-title":"SIAM J. Optim."},{"key":"425_CR52","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0024-3795(94)00238-X","volume":"245","author":"KG Woodgate","year":"1996","unstructured":"Woodgate, K.G.: Least-squares solution of $$f = pg$$ over positive semidefinite symmetric $$p$$. Linear Algebra Appl. 245, 171\u2013190 (1996)","journal-title":"Linear Algebra Appl."},{"issue":"10","key":"425_CR53","doi-asserted-by":"publisher","first-page":"2339","DOI":"10.1080\/02331934.2019.1696338","volume":"69","author":"F Zhang","year":"2020","unstructured":"Zhang, F., Wang, H., Wang, J., Yang, K.: Inexact primal-dual gradient projection methods for nonlinear optimization on convex set. Optimization, 69(10), 2339\u20132365 (2020). https:\/\/doi.org\/10.1080\/02331934.2019.1696338","journal-title":"Optimization"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00425-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00425-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00425-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T13:21:09Z","timestamp":1678454469000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00425-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,28]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["425"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00425-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2022,10,28]]},"assertion":[{"value":"21 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}