{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T15:45:27Z","timestamp":1766159127915,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031319747"},{"type":"electronic","value":"9783031319754"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-31975-4_29","type":"book-chapter","created":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T23:30:02Z","timestamp":1683761402000},"page":"379-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Relaxed Proximal Gradient Descent Algorithm for\u00a0Convergent Plug-and-Play with\u00a0Proximal Denoiser"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Hurault","sequence":"first","affiliation":[]},{"given":"Antonin","family":"Chambolle","sequence":"additional","affiliation":[]},{"given":"Arthur","family":"Leclaire","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Papadakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,10]]},"reference":[{"issue":"2","key":"29_CR1","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the kurdyka-\u0142ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"29_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized gauss-seidel methods. Math. Program. 137(1\u20132), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"11","key":"29_CR3","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TIP.2009.2028250","volume":"18","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems. IEEE Trans. Image Process. 18(11), 2419\u20132434 (2009)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"29_CR4","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"issue":"1","key":"29_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10107-015-0957-3","volume":"159","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: On the ergodic convergence rates of a first-order primal-dual algorithm. Math. Program. 159(1), 253\u2013287 (2016)","journal-title":"Math. Program."},{"key":"29_CR6","unstructured":"Cohen, R., Blau, Y., Freedman, D., Rivlin, E.: It has potential: gradient-driven denoisers for convergent solutions to inverse problems. In: Neural Information Processing Systems, vol. 34 (2021)"},{"key":"29_CR7","unstructured":"Dvurechensky, P., Gasnikov, A., Kroshnin, A.: Computational optimal transport: complexity by accelerated gradient descent is better than by Sinkhorn\u2019s algorithm. In: Proceedings of the 35th International Conference on Machine Learning, vol. 80, pp. 1367\u20131376. PMLR (2018)"},{"issue":"6","key":"29_CR8","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/s10851-020-00951-y","volume":"62","author":"R Gribonval","year":"2020","unstructured":"Gribonval, R., Nikolova, M.: A characterization of proximity operators. J. Math. Imaging Vis. 62(6), 773\u2013789 (2020)","journal-title":"J. Math. Imaging Vis."},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.laa.2021.09.004","volume":"631","author":"J Hertrich","year":"2021","unstructured":"Hertrich, J., Neumayer, S., Steidl, G.: Convolutional proximal neural networks and plug-and-play algorithms. Linear Algebra Appl. 631, 203\u2013234 (2021)","journal-title":"Linear Algebra Appl."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Hurault, S., Chambolle, A., Leclaire, A., Papadakis, N.: A relaxed proximal gradient descent algorithm for convergent plug-and-play with proximal denoiser. arXiv preprint arXiv:2301.13731 (2023)","DOI":"10.1007\/978-3-031-31975-4_29"},{"key":"29_CR11","unstructured":"Hurault, S., Leclaire, A., Papadakis, N.: Gradient step denoiser for convergent plug-and-play. In: International Conference on Learning Representations (2022)"},{"key":"29_CR12","unstructured":"Hurault, S., Leclaire, A., Papadakis, N.: Proximal denoiser for convergent plug-and-play optimization with nonconvex regularization. In: International Conference on Machine Learning (2022)"},{"issue":"1","key":"29_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10107-017-1173-0","volume":"171","author":"G Lan","year":"2018","unstructured":"Lan, G., Zhou, Y.: An optimal randomized incremental gradient method. Math. Program. 171(1), 167\u2013215 (2018)","journal-title":"Math. Program."},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Levin, A., Weiss, Y., Durand, F., Freeman, W.T.: Understanding and evaluating blind deconvolution algorithms. In: IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 1964\u20131971 (2009)","DOI":"10.1109\/CVPRW.2009.5206815"},{"issue":"2","key":"29_CR15","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1137\/140976601","volume":"8","author":"T M\u00f6llenhoff","year":"2015","unstructured":"M\u00f6llenhoff, T., Strekalovskiy, E., Moeller, M., Cremers, D.: The primal-dual hybrid gradient method for semiconvex splittings. SIAM J. Imaging Sci. 8(2), 827\u2013857 (2015)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"29_CR16","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."},{"issue":"2","key":"29_CR17","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1137\/130942954","volume":"7","author":"P Ochs","year":"2014","unstructured":"Ochs, P., Chen, Y., Brox, T., Pock, T.: iPiano: inertial proximal algorithm for nonconvex optimization. SIAM J. Imaging Sci. 7(2), 1388\u20131419 (2014)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"29_CR18","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1137\/20M1387961","volume":"14","author":"JC Pesquet","year":"2021","unstructured":"Pesquet, J.C., Repetti, A., Terris, M., Wiaux, Y.: Learning maximally monotone operators for image recovery. SIAM J. Imaging Sci. 14(3), 1206\u20131237 (2021)","journal-title":"SIAM J. Imaging Sci."},{"issue":"4","key":"29_CR19","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.1137\/16M1102884","volume":"10","author":"Y Romano","year":"2017","unstructured":"Romano, Y., Elad, M., Milanfar, P.: The little engine that could: regularization by denoising (red). SIAM J. Imaging Sci. 10(4), 1804\u20131844 (2017)","journal-title":"SIAM J. Imaging Sci."},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"LI Rudin","year":"1992","unstructured":"Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Phys. D 60, 259\u2013268 (1992)","journal-title":"Phys. D"},{"key":"29_CR21","unstructured":"Ryu, E., Liu, J., Wang, S., Chen, X., Wang, Z., Yin, W.: Plug-and-play methods provably converge with properly trained denoisers. In: International Conference on Machine Learning, pp. 5546\u20135557 (2019)"},{"key":"29_CR22","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1109\/TCI.2021.3094062","volume":"7","author":"Y Sun","year":"2021","unstructured":"Sun, Y., Wu, Z., Xu, X., Wohlberg, B., Kamilov, U.S.: Scalable plug-and-play ADMM with convergence guarantees. IEEE Trans. Comput. Imaging 7, 849\u2013863 (2021)","journal-title":"IEEE Trans. Comput. Imaging"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Terris, M., Repetti, A., Pesquet, J.C., Wiaux, Y.: Building firmly nonexpansive convolutional neural networks. In: IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 8658\u20138662 (2020)","DOI":"10.1109\/ICASSP40776.2020.9054731"},{"issue":"1","key":"29_CR24","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/18M1163993","volume":"30","author":"A Themelis","year":"2020","unstructured":"Themelis, A., Patrinos, P.: Douglas-rachford splitting and ADMM for nonconvex optimization: tight convergence results. SIAM J. Optim. 30(1), 149\u2013181 (2020)","journal-title":"SIAM J. Optim."},{"key":"29_CR25","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. SIAM J. Optim. 2(3) (2008)"},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"Venkatakrishnan, S.V., Bouman, C.A., Wohlberg, B.: Plug-and-play priors for model based reconstruction. In: IEEE Global Conference on Signal and Information Processing, pp. 945\u2013948 (2013)","DOI":"10.1109\/GlobalSIP.2013.6737048"},{"key":"29_CR27","doi-asserted-by":"publisher","first-page":"69883","DOI":"10.1109\/ACCESS.2018.2880454","volume":"6","author":"F Wen","year":"2018","unstructured":"Wen, F., Chu, L., Liu, P., Qiu, R.C.: A survey on nonconvex regularization-based sparse and low-rank recovery in signal processing, statistics, and machine learning. IEEE Access 6, 69883\u201369906 (2018)","journal-title":"IEEE Access"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, K., Li, Y., Zuo, W., Zhang, L., Van Gool, L., Timofte, R.: Plug-and-play image restoration with deep denoiser prior. IEEE Trans. Image Process. (2021)","DOI":"10.1109\/TPAMI.2021.3088914"},{"key":"29_CR29","doi-asserted-by":"crossref","unstructured":"Zhang, K., Zuo, W., Gu, S., Zhang, L.: Learning deep CNN denoiser prior for image restoration. In: IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 3929\u20133938 (2017)","DOI":"10.1109\/CVPR.2017.300"}],"container-title":["Lecture Notes in Computer Science","Scale Space and Variational Methods in Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-31975-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:20:57Z","timestamp":1710246057000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-31975-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031319747","9783031319754"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-31975-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSVM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Scale Space and Variational Methods in Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Margherita di Pula","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scalespace2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eventi.unibo.it\/ssvm2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"79% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}