* [ABC23] Hedy Attouch, Radu Ioan Boţ, and Ernö Robert Csetnek.  Fast optimization via inertial dynamics with closed-loop damping.  Journal of European Mathematical Society, 25:1985–2056, 2023.
  * [AC09] Nir Ailon and Bernard Chazelle.  The fast johnson-lindenstrauss transform and approximate nearest neighbors.  SIAM Journal on Computing, 39(1):302–322, 2009.
  * [AD15] J-F Aujol and Ch Dossal.  Stability of over-relaxations for the forward-backward algorithm, application to fista.  SIAM Journal on Optimization, 25(4):2408–2433, 2015.
  * [ADG+16] Marcin Andrychowicz, Misha Denil, Sergio Gomez, Matthew W Hoffman, David Pfau, Tom Schaul, Brendan Shillingford, and Nando De Freitas.  Learning to learn by gradient descent by gradient descent.  Advances in neural information processing systems, 29, 2016.
  * [AET21] Simon R. Arridge, Matthias J. Ehrhardt, and Kris Thielemans.  (an overview of) synergistic reconstruction for multimodality/multichannel imaging methods.  Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 379:20200205, 2021.
  * [AF03] Sangtae Ahn and Jeffrey A. Fessler.  Globally convergent image reconstruction for emission tomography using relaxed ordered subsets algorithms.  IEEE Transactions on Medical Imaging, 22:613–626, 2003.
  * [AFC22] Ahmet Alacaoglu, Olivier Fercoq, and Volkan Cevher.  On the convergence of stochastic primal-dual hybrid gradient.  SIAM Journal on Optimization, 32(2):1288–1318, 2022.
  * [AH97] Simon R Arridge and Jeremy C Hebden.  Optical imaging in medicine: Ii. modelling and reconstruction.  Physics in Medicine & Biology, 42(5):841, 1997.
  * [AL08] Nir Ailon and Edo Liberty.  Fast dimension reduction using rademacher series on dual bch codes.  Discrete & Computational Geometry, 42(4):615–630, 2008.
  * [AMOS19] Simon Arridge, Peter Maass, Ozan Öktem, and Carola-Bibiane Schönlieb.  Solving inverse problems using data-driven models.  Acta Numerica, 28:1–174, 2019.
  * [And65] Donald G. Anderson.  Iterative procedures for nonlinear integral equations.  Journal of the ACM, 12(4):547–560, 1965.
  * [AXK17] Brandon Amos, Lei Xu, and J Zico Kolter.  Input convex neural networks.  In International Conference on Machine Learning, pages 146–155. PMLR, 2017.
  * [AZ17] Zeyuan Allen-Zhu.  Katyusha: The first direct acceleration of stochastic gradient methods.  The Journal of Machine Learning Research, 18(1):8194–8244, 2017\.
  * [BAL+24] Riccardo Barbano, Javier Antoran, Johannes Leuschner, José Miguel Hernández-Lobato, Bangti Jin, and Zeljko Kereta.  Image reconstruction via deep image prior subspaces.  Transactions on Machine Learning Research, 2024.
  * [Bar00] Johnathan M Bardsley.  A Theoretical Framework for the Regularization of Poisson Liklihood Estimation Problems.  Inverse Problems and Imaging, 4(1):11–17, 2000.
  * [BB98] Mario Bertero and Patrizia Boccacci.  Introduction to Inverse Problems in Imaging.  CRC Press, 1998.
  * [BB09] Markus Bachmayr and Martin Burger.  Iterative total variation schemes for nonlinear inverse problems.  Inverse Problems, 25(10):26, 2009.
  * [BB18] Martin Benning and Martin Burger.  Modern regularization methods for inverse problems.  Acta Numerica, 27:1–111, 2018.
  * [BBES21] Martin Benning, Marta M. Betcke, Matthias J. Ehrhardt, and Carola-Bibiane Schönlieb.  Choose your path wisely: Gradient descent in a Bregman distance framework.  SIAM Journal on Imaging Sciences, 14:814–843, 2021.
  * [BBM+01] David A Boas, Dana H Brooks, Eric L Miller, Charles A DiMarzio, Misha Kilmer, Richard J Gaudette, and Quan Zhang.  Imaging the body with diffuse optical tomography.  IEEE Signal Processing Magazine, 18(6):57–75, 2001.
  * [BBM23] Stefania Bellavia, Tommaso Bianconcini, and Benedetta Morini.  Subsampled First-Order Optimization Methods with Applications in Imaging.  Springer International Publishing, 2023.
  * [BBRS17] Eva-Maria Brinkmann, Martin Burger, Julian Rasch, and Camille Sutour.  Bias-Reduction in Variational Regularization.  Journal of Mathematical Imaging and Vision, 59:534–566, 2017.
  * [BBT17] Heinz H Bauschke, Jérôme Bolte, and Marc Teboulle.  A descent lemma beyond Lipschitz gradient continuity: First-order methods revisited and applications.  Mathematics of Operations Research, 42(2):330–348, 2017.
  * [BC11] Heinz H Bauschke and Patrick L. Combettes.  Convex analysis and monotone operator theory in Hilbert spaces, volume 408.  Springer, 2011.
  * [BCN18] Léon Bottou, Frank E. Curtis, and Jorge Nocedal.  Optimization methods for large-scale machine learning.  SIAM Rev., 60(2):223–311, 2018.
  * [BCNW12] Richard H Byrd, Gillian M Chin, Jorge Nocedal, and Yuchen Wu.  Sample size selection in optimization methods for machine learning.  Mathematical programming, 134(1):127–155, 2012.
  * [Bec17] Amir Beck.  First-order methods in optimization.  SIAM, 2017.
  * [Ber11] Dimitri P. Bertsekas.  Incremental proximal methods for large scale convex optimization.  Mathematical Programming, 129:163–195, 2011.
  * [BHG07] Doron Blatt, Alfred O. Hero, and Hillel Gauchman.  A convergent incremental gradient method with a constant step size.  SIAM Journal on Optimization, 18:29–51, 2007.
  * [BHNS16] R. H. Byrd, S. L. Hansen, J. Nocedal, and Y. Singer.  A stochastic quasi-Newton method for large-scale optimization.  SIAM Journal on Optimization, 26(2):1008–1031, 2016.
  * [Bia16] Pascal Bianchi.  Ergodic convergence of a stochastic proximal point algorithm.  SIAM Journal on Optimization, 26(4):2235–2260, 2016.
  * [BKP10] Kristian Bredies, Karl Kunisch, and Thomas Pock.  Total generalized variation.  SIAM Journal on Imaging Sciences, 3(3):492–526, 2010.
  * [BL18] Kristian Bredies and Dirk A Lorenz.  Mathematical Image Processing.  Birkhäuser Basel, 2018.
  * [BLS20] Daniel Otero Baguer, Johannes Leuschner, and Maximilian Schmidt.  Computed tomography reconstruction using deep image prior and learned reconstruction methods.  Inverse Problems, 36(9):094004, 2020.
  * [BO13] Martin Burger and Stanley Osher.  A guide to the tv zoo.  In Level Set and PDE Based Reconstruction Methods in Imaging, Editors: Martin Burger, Stanley Osher, pages 1–70. Springer International Publishing, 2013.
  * [BPC+11] Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein.  Distributed optimization and statistical learning via the alternating direction method of multipliers.  Foundations and Trends® in Machine learning, 3(1):1–122, 2011.
  * [BRA+20] Sebastian Banert, Axel Ringh, Jonas Adler, Johan Karlsson, and Ozan Oktem.  Data-driven nonsmooth optimization.  SIAM Journal on Optimization, 30(1):102–131, 2020.
  * [Bre67] Lev M Bregman.  The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming.  USSR Computational Mathematics and Mathematical Physics, 7(3):200–217, 1967.
  * [BRH17] Lucas Balles, Javier Romero, and Philipp Hennig.  Coupling adaptive batch sizes with learning rates.  In Proceedings of the 33rd Conference on Uncertainty in Artificial Intelligence 2017, pages 675–684, 2017.
  * [Bro70] Charles George Broyden.  The convergence of a class of double-rank minimization algorithms: 2. The new algorithm.  IMA Journal of Applied Mathematics, 6:222–231, 1970.
  * [BSS16] Martin Burger, Alexander Sawatzky, and Gabriele Steidl.  First order algorithms in variational image processing.  In Splitting Methods in Communication, Imaging, Science, and Engineering, pages 345–407. Springer International Publishing, Cham, 2016.
  * [BT09] Amir Beck and Marc Teboulle.  Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems.  IEEE Transactions on Image Processing, 18(11):2419–2434, 2009.
  * [BT13] Amir Beck and Luba Tetruashvili.  On the convergence of block coordinate descent type methods.  SIAM Journal on Optimization, 23(4):2037–2060, 2013.
  * [BT15] Dimitri Bertsekas and John Tsitsiklis.  Parallel and distributed computation: numerical methods.  Athena Scientific, 2015.
  * [BU15] Christian Boehm and Michael Ulbrich.  A semismooth Newton-cg method for constrained parameter identification in seismic tomography.  SIAM Journal on Scientific Computing, 37(5):S334–S364, 2015.
  * [Bub15] Sébastien Bubeck.  Convex optimization: Algorithms and complexity.  Foundations and Trends® in Machine Learning, 8(3-4):231–357, 2015.
  * [CBCG04] Nicolo Cesa-Bianchi, Alex Conconi, and Claudio Gentile.  On the generalization ability of on-line learning algorithms.  IEEE Transactions on Information Theory, 50(9):2050–2057, 2004\.
  * [CC22] Antonin Chambolle and Juan Pablo Contreras.  Accelerated Bregman primal-dual methods applied to optimal transport and Wasserstein barycenter problems.  SIAM Journal on Mathematics of Data Science, 4(4):1369–1395, 2022\.
  * [CCC+22] Tianlong Chen, Xiaohan Chen, Wuyang Chen, Howard Heaton, Jialin Liu, Zhangyang Wang, and Wotao Yin.  Learning to optimize: A primer and a benchmark.  Journal of Machine Learning Research, 23(189):1–59, 2022.
  * [CCCP] Giovanni Chierchia, Emilie Chouzenoux, Patrick L. Combettes, and Jean-Christophe Pesquet.  Prox Repository — proximity-operator.net.  https://proximity-operator.net/.  [Accessed 31-05-2024].
  * [CCN07] Vicent Caselles, Antonin Chambolle, and Matteo Novaga.  The discontinuity set of solutions of the TV denoising problem and some extensions.  Multiscale Modeling &; Simulation, 6(3):879–894, 2007.
  * [CD15] Antonin Chambolle and Charles Dossal.  On the convergence of the iterates of the “fast iterative shrinkage/thresholding algorithm”.  Journal of Optimization theory and Applications, 166(3):968–982, 2015.
  * [CDE+24] Antonin Chambolle, Claire Delplancke, Matthias J. Ehrhardt, Carola-Bibiane Schönlieb, and Junqi Tang.  Stochastic primal–dual hybrid gradient algorithm with adaptive step sizes.  Journal of Mathematical Imaging and Vision, 2024.
  * [CERS18] Antonin Chambolle, Matthias J. Ehrhardt, Peter Richtárik, and Carola-Bibiane Schönlieb.  Stochastic primal-dual hybrid gradient algorithm with arbitrary sampling and imaging applications.  SIAM Journal on Optimization, 28:2783–2808, 2018.
  * [CFKS13] Mike Cullen, Melina A Freitag, Stefan Kindermann, and Robert Scheichl, editors.  Large Scale Inverse Problems: Computational Methods and Applications in the Earth Sciences.  De Gruyter, Berlin, Boston, 2013.
  * [CGOT00] Andrew R Conn, Nicholas IM Gould, Dominique Orban, and Philippe L Toint.  A primal-dual trust-region algorithm for non-convex nonlinear programming.  Mathematical programming, 87:215–249, 2000.
  * [Cha04] Antonin Chambolle.  An algorithm for total variation minimization and applications.  Journal of Mathematical Imaging and Vision, 20:89–97, 2004.
  * [CHYY16] Caihua Chen, Bingsheng He, Yinyu Ye, and Xiaoming Yuan.  The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent.  Mathematical Programming, 155(1):57–79, 2016.
  * [CHZ16] Peijun Chen, Jianguo Huang, and Xiaoqun Zhang.  A primal-dual fixed point algorithm for convex separable minimization with applications to image restoration.  Journal of Fixed Point Theory and Applications, pages 1–18, 2016\.
  * [CIN99] Margaret Cheney, David Isaacson, and Jonathan C Newell.  Electrical impedance tomography.  Society for Industrial and Applied Mathematics, 41:85–101, 1999\.
  * [CKCH23] Laurent Condat, Daichi Kitahara, Andrés Contreras, and Akira Hirabayashi.  Proximal splitting algorithms for convex optimization: A tour of recent advances, with new twists.  SIAM Review, 65(2):375–435, 2023.
  * [CKN15] Julianne Chung, Sarah Knepper, and James G. Nagy.  Large-scale inverse problems in imaging.  In Handbook of Mathematical Methods in Imaging, pages 47–90. Springer, 2015.
  * [CL97] Antonin Chambolle and Pierre-Louis Lions.  Image recovery via total variation minimization and related problems.  Numerische Mathematik, 76(2):167–188, 1997.
  * [CLL18] Ke Chen, Qin Li, and Jian-Guo Liu.  Online learning in optical tomography: a stochastic approach.  Inverse Problems, 34(7):075010, 2018.
  * [CM09] Olivier Cappé and Eric Moulines.  On-Line Expectation–Maximization Algorithm for latent Data Models.  Journal of the Royal Statistical Society Series B: Statistical Methodology, 71(3):593–613, 2009.
  * [Con13] Laurent Condat.  A primal–dual splitting method for convex optimization involving lipschitzian, proximable and linear composite terms.  Journal of optimization theory and applications, 158(2):460–479, 2013.
  * [CP07] Patrick L. Combettes and Jean-Christophe Pesquet.  A Douglas–Rachford splitting approach to nonsmooth convex variational signal recovery.  IEEE Journal of Selected Topics in Signal Processing, 1(4):564–574, 2007.
  * [CP11a] Antonin Chambolle and Thomas Pock.  A first-order primal-dual algorithm for convex problems with applications to imaging.  Journal of Mathematical Imaging and Vision, 40(1):120–145, 2011\.
  * [CP11b] Patrick L. Combettes and Jean-Christophe Pesquet.  Proximal splitting methods in signal processing.  Fixed-point algorithms for inverse problems in science and engineering, pages 185–212, 2011.
  * [CP12] Patrick L. Combettes and Jean-Christophe Pesquet.  Primal-dual splitting algorithm for solving inclusions with mixtures of composite, lipschitzian, and parallel-sum type monotone operators.  Set-Valued and variational analysis, 20(2):307–330, 2012.
  * [CP16] Antonin Chambolle and Thomas Pock.  An introduction to continuous optimization for imaging.  Acta Numerica, 25:161–319, 2016.
  * [CR23] Laurent Condat and Peter Richtárik.  Randprox: Primal-dual optimization algorithms with randomized proximal updates.  In The Eleventh International Conference on Learning Representations, 2023.
  * [CV14] Patrick L. Combettes and Băng C Vũ.  Variable metric forward–backward splitting with applications to monotone inclusions in duality.  Optimization, 63(9):1289–1318, 2014.
  * [CW05] Patrick L. Combettes and Valérie R Wajs.  Signal recovery by proximal forward-backward splitting.  Multiscale Modeling & Simulation, 4(4):1168–1200, 2005.
  * [CW13] Kenneth L Clarkson and David P Woodruff.  Low rank approximation and regression in input sparsity time.  In Proceedings of the forty-fifth annual ACM symposium on Theory of computing, pages 81–90. ACM, 2013.
  * [CZTZ18] Jianfei Chen, Jun Zhu, Yee Whye Teh, and Tong Zhang.  Stochastic expectation maximization with variance reduction.  In S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 31. Curran Associates, Inc., 2018.
  * [CZX+21] Buxin Chen, Zheng Zhang, Dan Xia, Emil Y Sidky, and Xiaochuan Pan.  Non-convex primal-dual algorithm for image reconstruction in spectral CT.  Computerized Medical Imaging and Graphics, 87:101821, 2021.
  * [DBLJ14] Aaron Defazio, Francis Bach, and Simon Lacoste-Julien.  Saga: A fast incremental gradient method with support for non-strongly convex composite objectives.  In Advances in Neural Information Processing Systems, volume 2, pages 1646–1654, 2014.
  * [DCE24] Margaret Duff, Neill D.F. Campbell, and Matthias J. Ehrhardt.  Regularising inverse problems with generative machine learning models.  Journal of Mathematical Imaging and Vision, 66(1):37–56, 2024.
  * [Def15] Aaron Defazio.  New Optimisation Methods for Machine Learning.  PhD thesis, The Australian National University, 2015.
  * [DES22] Derek Driggs, Matthias J. Ehrhardt, and Carola-Bibiane Schönlieb.  Accelerating variance-reduced stochastic gradient methods.  Mathematical Programming, 23(1):1–45, 2022.
  * [DHS11] John Duchi, Elad Hazan, and Yoram Singer.  Adaptive subgradient methods for online learning and stochastic optimization.  Journal of machine learning research, 12(7), 2011.
  * [DLLM23] Ryan D’Orazio, Nicolas Loizou, Issam H. Laradji, and Ioannis Mitliagkas.  Stochastic mirror descent: Convergence analysis and adaptive variants via the mirror stochastic Polyak stepsize.  Transactions on Machine Learning Research, 2023.
  * [DLS22] Derek Driggs, Jingwei Liang, and Carola-Bibiane Schönlieb.  On biased stochastic gradient estimation.  The Journal of Machine Learning Research, 23(1):1057–99, 2022.
  * [DM23] Aaron Defazio and Konstantin Mishchenko.  Learning-rate-free learning by d-adaptation.  In International Conference on Machine Learning, pages 7449–7479. PMLR, 2023.
  * [DMM06] Petros Drineas, Michael W Mahoney, and S Muthukrishnan.  Sampling algorithms for $\ell_{2}$-regression and applications.  In Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 1127–1136, 2006.
  * [DNG17] Aditya Devarakonda, Maxim Naumov, and Michael Garland.  Adabatch: Adaptive batch sizes for training deep neural networks.  arXiv preprint arXiv:1712.02029, 2017.
  * [dST21] Alexandre d’Aspremont, Damien Scieur, and Adrien Taylor.  Acceleration methods.  Foundations and Trends® in Optimization, 5(1-2):1–245, 2021.
  * [DTL+21] Derek Driggs, Junqi Tang, Jingwei Liang, Mike Davies, and Carola-Bibiane Schonlieb.  A stochastic proximal alternating minimization for nonsmooth and nonconvex optimization.  SIAM Journal on Imaging Sciences, 14(4):1932–1970, 2021.
  * [DY17] Damek Davis and Wotao Yin.  A three-operator splitting scheme and its optimization applications.  Set-Valued and Variational Analysis, pages 829–858, 2017.
  * [EB92] Jonathan Eckstein and Dimitri P Bertsekas.  On the douglas—rachford splitting method and the proximal point algorithm for maximal monotone operators.  Mathematical programming, 55:293–318, 1992.
  * [EB16] Matthias J. Ehrhardt and Marta M. Betcke.  Multi-contrast MRI reconstruction with structure-guided total variation.  SIAM Journal on Imaging Sciences, 9:1084–1106, 2016.
  * [EFG24] Matthias J. Ehrhardt, Patrick Fahy, and Mohammad Golbabaee.  Learning preconditioners for inverse problems, 2024.  arXiv:2406.00260.
  * [Ehr23] Matthias J. Ehrhardt.  Multi-modality imaging with structure-promoting regularizers.  In Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging: Mathematical Imaging and Vision, pages 235–272. Springer, 2023.
  * [EM15] Murat A Erdogdu and Andrea Montanari.  Convergence rates of sub-sampled Newton methods.  In C. Cortes, N. Lawrence, D. Lee, M. Sugiyama, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 28, 2015\.
  * [EMS19] Matthias J. Ehrhardt, Pawel J. Markiewicz, and Carola-Bibiane Schönlieb.  Faster pet reconstruction with non-smooth priors by randomization and preconditioning.  Physics in Medicine & Biology, 64:225019, 2019.
  * [FB19] Olivier Fercoq and Pascal Bianchi.  A coordinate descent primal-dual algorithm with large step size and possibly non-separable functions.  SIAM Journal on Optimization, 29:100–134, 2019.
  * [Fes10] Jeffrey Fessler.  Model-based image reconstruction for MRI.  IEEE Signal Processing Magazine, 27(4):81–89, 2010.
  * [FG98] Anders Forsgren and Philip E Gill.  Primal-dual interior methods for nonconvex nonlinear programming.  SIAM Journal on Optimization, 8(4):1132–1152, 1998.
  * [Fle70] Roger Fletcher.  A new approach to variable metric algorithms.  The Computer Journal, 13(3):317–322, 1970.
  * [FLLZ18] Cong Fang, Chris J. Li, Zhouchen Lin, and Tong Zhang.  Spider: Near-optimal non-convex optimization via stochastic path-integrated differential estimator.  Advances in neural information processing systems, 31, 2018.
  * [FQ20] Olivier Fercoq and Zheng Qu.  Restarting the accelerated coordinate descent method with a rough strong convexity estimate.  Computational Optimization and Applications, 75:63–91, 2020.
  * [FR15] Olivier Fercoq and Peter Richtárik.  Accelerated, parallel, and proximal coordinate descent.  SIAM Journal on Optimization, 25(4):1997–2023, 2015.
  * [GB18] Yushan Gao and Thomas Blumensath.  A joint row and column action method for cone-beam computed tomography.  IEEE Transactions on Computational Imaging, 4:599–608, 2018.
  * [GDE21] Eric B. Gutiérrez, Claire Delplancke, and Matthias J. Ehrhardt.  Convergence properties of a randomized primal-dual algorithm with applications to parallel mri.  In Abderrahim Elmoataz, Jalal Fadili, Yvain Quéau, Julien Rabin, and Loïc Simon, editors, Scale Space and Variational Methods in Computer Vision, pages 254–266. Springer, 2021.
  * [GDE22] Eric B. Gutierrez, Claire Delplancke, and Matthias J. Ehrhardt.  On the convergence and sampling of randomized primal-dual algorithms and their application to parallel mri reconstruction, 2022.  arXiv:2207.12291.
  * [GL12] Saeed Ghadimi and Guanghui Lan.  Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization I: A generic algorithmic framework.  SIAM Journal on Optimization, 22(4):1469–1492, 2012.
  * [GLQ+19] Robert Mansel Gower, Nicolas Loizou, Xun Qian, Alibek Sailanbayev, Egor Shulgin, and Peter Richtárik.  Sgd: General analysis and improved rates.  In International conference on machine learning, pages 5200–5209. PMLR, 2019.
  * [GLY+13] Tom Goldstein, Min Li, Xiaoming Yuan, Ernie Esser, and Richard Baraniuk.  Adaptive primal-dual hybrid gradient methods for saddle-point problems, 2013.  arXiv:1305.0546.
  * [GLY15] Tom Goldstein, Min Li, and Xiaoming Yuan.  Adaptive primal-dual splitting methods for statistical learning and image processing.  Advances in Neural Information Processing Systems, 28, 2015.
  * [GM75] Roland Glowinski and Americo Marroco.  Sur l’approximation, par éléments finis d’ordre un, et la résolution, par pénalisation-dualité d’une classe de problèmes de dirichlet non linéaires.  Revue française d’automatique, informatique, recherche opérationnelle. Analyse numérique, 9(R2):41–76, 1975.
  * [GM76] Daniel Gabay and Bertrand Mercier.  A dual algorithm for the solution of nonlinear variational problems via finite element approximation.  Computers & Mathematics with Applications, 2(1):17–40, 1976.
  * [GNB+22] Alexis Goujon, Sebastian Neumayer, Pakshal Bohra, Stanislas Ducotterd, and Michael Unser.  A neural-network-based convex regularizer for image reconstruction, 2022\.  arXiv:2211.12461.
  * [Gol70] Donald Goldfarb.  A family of variable-metric methods derived by variational means.  Mathematics of Computation, 24(109):23–26, 1970.
  * [GOPV17] Mert Gurbuzbalaban, Asuman Ozdaglar, Pablo A Parrilo, and Nuri Vanli.  When cyclic coordinate descent outperforms randomized coordinate descent.  In I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 30, 2017.
  * [GR15] Robert M Gower and Peter Richtárik.  Randomized iterative methods for linear systems.  SIAM Journal on Matrix Analysis and Applications, 36(4):1660–1690, 2015.
  * [GRV18] Guillaume Garrigos, Lorenzo Rosasco, and Silvia Villa.  Iterative regularization via dual diagonal descent.  Journal of Mathematical Imaging and Vision, 60:189–215, 2018.
  * [GSBR20] Robert M. Gower, Mark Schmidt, Francis Bach, and Peter Richtárik.  Variance-reduced methods for machine learning.  Proceedings of the IEEE, 108(11):1968–1983, 2020.
  * [HCHY23] Yixiao Hu, Lihui Chai, Zhongyi Huang, and Xu Yang.  Seismic tomography with random batch gradient reconstruction.  SIAM Journal on Scientific Computing, 45(3):B314–B336, 2023.
  * [HH14] Thorsten Hohage and Carolin Homann.  A generalization of the Chambolle-Pock algorithm to Banach spaces with applications to inverse problems, 2014.  arXiv:1412.0126.
  * [HJL21] Per Christian Hansen, Jakob Jørgensen, and William R B Lionheart.  Computed Tomography: Algorithms, Insight, and Just Enough Theory.  Society for Industrial and Applied Mathematics, 2021.
  * [HLP21] Samuel Hurault, Arthur Leclaire, and Nicolas Papadakis.  Gradient step denoiser for convergent plug-and-play.  In International Conference on Learning Representations, 2021.
  * [HM93] Gabor T. Herman and Lorraine B. Meyer.  Algebraic reconstruction techniques can be made computationally efficient (positron emission tomography application).  IEEE Transactions on Medical Imaging, 12(3):600–609, 1993.
  * [HNS95] Martin Hanke, Andreas Neubauer, and Otmar Scherzer.  A convergence analysis of the Landweber iteration for nonlinear ill-posed problems.  Numerische Mathematik, 72(1):21–37, 1995.
  * [HÖS21] Andreas Hauptmann, Ozan Öktem, and Carola Schönlieb.  Image reconstruction in dynamic inverse problems with temporal models.  In Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging: Mathematical Imaging and Vision, pages 1–31. Springer, 2021\.
  * [HPAT22] Niko Hänninen, Aki Pulkkinen, Simon R. Arridge, and Tanja Tarvainen.  Adaptive stochastic Gauss–Newton method with optical Monte Carlo for quantitative photoacoustic tomography.  Journal of Biomedical Optics, 27(8):083013, 2022.
  * [HRX21] Filip Hanzely, Peter Richtarik, and Lin Xiao.  Accelerated Bregman proximal gradient methods for relatively smooth convex optimization.  Computational Optimization and Applications, 79:405–440, 2021.
  * [HTPW22] Jiang Hu, Tonghua Tian, Shaohua Pan, and Zaiwen Wen.  On the local convergence of the semismooth Newton method for composite optimization, 2022.  arXiv:2211.01127.
  * [HW16] Thorsten Hohage and Frank Werner.  Inverse problems with Poisson data: statistical regularization theory, applications and algorithms.  Inverse Problems, 32(6), 2016.
  * [HY12] Bingsheng He and Xiaoming Yuan.  Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective.  SIAM Journal on Imaging Sciences, 5(1):119–149, 2012.
  * [IJ14] Kazufumi Ito and Bangti Jin.  Inverse Problems - Tikhonov Theory and Algorithms.  World Scientific, 2014.
  * [JK23] Bangti Jin and Željko Kereta.  On the convergence of stochastic gradient descent for linear inverse problems in Banach spaces.  SIAM Journal on Imaging Sciences, 16(2):671–705, 2023.
  * [JL18] Bangti Jin and Xiliang Lu.  On the regularizing property of stochastic gradient descent.  Inverse Problems, 35(1):015004, 2018.
  * [JLZ23] Qinian Jin, Xiliang Lu, and Liuying Zhang.  Stochastic mirror descent method for linear ill-posed problems in Banach spaces.  Inverse Problems, 39(6):065010, 2023.
  * [JV22] Xin Jiang and Lieven Vandenberghe.  Bregman primal–dual first-order method and application to sparse semidefinite programming.  Computational Optimization and Applications, 81(1):127–159, 2022\.
  * [JV23] Xin Jiang and Lieven Vandenberghe.  Bregman three-operator splitting methods.  Journal of Optimization Theory and Applications, 196:936–972, 2023\.
  * [JZ13] Rie Johnson and Tong Zhang.  Accelerating stochastic gradient descent using predictive variance reduction.  In C J C Burges, L Bottou, M Welling, Z Ghahramani, and K Q Weinberger, editors, Advances in Neural Information Processing Systems, volume 26, 2013.
  * [JZZ21] Bangti Jin, Zehui Zhou, and Jun Zou.  On the saturation phenomenon of stochastic gradient descent for linear inverse problems.  SIAM/ASA Journal on Uncertainty Quantification, 9(4):1553–1588, 2021.
  * [JZZ22] Bangti Jin, Zehui Zhou, and Jun Zou.  An analysis of stochastic variance reduced gradient for linear inverse problems.  Inverse Problems, 38(2):025009, 2022.
  * [Kan60] Leonid V. Kantorovich.  Mathematical methods of organizing and planning production.  Management science, 6(4):366–422, 1960.
  * [KB15] Diederik P Kingma and Jimmy Ba.  Adam: A method for stochastic optimization.  Proceedings of 3rd International Conference on Learning Representations, 2015.
  * [KHR20] Dmitry Kovalev, Samuel Horváth, and Peter Richtárik.  Don’t jump through hoops and remove those loops: SVRG and Katyusha are better without the outer loop.  In Aryeh Kontorovich and Gergely Neu, editors, Proceedings of the 31st International Conference on Algorithmic Learning Theory, volume 117 of Proceedings of Machine Learning Research, pages 451–467. PMLR, 2020\.
  * [KR17] Jakub Konečnỳ and Peter Richtárik.  Semi-stochastic gradient descent methods.  Frontiers in Applied Mathematics and Statistics, 3:9, 2017.
  * [KTA+21] Željko Kereta, Robert Twyman, Simon Arridge, Kris Thielemans, and Bangti Jin.  Stochastic EM methods with variance reduction for penalised PET reconstructions.  Inverse Problems, 37(11):115006, 2021.
  * [KW17] Davood Karimi and Rabab K. Ward.  Image reconstruction in computed tomography using variance-reduced stochastic gradient descent.  In 2017 IEEE 14th International Symposium on Biomedical Imaging (ISBI 2017), pages 543–547, 2017.
  * [KWML19] Belhal Karimi, Hoi-To Wai, Eric Moulines, and Marc Lavielle.  On the global convergence of (fast) incremental expectation maximization methods.  In H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alché-Buc, E. Fox, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 32. Curran Associates, Inc., 2019.
  * [Lan51] Louis Landweber.  An iteration formula for Fredholm integral equations of the first kind.  American Journal of Mathematics, 73(3):615–624, 1951.
  * [LKEC23] Marta Lazzaretti, Zeljko Kereta, Claudio Estatico, and Luca Calatroni.  Stochastic gradient descent for linear inverse problems in variable exponent Lebesgue spaces.  In Luca Calatroni, Marco Donatelli, Serena Morigi, Marco Prato, and Matteo Santacesaria, editors, Scale Space and Variational Methods in Computer Vision, pages 457–470. Springer, 2023.
  * [LM79] Pierre-Louis Lions and Bertrand Mercier.  Splitting algorithms for the sum of two nonlinear operators.  SIAM Journal on Numerical Analysis, 16(6):964–979, 1979.
  * [LM16] Ke Li and Jitendra Malik.  Learning to optimize.  In International Conference on Learning Representations, 2016.
  * [LMH15] Hongzhou Lin, Julien Mairal, and Zaid Harchaoui.  A universal catalyst for first-order optimization.  In Advances in Neural Information Processing Systems, pages 3384–3392, 2015.
  * [LN89] Dong C. Liu and Jorge Nocedal.  On the limited memory BFGS method for large scale optimization.  Mathematical Programming, 45:503–528, 1989.
  * [LO13] Adrian S Lewis and Michael L Overton.  Nonsmooth optimization via quasi-Newton methods.  Mathematical Programming, 141:135–163, 2013.
  * [LP17] Puya Latafat and Panagiotis Patrinos.  Asymmetric forward–backward–adjoint splitting for solving monotone inclusions involving three operators.  Computational Optimization and Applications, 68:57–93, 2017.
  * [LSAH20] Housen Li, Johannes Schwab, Stephan Antholzer, and Markus Haltmeier.  NETT: Solving inverse problems with deep neural networks.  Inverse Problems, 36(6):065005, 2020.
  * [LST18] Xudong Li, Defeng Sun, and Kim-Chuan Toh.  A highly efficient semismooth Newton augmented lagrangian method for solving lasso problems.  SIAM Journal on Optimization, 28(1):433–458, 2018.
  * [LST23] Ling Liang, Defeng Sun, and Kim-Chuan Toh.  A squared smoothing Newton method for semidefinite programming, 2023\.  arXiv:2303.05825.
  * [LT92] Zhiquan Luo and Paul Tseng.  On the convergence of the coordinate descent method for convex differentiable minimization.  Journal of Optimization Theory and Applications, 72(1):7–35, 1992\.
  * [LV11] Ignace Loris and Caroline Verhoeven.  On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty.  Inverse Problems, 27(12):125007, 2011.
  * [LXY21] Yanli Liu, Yunbei Xu, and Wotao Yin.  Acceleration of primal–dual methods by preconditioning and simple subproblem procedures.  Journal of Scientific Computing, 86(2):21, 2021.
  * [Mah11] Michael W. Mahoney.  Randomised algorithms for matrices and data.  Foundations and Trends in Machine Learning, 3(2):123–224, 2011\.
  * [MAP20] Callum M Macdonald, Simon Arridge, and Samuel Powell.  Efficient inversion strategies for estimating optical properties with monte carlo radiative transport models.  Journal of Biomedical Optics, 25(8):085002–085002, 2020.
  * [MCJH23] Yumin Ma, Xingju Cai, Bo Jiang, and Deren Han.  Understanding the convergence of the preconditioned PDHG method: A view of indefinite proximal ADMM.  Journal of Scientific Computing, 94, 2023.
  * [Mea20] Alexander Meaney.  X-ray dataset of walnut, 2020.  10.5281/zenodo.4279549.
  * [MHÖ+23] Subhadip Mukherjee, Andreas Hauptmann, Ozan Öktem, Marcelo Pereyra, and Carola-Bibiane Schönlieb.  Learned reconstruction methods with convergence guarantees: A survey of concepts and applications.  IEEE Signal Processing Magazine, 40(1):164–182, 2023.
  * [Mil70] Keith Miller.  Least squares methods for ill-posed problems with a prescribed bound.  SIAM Journal on Mathematical Analysis, 1(1):52–74, 1970.
  * [MMRV21] Cesare Molinari, Mathurin Massias, Lorenzo Rosasco, and Silvia Villa.  Iterative regularization for convex regularizers.  In Arindam Banerjee and Kenji Fukumizu, editors, Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, volume 130, pages 1684–1692, 2021.
  * [MMSR22] Konstantin Mishchenko, Grigory Malinovsky, Sebastian Stich, and Peter Richtarik.  ProxSkip: Yes! Local gradient steps provably lead to communication acceleration! Finally!  In Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato, editors, Proceedings of the 39th International Conference on Machine Learning, volume 162, pages 15750–15769, 2022.
  * [MNJ16] Philipp Moritz, Nishihara Nishihara, and Michael I. Jordan.  A linearly-convergent stochastic L-BFGS algorithm.  In Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, pages 249–258, 2016.
  * [MO19] Mahesh Chandra Mukkamala and Peter Ochs.  Beyond alternating updates for matrix factorization with inertial bregman proximal gradient algorithms.  Advances in Neural Information Processing Systems, 32, 2019.
  * [Mor65] Jean Jacques Moreau.  Proximité et dualité dans un espace hilbertien.  Bulletin de la Société mathématique de France, 93:273–299, 1965\.
  * [MXC+19] Andre Milzarek, Xiantao Xiao, Shicong Cen, Zaiwen Wen, and Michael Ulbrich.  A stochastic semismooth Newton method for nonsmooth nonconvex optimization.  SIAM Journal on Optimization, 29(4):2916–2948, 2019.
  * [Nes83] Yurii Nesterov.  A method of solving a convex programming problem with convergence rate ${O}(1/k^{2})$.  Soviet Mathematics Doklady, 27(2):372–376, 1983.
  * [Nes12] Yurii Nesterov.  Efficiency of coordinate descent methods on huge-scale optimization problems.  SIAM Journal on Optimization, 22(2):341–362, 2012.
  * [Nit14] Atsushi Nitanda.  Stochastic proximal gradient descent with acceleration techniques.  In Advances in Neural Information Processing Systems, pages 1574–1582, 2014.
  * [NLS22] Julie Nutini, Issam Laradji, and Mark Schmidt.  Let’s make block coordinate descent converge faster: Faster greedy rules, message-passing, active-set complexity, and superlinear convergence.  Journal of Machine Learning Research, 23(131):1–74, 2022.
  * [NLST17] Lam M. Nguyen, Jie Liu, Katya Scheinberg, and Martin Takáč.  SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradient.  34th International Conference on Machine Learning, ICML, 2017.
  * [NQYH07] Michael K. Ng, Liqun Qi, Yu-fei Yang, and Yu-mei Huang.  On semismooth Newton’s methods for total variation minimization.  Journal of Mathematical Imaging and Vision, 27:265–276, 2007.
  * [NT14] Deanna Needell and Joel A Tropp.  Paved with good intentions: analysis of a randomized block kaczmarz method.  Linear Algebra and its Applications, 441:199–221, 2014.
  * [NW06] Jorge Nocedal and Stephen J. Wright.  Numerical Optimization.  Springer, 2nd edition, 2006.
  * [OC15] Bredan O’Donoghue and Emmanuel Candes.  Adaptive restart for accelerated gradient schemes.  Foundations of computational mathematics, 15(3):715–732, 2015.
  * [OF97] John M. Ollinger and Jeffrey A. Fessler.  Positron emission tomography.  IEEE Signal Processing Magazine, 14:43–55, 1997.
  * [OOI+24] Julio A Oscanoa, Frank Ong, Siddharth S Iyer, Zhitao Li, Christopher M Sandino, Batu Ozturkler, Daniel B Ennis, Mert Pilanci, and Shreyas S Vasanawala.  Coil sketching for computationally efficient mr iterative reconstruction.  Magnetic resonance in medicine, 91(2):784–802, 2024.
  * [OV20] Daniel O’Connor and Lieven Vandenberghe.  On the equivalence of the primal-dual hybrid gradient method and douglas–rachford splitting.  Mathematical Programming, 179(1):85–108, 2020.
  * [PA21] Alessandro Perelli and Martin S. Andersen.  Regularization by denoising sub-sampled Newton method for spectral ct multi-material decomposition.  Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 379, 2021.
  * [PAD+21] Evangelos Papoutsellis, Evelina Ametova, Claire Delplancke, Gemma Fardell, Jakob S Jørgensen, Edoardo Pasca, Martin Turner, Ryan Warr, William RB Lionheart, and Philip J Withers.  Core Imaging Library-Part ii: multichannel reconstruction for dynamic and spectral tomography.  Philosophical Transactions of the Royal Society A, 379(2204):20200193, 2021.
  * [PB14] Neal Parikh and Stephen Boyd.  Proximal algorithms.  Foundations and trends® in Optimization, 1(3):127–239, 2014.
  * [PC11] Thomas Pock and Antonin Chambolle.  Diagonal preconditioning for first order primal-dual algorithms in convex optimization.  In 2011 International Conference on Computer Vision, pages 1762–1769. IEEE, 2011.
  * [Pol64] Boris T Polyak.  Some methods of speeding up the convergence of iteration methods.  USSR Computational Mathematics and Mathematical Physics, 4(5):1–17, 1964.
  * [Pow71] Micheal JD Powell.  On the convergence of the variable metric algorithm.  IMA Journal of Applied Mathematics, 7(1):21–36, 1971.
  * [PRFB17] Ali Punjani, John L. Rubinstein, David J. Fleet, and Marcus A. Brubaker.  cryoSPARC: algorithms for rapid unsupervised cryo-EM structure determination.  Nature Methods, 14(3):290 – 296, 2017.
  * [PW16] Mert Pilanci and Martin J Wainwright.  Iterative hessian sketch: Fast and accurate solution approximation for constrained least-squares.  Journal of Machine Learning Research, 17(1):1842–1879, 2016.
  * [PW17] Mert Pilanci and Martin J Wainwright.  Newton sketch: A near linear-time optimization algorithm with linear-quadratic convergence.  SIAM Journal on Optimization, 27(1):205–245, 2017.
  * [PY01] Alvaro R De Pierro and Michel Eduardo Beleza Yamagishi.  Fast em-like methods for maximum ”a posteriori” estimates in emission tomography.  IEEE Transactions on Medical Imaging, 20, 2001.
  * [QRZ15] Zheng Qu, Peter Richtárik, and Tong Zhang.  Quartz: Randomized dual coordinate ascent with arbitrary sampling.  Advances in neural information processing systems, 28, 2015.
  * [QS93] Liqun Qi and Jie Sun.  A nonsmooth version of Newton’s method.  Mathematical Programming, 58:353–367, 1993.
  * [RB05] Stefan Roth and Michael J Black.  Fields of experts: A framework for learning image priors.  In 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05), volume 2, pages 860–867. IEEE, 2005.
  * [RC20] Julian Rasch and Antonin Chambolle.  Inexact first-order primal–dual algorithms.  Computational Optimization and Applications, 76(2):381–430, 2020\.
  * [RDH21] Nicolai André Brogaard Riis, Yiqiu Dong, and Per Christian Hansen.  Computed tomography with view angle estimation using uncertainty quantification.  Inverse Problems, 37(6):065007, 2021.
  * [REM17] Yaniv Romano, Michael Elad, and Peyman Milanfar.  The little engine that could: Regularization by denoising (red).  SIAM Journal on Imaging Sciences, 10(4):1804–1844, 2017.
  * [RFP13] Hugo Raguet, Jalal Fadili, and Gabriel Peyré.  A generalized forward-backward splitting.  SIAM Journal on Imaging Sciences, 6(3):1199–1226, 2013.
  * [RKDA14] Farbod Roosta-Khorasani, Kees Van Den Doel, and Uri Ascher.  Stochastic algorithms for inverse problems involving pdes and many measurements.  SIAM Journal on Scientific Computing, 36:S3–S22, 2014.
  * [RKM19] Farbod Roosta-Khorasani and Michael W. Mahoney.  Sub-sampled Newton methods.  Mathematical Programming, 174:293–326, 2019.
  * [RM51] Herbert Robbins and Sutton Monro.  A stochastic approximation method.  The Annals of Mathematical Statistics, 22(3):400–407, 1951.
  * [Roc76] R Tyrrell Rockafellar.  Monotone operators and the proximal point algorithm.  SIAM journal on control and optimization, 14(5):877–898, 1976.
  * [RR12] Benjamin Recht and Christopher Re.  Beneath the valley of the noncommutative arithmetic-geometric mean inequality: conjectures, case-studies, and consequences, 2012.  arXiv:1202.4184.
  * [RSB12] Nicolas L. Roux, Mark Schmidt, and Francis R. Bach.  A stochastic gradient method with an exponential convergence _rate for finite training sets.  In F. Pereira, C. J. C. Burges, L. Bottou, and K. Q. Weinberger, editors, Advances in Neural Information Processing Systems 25, pages 2663–2671. Curran Associates, Inc., 2012.
  * [RT14] Peter Richtárik and Martin Takáč.  Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function.  Mathematical Programming, 144(1):1–38, 2014.
  * [Rud16] Sebastian Ruder.  An overview of gradient descent optimization algorithms, 2016.  arXiv:1609.04747.
  * [SBC16] Weijie Su, Stephen Boyd, and Emmanuel J. Candès.  A differential equation for modeling nesterov’s accelerated gradient method: Theory and insights.  Journal of Machine Learning Research, 17(153):1–43, 2016.
  * [SBd17] Damien Scieur, Francis Bach, and Alexandre d’Aspremont.  Nonlinear acceleration of stochastic algorithms.  In Advances in Neural Information Processing Systems, pages 3982–3991, 2017.
  * [Sci19] Damien Scieur.  Generalized framework for nonlinear acceleration, 2019.  arXiv:1903.08764.
  * [SCMR22] Adil Salim, Laurent Condat, Konstantin Mishchenko, and Peter Richtárik.  Dualize, split, randomize: Toward fast nonsmooth optimization algorithms.  Journal of Optimization Theory and Applications, 195:102–130, 2022\.
  * [SdB16] Damien Scieur, Alexandre d’Aspremont, and Francis Bach.  Regularized nonlinear acceleration.  In Advances In Neural Information Processing Systems, pages 712–720, 2016.
  * [SEC+15] Yoav Shechtman, Yonina C Eldar, Oren Cohen, Henry Nicholas Chapman, Jianwei Miao, and Mordechai Segev.  Phase retrieval with application to optical imaging: a contemporary overview.  IEEE signal processing magazine, 32(3):87–109, 2015.
  * [SFO24] Michael Sucker, Jalal Fadili, and Peter Ochs.  Learning-to-optimize with pac-bayesian guarantees: Theoretical considerations and practical implementation, 2024.  arXiv:2404.03290.
  * [SGG+08] Otmar Scherzer, Markus Grasmair, Harald Grossauer, Markus Haltmeier, and Frank Lenzen.  Variational Methods in Imaging, volume 167 of Applied Mathematical Sciences.  Springer, 2008.
  * [SH22] Georg Schramm and Martin Holler.  Fast and memory-efficient reconstruction of sparse poisson data in listmode with non-smooth priors with application to time-of-flight PET.  Physics in Medicine & Biology, 2022.
  * [Sha70] David F. Shanno.  Conditioning of quasi-Newton methods for function minimization.  Mathematics of Computation, 24:647–656, 1970.
  * [SHB18] Thomas Schuster, Bernadette Hahn, and Martin Burger.  Dynamic inverse problems: Modelling - regularization - numerics.  Inverse Problems, 34, 2018.
  * [SKL18] Samuel L. Smith, Pieter-Jan Kindermans, and Quoc V. Le.  Don’t decay the learning rate, increase the batch size.  In International Conference on Learning Representations, 2018.
  * [SLRB17] Mark Schmidt, Nicolas Le Roux, and Francis Bach.  Minimizing finite sums with the stochastic average gradient.  Mathematical Programming, 162(1-2):83–112, 2017.
  * [SLS06] Frank Schöpfer, Alfred Karl Louis, and Thomas Schuster.  Nonlinear iterative methods for linear ill-posed problems in banach spaces.  Inverse Problems, 22(1):311, 2006.
  * [SS20] Amit Singer and Fred J. Sigworth.  Computational methods for single-particle electron cryomicroscopy.  Annual Review of Biomedical Data Science, 3(1):163–190, 2020.
  * [SSD+17] Bert-Ram Sah, Paul Stolzmann, Gaspar Delso, Scott D Wollenweber, Martin Hüllner, Yahya A Hakami, Marcelo A Queiroz, Felipe de Galiza Barbosa, Gustav K von Schulthess, Carsten Pietsch, and Patrick Veit-Haibach.  Clinical evaluation of a block sequential regularized expectation maximization reconstruction algorithm in 18f-fdg pet/ct studies.  Nuclear Medicine Communications, 38:57–66, 2017.
  * [SST10] Simon Setzer, Gabriele Steidl, and Tanja Teuber.  Deblurring Poissonian Images by Split Bregman Techniques.  Journal of Visual Communication and Image Representation, 21(3):193–199, 2010.
  * [SSZ13] Shai Shalev-Shwartz and Tong Zhang.  Stochastic dual coordinate ascent methods for regularized loss minimization.  Journal of Machine Learning Research, 14(1), 2013.
  * [Stu10] Andrew M. Stuart.  Inverse problems: A bayesian perspective.  Acta Numerica, 19:451–559, 2010.
  * [STXY16] Hao-Jun Michael Shi, Shenyinying Tu, Yangyang Xu, and Wotao Yin.  A primer on coordinate descent algorithms, 2016.  arXiv:1610.00040.
  * [SYG07] Nicol N. Schraudolph, Jin Yu, and Simon Günter.  A stochastic quasi-Newton method for online convex optimization.  In Artificial Intelligence and Statistics, pages 436–443, 2007\.
  * [TAH+19] Robert Twyman, Simon Arridge, Brian F Hutton, Elise C Emond, Ludovica Brusaferri, Sangtae Ahn, and Kris Thielemans.  Iterative pet image reconstruction using adaptive adjustment of subset size and random subset sampling.  In 2019 IEEE Nuclear Science Symposium and Medical Imaging Conference (NSS/MIC), pages 1–3. IEEE, 2019.
  * [TAK+23] Robert Twyman, Simon Arridge, Zeljko Kereta, Bangti Jin, Ludovica Brusaferri, Sangtae Ahn, Charles W. Stearns, Brian F. Hutton, Irene A. Burger, Fotis Kotasidis, and Kris Thielemans.  An investigation of stochastic variance reduction algorithms for relative difference penalized 3d PET image reconstruction.  IEEE Transactions on Medical Imaging, 42(1):29–41, 2023.
  * [Tar84] Albert Tarantola.  Inversion of seismic reflection data in the acoustic approximation.  Geophysics, 49(8):1259–1266, 1984.
  * [TASV23] Cheik Traoré, Vassilis Apidopoulos, Saverio Salzo, and Silvia Villa.  Variance reduction techniques for stochastic proximal point algorithms, 2023.  arxiv:2308.09310.
  * [TBE+18] Yu-Jung Tsai, Alexandre Bousse, Matthias J. Ehrhardt, Charles W. Stearns, Sangtae Ahn, Brian F. Hutton, Simon Arridge, and Kris Thielemans.  Fast quasi-Newton algorithms for penalized reconstruction in emission tomography and further improvements via preconditioning.  IEEE Transactions on Medical Imaging, 37(4):1000–1010, 2018.
  * [Teb18] Marc Teboulle.  A simplified view of first order methods for optimization.  Mathematical Programming, 170(1):67–96, 2018.
  * [TED19] Junqi Tang, Karen Egiazarian, and Mike Davies.  The limitation and practical acceleration of stochastic gradient algorithms in inverse problems.  In ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 7680–7684. IEEE, 2019.
  * [TEGD20] Junqi Tang, Karen Egiazarian, Mohammad Golbabaee, and Mike Davies.  The practicality of stochastic optimization in imaging inverse problems.  IEEE Transactions on Computational Imaging, 6:1471–1485, 2020.
  * [TF11] Ivana Tošić and Pascal Frossard.  Dictionary learning.  IEEE Signal Processing Magazine, 28(2):27–38, 2011.
  * [TGBD18] Junqi Tang, Mohammad Golbabaee, Francis Bach, and Mike Davies.  Rest-katyusha: Exploiting the solution’s structure via scheduled restart schemes.  Advances in Neural Information Processing Systems, 31, 2018.
  * [TGD17] Junqi Tang, Mohammad Golbabaee, and Mike E Davies.  Gradient projection iterative sketch for large-scale constrained least-squares.  In International Conference on Machine Learning, pages 3377–3386. PMLR, 2017.
  * [TH12] Tijmen Tieleman and Geoffrey Hinton.  Lecture 6.5-rmsprop: Divide the gradient by a running average of its recent magnitude.  COURSERA: Neural Networks for Machine Learning, 2012.
  * [TL23] Lionel Tondji and Dirk A Lorenz.  Faster randomized block sparse kaczmarz by averaging.  Numerical Algorithms, 93(4):1417–1451, 2023.
  * [TMTS23] Hong Ye Tan, Subhadip Mukherjee, Junqi Tang, and Carola-Bibiane Schönlieb.  Data-driven mirror descent with input-convex neural networks.  SIAM Journal on Mathematics of Data Science, 5(2):558–587, 2023\.
  * [TMTS24a] Hong Ye Tan, Subhadip Mukherjee, Junqi Tang, and Carola-Bibiane Schönlieb.  Boosting data-driven mirror descent with randomization, equivariance, and acceleration.  Transactions on Machine Learning Research, 2024.
  * [TMTS24b] Hong Ye Tan, Subhadip Mukherjee, Junqi Tang, and Carola-Bibiane Schönlieb.  Provably convergent plug-and-play quasi-Newton methods.  SIAM Journal on Imaging Sciences, 17(2):785–819, 2024.
  * [Tse01] Paul Tseng.  Convergence of a block coordinate descent method for nondifferentiable minimization.  Journal of optimization theory and applications, 109(3):475–494, 2001.
  * [Val14] Tuomo Valkonen.  A primal–dual hybrid gradient method for nonlinear operators with applications to mri.  Inverse Problems, 30(5):055012, 2014.
  * [Val16] Tuomo Valkonen.  Optimising Big Images, pages 97–131.  Springer International Publishing, 2016.
  * [Val21] Tuomo Valkonen.  First-order primal–dual methods for nonsmooth non-convex optimisation.  Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging: Mathematical Imaging and Vision, pages 1–42, 2021.
  * [vdDA12] Kees van den Doel and Uri M Ascher.  Adaptive and stochastic algorithms for electrical impedance tomography and dc resistivity problems with piecewise constant solutions and many measurements.  SIAM Journal on Scientific Computing, 34(1):A185–A205, 2012.
  * [VML+19] Sharan Vaswani, Aaron Mishkin, Issam Laradji, Mark Schmidt, Gauthier Gidel, and Simon Lacoste-Julien.  Painless stochastic gradient: Interpolation, line-search, and convergence rates.  Advances in Neural Information Processing Systems, 32, 2019.
  * [VO09] Jean Virieux and Stéphane Operto.  An overview of full-waveform inversion in exploration geophysics.  Geophysics, 74(6):WCC1–WCC26, 2009.
  * [Vog00] Curtis R. Vogel.  A limited memory bfgs method for an inverse problem in atmospheric imaging.  In Methods and Applications of Inversion, pages 292–304. Springer Berlin Heidelberg, Berlin, Heidelberg, 2000.
  * [Vũ13] Bang C. Vũ.  A splitting algorithm for dual monotone inclusions involving cocoercive operators.  Advances in Computational Mathematics, 38(3):667–681, 2013.
  * [WA11] Kun Wang and Mark A. Anastasio.  Photoacoustic and thermoacoustic tomography: Image formation principles.  In Handbook of Mathematical Methods in Imaging, pages 781–815. Springer, 2011.
  * [WB14] Huahua Wang and Arindam Banerjee.  Bregman alternating direction method of multipliers.  Advances in Neural Information Processing Systems, 27, 2014.
  * [WFO23] Shida Wang, Jalal Fadili, and Peter Ochs.  A quasi-Newton primal-dual algorithm with line search.  In International Conference on Scale Space and Variational Methods in Computer Vision, pages 444–456. Springer, 2023.
  * [WJZ+19] Zhe Wang, Kaiyi Ji, Yi Zhou, Yingbin Liang, and Vahid Tarokh.  Spiderboost and momentum: Faster variance reduction algorithms.  Advances in Neural Information Processing Systems, 32, 2019.
  * [Woo14] David P. Woodruff.  Sketching as a tool for numerical linear algebra.  Foundations and Trends in Theoretical Computer Science, 10:1–157, 2014.
  * [Wri15] Stephen J Wright.  Coordinate descent algorithms.  Mathematical Programming, 151(1):3–34, 2015.
  * [XLTW22] Yin Xian, Haiguang Liu, Xuecheng Tai, and Yang Wang.  Randomized Kaczmarz Method for Single-Particle X-Ray Image Phase Retrieval.  Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging, pages 1–16, 2022.
  * [XLWZ18] Xiantao Xiao, Yongfeng Li, Zaiwen Wen, and Liwei Zhang.  A regularized semi-smooth Newton method with projection steps for composite convex programs.  Journal of Scientific Computing, 76:364–389, 2018.
  * [XN22] Jingyan Xu and Frédéric Noo.  Convex optimization algorithms in medical image reconstruction—in the age of ai.  Physics in Medicine & Biology, 67(7), 2022.
  * [XYR+16] Peng Xu, Jiyan Yang, Fred Roosta, Christopher Ré, and Michael W. Mahoney.  Sub-sampled Newton methods with non-uniform sampling.  In Advances in Neural Information Processing Systems, volume 29, 2016.
  * [XZ14] Lin Xiao and Tong Zhang.  A proximal stochastic gradient method with progressive variance reduction.  SIAM Journal on Optimization, 24(4):2057–2075, 2014.
  * [Yan18] Ming Yan.  A new primal–dual algorithm for minimizing the sum of three functions with a linear operator.  Journal of Scientific Computing, 76:1698–1717, 2018.
  * [Yin10] Wotao Yin.  Analysis and generalizations of the linearized Bregman method.  SIAM Journal on Imaging Sciences, 3(4):856–877, 2010.
  * [YOGD08] Wotao Yin, Stanley Osher, Donald Goldfarb, and Jérôme Darbon.  Bregman iterative algorithms for l1-minimization with applications to compressed sensing.  SIAM Journal on Imaging Sciences, 1:143–168, 2008.
  * [YVGS08] Jin Yu, SVN Vishwanathan, Simon Günter, and Nicol N Schraudolph.  A quasi-Newton approach to non-smooth convex optimization.  In Proceedings of the 25th International Conference on Machine Learning, pages 1216–1223, 2008.
  * [ZB21] Lena Zdun and Christina Brandt.  Fast MPI reconstruction with non-smooth priors by stochastic optimization and data-driven splitting.  Physics in Medicine and Biology, 66, 2021.
  * [Zei12] Matthew D. Zeiler.  Adadelta: An adaptive learning rate method, 2012.  arXiv:1212.5701.
  * [ZQTL24] Qingping Zhou, Jiayu Qian, Junqi Tang, and Jinglai Li.  Deep unrolling networks with recurrent momentum acceleration for nonlinear inverse problems.  Inverse Problems, 40(5):055014, Apr 2024.
  * [ZZ15] Peilin Zhao and Tong Zhang.  Stochastic optimization with importance sampling for regularized loss minimization.  In Francis Bach and David Blei, editors, Proceedings of the 32nd International Conference on Machine Learning, volume 37, pages 1–9, 2015.