{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:46:05Z","timestamp":1794336365846,"version":"4.9.0"},"reference-count":59,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003032","name":"Association Nationale de la Recherche et de la Technologie","doi-asserted-by":"publisher","award":["2018\/1587"],"award-info":[{"award-number":["2018\/1587"]}],"id":[{"id":"10.13039\/501100003032","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["MAJORIS ERC-2019-STG- 850925"],"award-info":[{"award-number":["MAJORIS ERC-2019-STG- 850925"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Imaging Sci."],"published-print":{"date-parts":[[2023,3,31]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>Most optimization problems arising in imaging science involve high-dimensional linear operators and their adjoints. In the implementations of these operators, changes may be introduced for various practical considerations (e.g., memory limitation, computational cost, convergence speed), leading to an adjoint mismatch. This occurs for the X-ray tomographic inverse problems found in computed tomography (CT), where a surrogate operator often replaces the adjoint of the measurement operator (called the projector). The resulting adjoint mismatch can jeopardize the convergence properties of iterative schemes used for image recovery. In this paper, we study the theoretical behavior of a panel of primal-dual proximal algorithms, which rely on forward-backward-(forward) splitting schemes when an adjoint mismatch occurs. We analyze these algorithms by focusing on the resolution of possibly nonsmooth convex penalized minimization problems in an infinite-dimensional setting. Using tools from fixed point theory, we show that they can solve monotone inclusions beyond minimization problems. Such findings indicate that these algorithms can be seen as a generalization of classical primal-dual formulations. The applicability of our findings is also demonstrated through two numerical experiments in the context of CT image reconstruction.<\/jats:p>","DOI":"10.1137\/22m1490223","type":"journal-article","created":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T09:57:45Z","timestamp":1673949465000},"page":"1-34","source":"Crossref","is-referenced-by-count":10,"title":["Convergence Results for Primal-Dual Algorithms in the Presence of Adjoint Mismatch"],"prefix":"10.1137","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3631-6093","authenticated-orcid":true,"given":"Emilie","family":"Chouzenoux","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, Centrale Sup\u00e9lec, Centre pour la Vision Num\u00e9rique, Inria, Gif-sur-Yvette 91190, France."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0522-8912","authenticated-orcid":true,"given":"Andr\u00e9s","family":"Contreras","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, Centrale Sup\u00e9lec, Centre pour la Vision Num\u00e9rique, Inria, Gif-sur-Yvette 91190, France."},{"name":"Corresponding author: Departamento de Ciencias Matem\u00e1ticas y F\u00edsicas, Facultad de Ingenier\u00eda, Universidad Cat\u00f3lica de Temuco, 4813302 Temuco, Chile."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5943-8061","authenticated-orcid":true,"given":"Jean-Christophe","family":"Pesquet","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, Centrale Sup\u00e9lec, Centre pour la Vision Num\u00e9rique, Inria, Gif-sur-Yvette 91190, France."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6051-962X","authenticated-orcid":true,"given":"Marion","family":"Savanier","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, Centrale Sup\u00e9lec, Centre pour la Vision Num\u00e9rique, Inria, Gif-sur-Yvette 91190, France."},{"name":"GE Healthcare, Buc, France."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/130950616"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492919000059"},{"key":"ref3","unstructured":"S. Banert , \nJ. Rudzusika , \nO. \u00d6ktem , and \nJ. Adler , Accelerated Forward-Backward Optimization Using Deep Learning, preprint, arXiv:2105.05210, 2021."},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/12088255X"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1137\/120901106"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-013-0486-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-018-1430-2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/10081602X"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/20M1343075"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41589-5_10"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/17M1122451"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/23\/4\/008"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/29\/2\/025011"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/15M1014395"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/abd85c"},{"key":"ref19","doi-asserted-by":"crossref","unstructured":"P. Combettes  and \nJ.C. Pesquet , Proximal Splitting Methods in Signal Processing, Springer-Verlag, New York, 2010, pp. 185\u2013212.","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s11228-019-00526-z"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3069677"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s11228-011-0191-y"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/050626090"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-012-0245-9"},{"key":"ref26","unstructured":"L. Condat , \nD. Kitahara , \nA. Contreras , and \nA. Hirabayashi , Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists, preprint, arXiv:1912.00137, 2019."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/18M1206448"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2015.02.001"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/17M1133828"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/09076934X"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(76)90003-1"},{"key":"ref42","unstructured":"K. M. Per Christian Hansen  and \nKen Hayami , GMRES Methods for Tomographic Reconstruction with an Unmatched Back Projector, Technical report, 2022, https:\/\/arxiv.org\/pdf\/2110.01481.pdf."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2021.09.004"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719277"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2377273"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729694"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10543-018-0717-x"},{"key":"ref39","doi-asserted-by":"crossref","unstructured":"D. A. Lorenz  and \nF. Schneppe , Chambolle-Pock\u2019s Primal-Dual Method with Mismatched Adjoint, preprint, arXiv:2201.04928, 2022.","DOI":"10.1007\/s00245-022-09933-5"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/12\/125007"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1088\/0031-9155\/58\/12\/R63"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/20M1387961"},{"key":"ref45","volume-title":"SPARS, 2019 - Signal Processing with Adaptive Sparse Structured Representations Workshop","author":"Ramzi Z.","year":"2019"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TCI.2022.3140551"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1088\/0031-9155\/40\/2\/005"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(92)90242-F"},{"key":"ref49","unstructured":"H. Sadeghi , \nS. Banert , and \nP. Giselsson , Forward-backward splitting with deviations for monotone inclusions, preprint, arXiv:2112.00776, 2021."},{"key":"ref50","doi-asserted-by":"crossref","unstructured":"M. Savanier , \nE. Chouzenoux , \nJ.C. Pesquet , and \nC. Riddell , Unmatched preconditioning of the proximal gradient algorithm, Optimization Online, 2022, https:\/\/optimization-online.org\/?p=18561.","DOI":"10.1109\/LSP.2022.3169088"},{"key":"ref51","doi-asserted-by":"crossref","unstructured":"E. Y. Sidky , \nP. C. Hansen , \nJ. S. J\u00f8rgensen , and \nX. Pan , Iterative Image Reconstruction for CT with Unmatched Projection Matrices Using the Generalized Minimal Residual Algorithm, preprint, https:\/\/arxiv.org\/abs\/2201.07408, 2022.","DOI":"10.1117\/12.2646511"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1088\/0031-9155\/57\/10\/3065"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012998338806"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1364\/OE.24.025129"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.ultramic.2015.05.002"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s10444-011-9254-8"},{"key":"ref32","unstructured":"F. Xu  and \nK. Mueller , A comparative study of popular interpolation and integration methods for use in computed tomography, in Proceedings of the 3rd IEEE International Symposium on Biomedical Imaging: Nano to Macro, IEEE, Washington, DC, 2006, pp. 1252\u20131255."},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/NSSMIC.1993.701833"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s42058-019-00006-1"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/42.870265"}],"container-title":["SIAM Journal on Imaging Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/22M1490223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:51:14Z","timestamp":1787316674000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/22M1490223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,19]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3,31]]}},"alternative-id":["10.1137\/22M1490223"],"URL":"https:\/\/doi.org\/10.1137\/22m1490223","relation":{},"ISSN":["1936-4954"],"issn-type":[{"value":"1936-4954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,19]]}}}