{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T12:04:24Z","timestamp":1782389064207,"version":"3.54.5"},"reference-count":65,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018694","name":"European Commission Marie Sklodowska-Curie Actions","doi-asserted-by":"publisher","award":["861137"],"award-info":[{"award-number":["861137"]}],"id":[{"id":"10.13039\/100018694","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.ejor.2026.01.053","type":"journal-article","created":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T23:33:23Z","timestamp":1770507203000},"page":"735-750","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Primal-dual algorithm for weakly convex functions under sharpness conditions"],"prefix":"10.1016","volume":"334","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3683-6881","authenticated-orcid":false,"given":"Ewa M.","family":"Bednarczuk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8816-7558","authenticated-orcid":false,"given":"Monika","family":"Syga","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0994-410X","authenticated-orcid":false,"given":"The Hung","family":"Tran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ejor.2026.01.053_bib0001","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10107-022-01901-9","article-title":"Faster first-order primal-dual methods for linear programming using restarts and sharpness","volume":"201","author":"Applegate","year":"2023","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.053_bib0002","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1137\/21M1465445","article-title":"A unified analysis of descent sequences in weakly convex optimization, including convergence rates for bundle methods","volume":"33","author":"Atenas","year":"2023","journal-title":"SIAM Journal on Optimization"},{"issue":"276","key":"10.1016\/j.ejor.2026.01.053_bib0003","first-page":"1063","article-title":"Resolution numerique d\u2019inegalities variationanelles","volume":"A B","author":"Auslender","year":"1973","journal-title":"Academy Science"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.053_bib0004","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/s10957-022-02016-z","article-title":"The equivalence of three types of error bounds for weakly and approximately convex functions","volume":"194","author":"Bai","year":"2022","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/j.ejor.2026.01.053_bib0005","series-title":"Convex analysis and monotone operator theory in Hilbert spaces","author":"Bauschke","year":"2017"},{"key":"10.1016\/j.ejor.2026.01.053_bib0006","series-title":"2023 European control conference (ECC)","first-page":"1","article-title":"Calculus rules for proximal \u03b5-subdifferentials and inexact proximity operators for weakly convex functions","author":"Bednarczuk","year":"2023"},{"key":"10.1016\/j.ejor.2026.01.053_bib0007","unstructured":"Bednarczuk, E., Bruccola, G., Scrivanti, G., & Tran, T. H. (2023b). Convergence analysis of an inexact forward-backward algorithm for problems involving weakly convex functions. arXiv: 2303.14021."},{"issue":"4","key":"10.1016\/j.ejor.2026.01.053_bib0008","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1080\/02331934.2021.2010076","article-title":"On duality for nonconvex minimization problems within the framework of abstract convexity","volume":"71","author":"Bednarczuk","year":"2022","journal-title":"Optimization"},{"issue":"4","key":"10.1016\/j.ejor.2026.01.053_bib0009","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1137\/050644641","article-title":"The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems","volume":"17","author":"Bolte","year":"2007","journal-title":"SIAM Journal on Optimization"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2026.01.053_bib0010","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","article-title":"Proximal alternating linearized minimization for nonconvex and nonsmooth problems","volume":"146","author":"Bolte","year":"2014","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2026.01.053_bib0011","series-title":"Semiconcave functions, Hamilton-jacobi equations, and optimal control","volume":"vol. 58","author":"Cannarsa","year":"2004"},{"key":"10.1016\/j.ejor.2026.01.053_bib0012","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/B:JMIV.0000011325.36760.1e","article-title":"An algorithm for total variation minimization and applications","volume":"20","author":"Chambolle","year":"2004","journal-title":"Journal of Mathematical Imaging and Vision"},{"key":"10.1016\/j.ejor.2026.01.053_bib0013","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","article-title":"A first-order primal-dual algorithm for convex problems with applications to imaging","volume":"40","author":"Chambolle","year":"2011","journal-title":"Journal of Mathematical Imaging and Vision"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.053_bib0014","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1007\/s11760-023-02876-6","article-title":"Image denoising based on the fractional-order total variation and the minimax-concave","volume":"18","author":"Chen","year":"2024","journal-title":"Signal, Image and Video Processing"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.053_bib0015","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1007\/s00245-020-09676-1","article-title":"Primal\u2013dual proximal splitting and generalized conjugation in non-smooth non-convex optimization","volume":"84","author":"Clason","year":"2021","journal-title":"Applied Mathematics & Optimization"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.053_bib0016","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/moor.2022.0294","article-title":"Alternating and parallel proximal gradient methods for nonsmooth, nonconvex minimax: A unified convergence analysis","volume":"50","author":"Cohen","year":"2025","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.053_bib0017","doi-asserted-by":"crossref","first-page":"1539","DOI":"10.1137\/21M1455000","article-title":"Warpd: A linearly convergent first-order primal-dual algorithm for inverse problems with approximate sharpness conditions","volume":"15","author":"Colbrook","year":"2022","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"4","key":"10.1016\/j.ejor.2026.01.053_bib0018","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","article-title":"Signal recovery by proximal forward-backward splitting","volume":"4","author":"Combettes","year":"2005","journal-title":"Multiscale Modeling & Simulation"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.053_bib0019","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/s10957-012-0245-9","article-title":"A primal\u2013dual splitting method for convex optimization involving lipschitzian, proximable and linear composite terms","volume":"158","author":"Condat","year":"2013","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"4","key":"10.1016\/j.ejor.2026.01.053_bib0020","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1080\/02331934.2022.2032695","article-title":"Error bounds revisited","volume":"71","author":"Cuong","year":"2022","journal-title":"Optimization"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.053_bib0021","doi-asserted-by":"crossref","first-page":"1912","DOI":"10.1137\/151003076","article-title":"Convergence rate analysis of primal-dual splitting schemes","volume":"25","author":"Davis","year":"2015","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/j.ejor.2026.01.053_bib0022","doi-asserted-by":"crossref","unstructured":"Davis, D., Drusvyatskiy, D., & Jiang, L. (2024). Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth. arXiv: 2409.19791.","DOI":"10.1007\/s10107-025-02290-5"},{"key":"10.1016\/j.ejor.2026.01.053_bib0023","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1007\/s10957-018-1372-8","article-title":"Subgradient methods for sharp weakly convex functions","volume":"179","author":"Davis","year":"2018","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.053_bib0024","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1287\/moor.2017.0889","article-title":"Error bounds, quadratic growth, and linear convergence of proximal methods","volume":"43","author":"Drusvyatskiy","year":"2018","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/j.ejor.2026.01.053_bib0025","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5802\/ojmo.26","article-title":"Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient","volume":"4","author":"Fercoq","year":"2023","journal-title":"Open Journal of Mathematical Optimization"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.053_bib0026","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s10107-022-01910-8","article-title":"The landscape of the proximal point method for nonconvex\u2013nonconcave minimax optimization","volume":"201","author":"Grimmer","year":"2023","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2026.01.053_bib0027","series-title":"Proceedings of the IEEE conference on computer vision and pattern recognition","first-page":"2862","article-title":"Weighted nuclear norm minimization with application to image denoising","author":"Gu","year":"2014"},{"key":"10.1016\/j.ejor.2026.01.053_bib0028","unstructured":"Guo, J., Wang, X., & Xiao, X. (2023). Preconditioned primal-dual gradient methods for nonconvex composite and finite-sum optimization. arXiv: 2309.13416."},{"issue":"2","key":"10.1016\/j.ejor.2026.01.053_bib0029","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1137\/18M1213488","article-title":"A primal-dual algorithm with line search for general convex-concave saddle point problems","volume":"31","author":"Hamedani","year":"2021","journal-title":"SIAM Journal on Optimization"},{"issue":"4","key":"10.1016\/j.ejor.2026.01.053_bib0030","doi-asserted-by":"crossref","first-page":"2526","DOI":"10.1137\/140963467","article-title":"On the convergence of primal-dual hybrid gradient algorithm","volume":"7","author":"He","year":"2014","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.053_bib0031","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/100814494","article-title":"Convergence analysis of primal-dual algorithms for a saddle-point problem: From contraction perspective","volume":"5","author":"He","year":"2012","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"10.1016\/j.ejor.2026.01.053_bib0032","series-title":"Proceedings of the 2023 6th international conference on image and graphics processing","first-page":"71","article-title":"Adaptive minimax-concave penalty based MR image denoising with difference of gaussian filter","author":"Hu","year":"2023"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.053_bib0033","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1137\/22M1482238","article-title":"Optimality conditions for nonsmooth nonconvex-nonconcave min-max problems and generative adversarial networks","volume":"5","author":"Jiang","year":"2023","journal-title":"SIAM Journal on Mathematics of Data Science"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.053_bib0034","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10107-018-01361-0","article-title":"Faster subgradient methods for functions with h\u00f6lderian growth","volume":"180","author":"Johnstone","year":"2020","journal-title":"Mathematical Programming"},{"issue":"4","key":"10.1016\/j.ejor.2026.01.053_bib0035","first-page":"721","article-title":"Subdifferentiability and subdifferential monotonicity of 1-paraconvex functions","volume":"25","author":"Jourani","year":"1996","journal-title":"Control and Cybernetics"},{"key":"10.1016\/j.ejor.2026.01.053_bib0036","unstructured":"Kume, K., & Yamada, I. (2024). A variable smoothing for weakly convex composite minimization with nonconvex constraint. arXiv: 2412.04225."},{"key":"10.1016\/j.ejor.2026.01.053_bib0037","unstructured":"Li, J., Zhu, L., & So, A. M.-C. (2022). Nonsmooth nonconvex-nonconcave minimax optimization: Primal-dual balancing and iteration complexity analysis. arXiv: 2209.10825."},{"key":"10.1016\/j.ejor.2026.01.053_bib0038","series-title":"6Th annual learning for dynamics & control conference","first-page":"993","article-title":"Error bounds, p\u0141 condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods","author":"Liao","year":"2024"},{"issue":"169","key":"10.1016\/j.ejor.2026.01.053_bib0039","first-page":"1","article-title":"First-order convergence theory for weakly-convex-weakly-concave min-max problems","volume":"22","author":"Liu","year":"2021","journal-title":"Journal of Machine Learning Research"},{"issue":"6","key":"10.1016\/j.ejor.2026.01.053_bib0040","doi-asserted-by":"crossref","first-page":"3603","DOI":"10.1109\/TAES.2019.2909728","article-title":"DOA estimation in impulsive noise via low-rank matrix approximation and weakly convex optimization","volume":"55","author":"Liu","year":"2019","journal-title":"IEEE Transactions on Aerospace and Electronic Systems"},{"key":"10.1016\/j.ejor.2026.01.053_bib0041","unstructured":"Lu, H., & Yang, J. (2022). On the infimal sub-differential size of primal-dual hybrid gradient method and beyond. arXiv: 2206.12061."},{"key":"10.1016\/j.ejor.2026.01.053_bib0042","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-025-00671-2","article-title":"A symmetric version of the generalized chambolle-Pock-He-Yuan method for saddle point problems","volume":"91","author":"Ma","year":"2025","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/j.ejor.2026.01.053_bib0043","doi-asserted-by":"crossref","first-page":"8339","DOI":"10.1109\/TIP.2020.3014721","article-title":"Collaborative filtering of correlated noise: Exact transform-domain variance for improved shrinkage and patch matching","volume":"29","author":"M\u00e4kinen","year":"2020","journal-title":"IEEE Transactions on Image Processing"},{"key":"10.1016\/j.ejor.2026.01.053_bib0044","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1553\/etna_vol52s509","article-title":"Primal-dual block-proximal splitting for a class of non-convex problems","volume":"52","author":"Mazurenko","year":"2020","journal-title":"Electronic Transactions on Numerical Analysis"},{"key":"10.1016\/j.ejor.2026.01.053_bib0045","article-title":"The numerics of GANS","volume":"30","author":"Mescheder","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"10.1016\/j.ejor.2026.01.053_bib0046","series-title":"International conference on artificial intelligence and statistics","first-page":"1684","article-title":"Iterative regularization for convex regularizers","author":"Molinari","year":"2021"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.053_bib0047","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1137\/140976601","article-title":"The primal-dual hybrid gradient method for semiconvex splittings","volume":"8","author":"Mollenhoff","year":"2015","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"4","key":"10.1016\/j.ejor.2026.01.053_bib0048","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1109\/MCSE.2011.71","article-title":"The numerical tours of signal processing-advanced computational signal and image processing","volume":"13","author":"Peyr\u00e9","year":"2011","journal-title":"IEEE Computing in Science and Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.053_bib0049","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1080\/10556788.2021.1895152","article-title":"Weakly-convexconcave minmax optimization: Provable algorithms and applications in machine learning","volume":"37","author":"Rafique","year":"2022","journal-title":"Optimization Methods and Software"},{"issue":"5","key":"10.1016\/j.ejor.2026.01.053_bib0050","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1109\/MSP.2020.3003851","article-title":"Nonconvex min-max optimization: Applications, challenges, and recent theoretical advances","volume":"37","author":"Razaviyayn","year":"2020","journal-title":"IEEE Signal Processing Magazine"},{"key":"10.1016\/j.ejor.2026.01.053_bib0051","series-title":"Variational analysis","volume":"vol. 317","author":"Rockafellar","year":"2009"},{"key":"10.1016\/j.ejor.2026.01.053_bib0052","first-page":"540","article-title":"On paraconvex multifunctions","volume":"31","author":"Rolewicz","year":"1979","journal-title":"Operations Research Verfahren (Methods of Operations Research)"},{"issue":"9","key":"10.1016\/j.ejor.2026.01.053_bib0053","doi-asserted-by":"crossref","first-page":"4344","DOI":"10.1109\/TAI.2024.3386500","article-title":"A distributed conditional wasserstein deep convolutional relativistic loss generative adversarial network with improved convergence","volume":"5","author":"Roy","year":"2024","journal-title":"IEEE Transactions on Artificial Intelligence"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.053_bib0054","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3446374","article-title":"Generative adversarial networks (GANs) challenges, solutions, and future directions","volume":"54","author":"Saxena","year":"2021","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"12","key":"10.1016\/j.ejor.2026.01.053_bib0055","doi-asserted-by":"crossref","first-page":"3199","DOI":"10.1109\/TSP.2018.2824289","article-title":"Nonconvex sparse logistic regression with weakly convex regularization","volume":"66","author":"Shen","year":"2018","journal-title":"IEEE Transactions on Signal Processing"},{"key":"10.1016\/j.ejor.2026.01.053_bib0056","unstructured":"Shumaylov, Z., Budd, J., Mukherjee, S., & Sch\u00f6nlieb, C.-B. (2024). Weakly convex regularisers for inverse problems: Convergence of critical points and primal-dual optimisation. arXiv: 2402.01052."},{"key":"10.1016\/j.ejor.2026.01.053_bib0057","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.cam.2017.07.037","article-title":"Precompact convergence of the nonconvex primal\u2013dual hybrid gradient algorithm","volume":"330","author":"Sun","year":"2018","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"10.1016\/j.ejor.2026.01.053_bib0058","unstructured":"Tran, H., Zhang, Q., & Cutkosky, A. (2024). Empirical tests of optimization assumptions in deep learning. arXiv: 2407.01825."},{"key":"10.1016\/j.ejor.2026.01.053_bib0059","unstructured":"Tran-Dinh, Q., & Cevher, V. (2014). A primal-dual algorithmic framework for constrained convex minimization. arXiv: 1406.5403."},{"issue":"5","key":"10.1016\/j.ejor.2026.01.053_bib0060","doi-asserted-by":"crossref","DOI":"10.1088\/0266-5611\/30\/5\/055012","article-title":"A primal\u2013dual hybrid gradient method for nonlinear operators with applications to MRI","volume":"30","author":"Valkonen","year":"2014","journal-title":"Inverse Problems"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.053_bib0061","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/s10444-011-9254-8","article-title":"A splitting algorithm for dual monotone inclusions involving cocoercive operators","volume":"38","author":"V\u0169","year":"2013","journal-title":"Advances in Computational Mathematics"},{"key":"10.1016\/j.ejor.2026.01.053_bib0062","doi-asserted-by":"crossref","first-page":"69883","DOI":"10.1109\/ACCESS.2018.2880454","article-title":"A survey on nonconvex regularization-based sparse and low-rank recovery in signal processing, statistics, and machine learning","volume":"6","author":"Wen","year":"2018","journal-title":"IEEE Access"},{"key":"10.1016\/j.ejor.2026.01.053_bib0063","unstructured":"Xiong, Z., & Freund, R. M. (2023). Computational guarantees for restarted PDHG for LP based on \u201dlimiting error ratios\u201d and LP sharpness. arXiv: 2312.14774."},{"issue":"7","key":"10.1016\/j.ejor.2026.01.053_bib0064","doi-asserted-by":"crossref","first-page":"3142","DOI":"10.1109\/TIP.2017.2662206","article-title":"Beyond a gaussian denoiser: Residual learning of deep CNN for image denoising","volume":"26","author":"Zhang","year":"2017","journal-title":"IEEE Transactions on Image Processing"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.053_bib0065","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/moor.2022.1350","article-title":"A first-order primal-dual method for nonconvex constrained optimization based on the augmented lagrangian","volume":"49","author":"Zhu","year":"2024","journal-title":"Mathematics of Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726000950?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726000950?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T23:26:21Z","timestamp":1781825181000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221726000950"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":65,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,11]]}},"alternative-id":["S0377221726000950"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2026.01.053","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Primal-dual algorithm for weakly convex functions under sharpness conditions","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2026.01.053","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}