Publication Cover
Applicable Analysis
An International Journal
Volume 100, 2021 - Issue 2
69
Views
2
CrossRef citations to date
0
Altmetric
Articles

Optimal selections of stepsizes and blocks for the block-iterative ART

, &
Pages 403-416 | Received 21 Oct 2018, Accepted 09 Apr 2019, Published online: 23 Apr 2019

References

  • Browne J, De Pierro A. A row-action alternative to the EM algorithm for maximizing likelihoods in emission tomography. IEEE Trans Med Image. 1996;15:687–699. doi: 10.1109/42.538946
  • Byrne C. Iterative optimization in inverse problems. Boca Raton: CRC Press; 2014.
  • Censor Y. Row-action methods for huge and sparse systems and their applications. SIAM Rev. 1981;23:444–466. doi: 10.1137/1023097
  • Gordon R, Bender R, Herman GT. Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and X-ray photography. J Theoret Biol. 1970;29:471–481. doi: 10.1016/0022-5193(70)90109-8
  • Herman GT, Meyer LB. Algebraic reconstruction techniques can be made computationally efficient (positron emission tomography application). IEEE Trans Med Imaging. 1993;12(3):600–609. doi: 10.1109/42.241889
  • Shieh M, Byrne C, Testorf M, et al. Iterative image reconstruction using prior knowledge. J Opt Soc Amer A. 2006;23(6):1292–1300. doi: 10.1364/JOSAA.23.001292
  • Tanabe K. Projection method for solving a singular system of linear equations and its applications. Numer Math. 1971;17:203–214. doi: 10.1007/BF01436376
  • Byrne C. Block-iterative methods for image reconstruction from projections. IEEE Trans Image Process. 1996;5(5):792–794. doi: 10.1109/83.499919
  • Byrne C. Convergent block-iterative algorithms for image reconstruction from inconsistent data. IEEE Trans Image Process. 1997;6(9):1296–1304. doi: 10.1109/83.623192
  • Byrne C. Choosing parameters in block-iterative or ordered-subset reconstruction algorithms. IEEE Trans Image Process. 2005;14(3):321–327. doi: 10.1109/TIP.2004.841193
  • Byrne C. Block-iterative algorithms. Inter Trans Oper Res. 2009;16(4):427–463. doi: 10.1111/j.1475-3995.2008.00683.x
  • Byrne C. Bounds on the largest singular value of a matrix and the convergence of simultaneous and block-iterative algorithms for sparse linear systems. Inter Trans Oper Res. 2009;16(4):465–479. doi: 10.1111/j.1475-3995.2009.00692.x
  • Ceng LC. Approximation of common solutions of a split inclusion problem and a fixed-point problem. J Appl Numer Optim. 2019;1:1–12.
  • Censor Y, Gordon D, Gordon R. BICAV: a block-iterative, parallel algorithm for sparse systems with pixel-related weighting. IEEE Trans Med Image. 2001;20:1050–1060. doi: 10.1109/42.959302
  • Gordon D, Gordon R. Component-averaged row projections: a robust block-paralleled scheme for sparse linear systems. SIAM J Sci Comput. 2005;27:1092–1117. doi: 10.1137/040609458
  • Bauschke HH, Combettes PL. Convex analysis and monotone operator theory in Hilbert spaces. New York: Springer; 2010.
  • He SN, Yang CP, Duan PC. Realization of the hybrid method for Mann iterations. Appl Math Comput. 2010;217:4239–4247.
  • Goebel K, Reich S. Uniform convexity hyperbolic geometry and nonexpansive mappings. New York: Marcel Dekker; 1984.
  • He SN, Tian HL. Selective projection methods for solving a class of variational inequalities. Numer Algor. 2019;80(2):617–634. doi: 10.1007/s11075-018-0499-x
  • He SN, Tian HL, Xu HK. The selective projection method for convex feasibility and split feasibility problems. J Nonlinear Convex Anal. 2018;19:1199–1215.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.