{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T08:26:40Z","timestamp":1787041600359,"version":"build-2736575974"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T00:00:00Z","timestamp":1767657600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T00:00:00Z","timestamp":1767657600000},"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":["Math. Prog. Comp."],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1007\/s12532-025-00302-1","type":"journal-article","created":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T12:17:18Z","timestamp":1767701838000},"page":"579-628","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints"],"prefix":"10.1007","volume":"18","author":[{"given":"Hari","family":"Dahal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yangyang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,6]]},"reference":[{"key":"302_CR1","unstructured":"Allen-Zhu, Z.: Natasha: Faster non-convex stochastic optimization via strongly non-convex parameter. In: International Conference on Machine Learning p. 89\u201397 (2017)"},{"key":"302_CR2","doi-asserted-by":"crossref","unstructured":"Angwin, J., Larson, J., Mattu, S., Kirchner, L.: Machine bias. In: Ethics of Data and Analytics, p. 254\u2013264. Auerbach Publications (2022)","DOI":"10.1201\/9781003278290-37"},{"issue":"1","key":"302_CR3","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/090762294","volume":"21","author":"NS Aybat","year":"2011","unstructured":"Aybat, N.S., Iyengar, G.: A first-order smoothed penalty method for compressed sensing. SIAM J. Optim. 21(1), 287\u2013313 (2011)","journal-title":"SIAM J. Optim."},{"key":"302_CR4","doi-asserted-by":"crossref","unstructured":"Bayandina, A., Dvurechensky, P., Gasnikov, A., Stonyakin, F., Titov, A.: Mirror descent and convex optimization problems with non-smooth inequality constraints. Large-Scale and Distributed Optimization. pp. 181\u2013213 (2018)","DOI":"10.1007\/978-3-319-97478-1_8"},{"key":"302_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/0471787779","volume-title":"Nonlinear programming: theory and algorithms","author":"MS Bazaraa","year":"2006","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear programming: theory and algorithms. John Wiley & Sons, New Jersey (2006)"},{"key":"302_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TGRS.2020.3034752","volume":"60","author":"Y Chen","year":"2021","unstructured":"Chen, Y., Huang, T.-Z., He, W., Zhao, X.-L., Zhang, H., Zeng, J.: Hyperspectral image denoising using factor group sparsity-regularized non-convex low-rank approximation. IEEE Trans. Geosci. Remote Sens. 60, 1\u201316 (2021)","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"302_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and non-smooth Analysis","author":"FH Clarke","year":"1990","unstructured":"Clarke, F.H.: Optimization and non-smooth Analysis, vol. 5. SIAM, Philadelphia (1990)"},{"issue":"2","key":"302_CR8","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1137\/090780201","volume":"22","author":"FE Curtis","year":"2012","unstructured":"Curtis, F.E., Overton, M.L.: A sequential quadratic programming algorithm for non-convex, non-smooth constrained optimization. SIAM J. Optim. 22(2), 474\u2013500 (2012)","journal-title":"SIAM J. Optim."},{"key":"302_CR9","doi-asserted-by":"crossref","unstructured":"Danilova, M., Dvurechensky, P., Gasnikov, A., Gorbunov, E., Guminov, S., Kamzolov, D., Shibaev, I.: Recent theoretical advances in non-convex optimization. In: High-Dimensional Optimization and Probability: With a View Towards Data Science, pp. 79\u2013163. Springer (2022)","DOI":"10.1007\/978-3-031-00832-0_3"},{"key":"302_CR10","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic subgradient method converges at the rate $$ \\cal{O} (k^{-1\/4}) $$ on weakly convex functions. (2018). ArXiv:1802.02988"},{"issue":"1","key":"302_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/18M1178244","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. SIAM J. Optim. 29(1), 207\u2013239 (2019)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"302_CR12","doi-asserted-by":"publisher","first-page":"1908","DOI":"10.1137\/17M1151031","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Grimmer, B.: Proximally guided stochastic subgradient method for non-smooth, non-convex problems. SIAM J. Optim. 29(3), 1908\u20131930 (2019)","journal-title":"SIAM J. Optim."},{"key":"302_CR13","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10107-018-1311-3","volume":"178","author":"D Drusvyatskiy","year":"2019","unstructured":"Drusvyatskiy, D., Paquette, C.: Efficiency of minimizing compositions of convex functions and smooth maps. Math. Program. 178, 503\u2013558 (2019)","journal-title":"Math. Program."},{"issue":"4","key":"302_CR14","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first-and zeroth-order methods for non-convex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"302_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for non-convex nonlinear and stochastic programming. Math. Program. 156(1\u20132), 59\u201399 (2016)","journal-title":"Math. Program."},{"key":"302_CR16","unstructured":"Goncalves, M.L., Melo, J.G., Monteiro, R.D.: Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving non-convex linearly constrained problems (2017). ArXiv:1702.01850"},{"issue":"1\u20132","key":"302_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-019-01365-4","volume":"176","author":"D Hajinezhad","year":"2019","unstructured":"Hajinezhad, D., Hong, M.: Perturbed proximal primal-dual algorithm for non-convex non-smooth optimization. Math. Program. 176(1\u20132), 207\u2013245 (2019)","journal-title":"Math. Program."},{"key":"302_CR18","unstructured":"Hong, M.: Decomposing linearly constrained non-convex problems by a proximal primal-dual approach: algorithms, convergence, and applications (2016). arXiv:1604.00543"},{"key":"302_CR19","doi-asserted-by":"crossref","unstructured":"Huang, Y., Lin, Q.: Single-loop switching subgradient methods for non-smooth weakly convex optimization with non-smooth convex constraints (2023). arXiv:2301.13314","DOI":"10.52202\/075280-2679"},{"issue":"1","key":"302_CR20","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10589-018-0034-y","volume":"72","author":"B Jiang","year":"2019","unstructured":"Jiang, B., Lin, T., Ma, S., Zhang, S.: Structured non-convex and non-smooth optimization: algorithms and iteration complexity analysis. Comput. Optim. Appl. 72(1), 115\u2013157 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"302_CR21","unstructured":"Kohavi, R., et al.: Scaling up the accuracy of naive-bayes classifiers: a decision-tree hybrid. In: KDD, vol. 96, pp. 202\u2013207 (1996)"},{"issue":"4","key":"302_CR22","doi-asserted-by":"publisher","first-page":"2566","DOI":"10.1137\/18M1171011","volume":"29","author":"W Kong","year":"2019","unstructured":"Kong, W., Melo, J.G., Monteiro, R.D.: Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained non-convex composite programs. SIAM J. Optim. 29(4), 2566\u20132593 (2019)","journal-title":"SIAM J. Optim."},{"key":"302_CR23","doi-asserted-by":"crossref","unstructured":"Kong, W., Melo, J.G., Monteiro, R.D.: Iteration complexity of a proximal augmented Lagrangian method for solving non-convex composite optimization problems with nonlinear convex constraints. Math. Oper. Res (2022)","DOI":"10.1287\/moor.2022.1301"},{"issue":"2","key":"302_CR24","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10589-023-00464-5","volume":"85","author":"W Kong","year":"2023","unstructured":"Kong, W., Monteiro, R.D.: An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems. Comput. Optim. Appl. 85(2), 509\u2013545 (2023)","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20132","key":"302_CR25","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-012-0588-x","volume":"138","author":"G Lan","year":"2013","unstructured":"Lan, G., Monteiro, R.D.: Iteration-complexity of first-order penalty methods for convex programming. Math. Program. 138(1\u20132), 115\u2013139 (2013)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"302_CR26","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s10107-015-0861-x","volume":"155","author":"G Lan","year":"2016","unstructured":"Lan, G., Monteiro, R.D.: Iteration-complexity of first-order augmented Lagrangian methods for convex programming. Math. Program. 155(1\u20132), 511\u2013547 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"302_CR27","doi-asserted-by":"publisher","first-page":"2753","DOI":"10.1137\/18M1192536","volume":"29","author":"G Lan","year":"2019","unstructured":"Lan, G., Yang, Y.: Accelerated stochastic algorithms for non-convex finite-sum and multi-block optimization. SIAM J. Optim. 29(4), 2753\u20132784 (2019)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"302_CR28","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10589-020-00179-x","volume":"76","author":"G Lan","year":"2020","unstructured":"Lan, G., Zhou, Z.: Algorithms for stochastic optimization with function or expectation constraints. Comput. Optim. Appl. 76(2), 461\u2013498 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"302_CR29","unstructured":"Li, Z., Chen, P.-Y., Liu, S., Lu, S., Xu, Y.: Rate-improved inexact augmented Lagrangian method for constrained non-convex optimization. In: International Conference on Artificial Intelligence and Statistics. pp. 2170\u20132178 (2021)"},{"issue":"4","key":"302_CR30","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1287\/ijoo.2021.0052","volume":"3","author":"Z Li","year":"2021","unstructured":"Li, Z., Xu, Y.: Augmented Lagrangian-based first-order methods for convex-constrained programs with weakly convex objective. INFORMS J. Optim. 3(4), 373\u2013397 (2021)","journal-title":"INFORMS J. Optim."},{"issue":"1","key":"302_CR31","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10589-022-00358-y","volume":"82","author":"Q Lin","year":"2022","unstructured":"Lin, Q., Ma, R., Xu, Y.: Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization. Comput. Optim. Appl. 82(1), 175\u2013224 (2022)","journal-title":"Comput. Optim. Appl."},{"key":"302_CR32","unstructured":"Lin, Q., Ma, R., Yang, T.: Level-set methods for finite-sum constrained convex optimization. In: International Conference on Machine Learning. p. 3112\u20133121 (2018)"},{"issue":"2","key":"302_CR33","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1287\/moor.2018.0939","volume":"44","author":"Y-F Liu","year":"2019","unstructured":"Liu, Y.-F., Liu, X., Ma, S.: On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming. Math. Oper. Res. 44(2), 632\u2013650 (2019)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"302_CR34","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1137\/21M1403837","volume":"33","author":"Z Lu","year":"2023","unstructured":"Lu, Z., Zhou, Z.: Iteration-complexity of first-order augmented Lagrangian methods for convex conic programming. SIAM J. Optim. 33(2), 1159\u20131190 (2023)","journal-title":"SIAM J. Optim."},{"key":"302_CR35","unstructured":"Melo, J.G., Monteiro, R.D.: Iteration-complexity of a Jacobi-type non-Euclidean ADMM for multi-block linearly constrained non-convex programs (2017). arXiv:1705.07229"},{"issue":"1","key":"302_CR36","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/s10957-023-02218-z","volume":"202","author":"JG Melo","year":"2024","unstructured":"Melo, J.G., Monteiro, R.D., Wang, H.: A proximal augmented Lagrangian method for linearly constrained nonconvex composite optimization problems. J. Optim. Theory Appl. 202(1), 388\u2013420 (2024)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"302_CR37","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1080\/10556788.2017.1380642","volume":"34","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Patrascu, A., Glineur, F.: Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming. Optim. Methods Softw. 34(2), 305\u2013335 (2019)","journal-title":"Optim. Methods Softw."},{"key":"302_CR38","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2003","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, vol. 87. Springer Science & Business Media, Berlin (2003)"},{"issue":"1","key":"302_CR39","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"302_CR40","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s11590-016-1024-6","volume":"11","author":"A Patrascu","year":"2017","unstructured":"Patrascu, A., Necoara, I., Tran-Dinh, Q.: Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization. Optim. Lett. 11, 609\u2013626 (2017)","journal-title":"Optim. Lett."},{"key":"302_CR41","unstructured":"Reddi, S.J., Hefny, A., Sra, S., Poczos, B., Smola, A.: Stochastic variance reduction for non-convex optimization. In: International Conference on Machine Learning. p. 314\u2013323 (2016)"},{"issue":"Oct","key":"302_CR42","first-page":"2831","volume":"12","author":"P Rigollet","year":"2011","unstructured":"Rigollet, P., Tong, X.: Neyman-pearson classification, convexity and stochastic constraints. J. Mach. Learn. Res. 12(Oct), 2831\u20132855 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"302_CR43","unstructured":"Sahin, M.F., Alacaoglu, A., Latorre, F., Cevher, V., et\u00a0al.: An inexact augmented Lagrangian framework for non-convex optimization with nonlinear constraints. In: Advances in Neural Information Processing Systems. p. 13965\u201313977 (2019)"},{"key":"302_CR44","doi-asserted-by":"crossref","unstructured":"Tran-Dinh, Q., Cevher, V.: A primal-dual algorithmic framework for constrained convex minimization. (2014). arXiv:1406.5403","DOI":"10.1137\/130944539"},{"key":"302_CR45","unstructured":"Vogel, R., Bellet, A., Cl\u00e9men\u00e7on, S.: Learning fair scoring functions: Bipartite ranking under roc-based fairness constraints. In: International Conference on Artificial Intelligence and Statistics. p. 784\u2013792. PMLR (2021)"},{"key":"302_CR46","unstructured":"Wei, X., Neely, M.J.: Primal-dual frank-wolfe for constrained stochastic programs with convex and non-convex objectives (2018). arXiv:1806.00709"},{"key":"302_CR47","unstructured":"Wei, X., Yu, H., Ling, Q., Neely, M.: Solving non-smooth constrained programs with lower complexity than $$\\cal{O} (\\frac{1}{\\varepsilon }) $$: a primal-dual homotopy smoothing approach. Adv. Neural. Inf. Process. Syst. 31 (2018)"},{"key":"302_CR48","volume-title":"Active-Set Methods for Quadratic Programming","author":"E Wong","year":"2011","unstructured":"Wong, E.: Active-Set Methods for Quadratic Programming. University of California, San Diego (2011)"},{"issue":"2","key":"302_CR49","doi-asserted-by":"publisher","first-page":"1664","DOI":"10.1137\/18M1229869","volume":"30","author":"Y Xu","year":"2020","unstructured":"Xu, Y.: Primal-dual stochastic gradient method for convex programs with many functional constraints. SIAM J. Optim. 30(2), 1664\u20131692 (2020)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"302_CR50","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1287\/ijoo.2019.0033","volume":"3","author":"Y Xu","year":"2021","unstructured":"Xu, Y.: First-order methods for constrained convex programming based on linearized augmented Lagrangian function. Informs J. Optim. 3(1), 89\u2013117 (2021)","journal-title":"Informs J. Optim."},{"issue":"185","key":"302_CR51","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10107-019-01425-9","volume":"185","author":"Y Xu","year":"2021","unstructured":"Xu, Y.: Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming. Math. Program. 185(185), 199\u2013244 (2021)","journal-title":"Math. Program."},{"issue":"3","key":"302_CR52","doi-asserted-by":"publisher","first-page":"1759","DOI":"10.1137\/20M1371579","volume":"32","author":"Y Xu","year":"2022","unstructured":"Xu, Y.: First-order methods for problems with $${O} (1)$$ functional constraints can have almost the same convergence rate as for unconstrained problems. SIAM J. Optim. 32(3), 1759\u20131790 (2022)","journal-title":"SIAM J. Optim."},{"key":"302_CR53","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s11464-012-0194-5","volume":"7","author":"Y Xu","year":"2012","unstructured":"Xu, Y., Yin, W., Wen, Z., Zhang, Y.: An alternating direction algorithm for matrix completion with nonnegative factors. Front. Math. China 7, 365\u2013384 (2012)","journal-title":"Front. Math. China"},{"issue":"2","key":"302_CR54","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/16M1059011","volume":"27","author":"H Yu","year":"2017","unstructured":"Yu, H., Neely, M.J.: A simple parallel algorithm with an $${O}(1\/t)$$ convergence rate for general convex programs. SIAM J. Optim. 27(2), 759\u2013783 (2017)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"302_CR55","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10915-022-01815-w","volume":"91","author":"J Zeng","year":"2022","unstructured":"Zeng, J., Yin, W., Zhou, D.-X.: Moreau envelope augmented Lagrangian method for non-convex optimization with linear constraints. J. Sci. Comput. 91(2), 61 (2022)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"302_CR56","doi-asserted-by":"publisher","first-page":"2272","DOI":"10.1137\/19M1242276","volume":"30","author":"J Zhang","year":"2020","unstructured":"Zhang, J., Luo, Z.-Q.: A proximal alternating direction method of multiplier for linearly constrained non-convex minimization. SIAM J. Optim. 30(3), 2272\u20132302 (2020)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"302_CR57","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1137\/20M135474X","volume":"32","author":"J Zhang","year":"2022","unstructured":"Zhang, J., Luo, Z.-Q.: A global dual error bound and its application to the analysis of linearly constrained non-convex optimization. SIAM J. Optim. 32(3), 2319\u20132346 (2022)","journal-title":"SIAM J. Optim."},{"key":"302_CR58","unstructured":"Zhang, S., He, N.: On the convergence rate of stochastic mirror descent for non-smooth non-convex optimization (2018). arXiv:1806.04781"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-025-00302-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-025-00302-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-025-00302-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T07:58:41Z","timestamp":1787039921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-025-00302-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,6]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["302"],"URL":"https:\/\/doi.org\/10.1007\/s12532-025-00302-1","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,6]]},"assertion":[{"value":"28 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","label":"Conflicts of Interest","group":{"name":"EthicsHeading","label":"Declarations"}}]}}