Block-iterative algorithms with underrelaxed bregman projections

SIAM Journal on Optimization

Volumn 13, Issue 1, 2003, Pages 283-297

  Censor, Yair ^a   Herman, Gabor T ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b City University of New York   (United States)

Author keywords

Block iterative algorithms; Bregman functions; Convex feasibility; Projection algorithms; Underrelaxation

Indexed keywords

EID: 0037289090     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623401389439     Document Type: Article

References (33)

1. R. AHARONI AND Y. CENSOR, Block-iterative projection methods for parallel computation of solutions to convex feasibility problems, Linear Algebra Appl., 120 (1989), pp. 165-175.
2. H.H. BAUSCHKE AND J.M. BORWEIN, On projection algorithms for solving convex feasibility problems, SIAM Rev., 38 (1996), pp. 367-426.
3. H.H. BAUSCHKE AND J.M. BORWEIN, Legendre functions and the method of random Bregman projections, J. Convex Anal., 4 (1997), pp. 27-67.
4. H.H. BAUSCHKE, F. DEUTSGH, H. HUNDAL, AND S.-H. PARK, Fejér monotonicity and weak convergence of an accelerated method of projections, in Constructive, Experimental, and Nonlinear Analysis, M. Thera, ed., AMS, Providence, RI, 2000, pp. 1-6.
5. L.M. BREGMAN, The method of successive projections for finding a common point of convex sets, Soviet Math. Dokl., 6 (1965), pp. 688-692.
6. L.M. BREGMAN, The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming, Comput. Math. Math. Phys., 7 (1967), pp. 200-217.
7. Y. CENSOR, M.D. ALTSCHULER, AND W.D. POWLIS, On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning, Inverse Problems, 4 (1988), pp. 607-623.
8. Y. CENSOR AND T. ELFVING, A multiprojections algorithm using Bregman projections in a product space, Numer. Algorithms, 8 (1994), pp. 221-239.
9. Y. CENSOR, P.P.B. EGGERMONT, AND D. GORDON, Strong underrelaxation in Kaczmarz's method for inconsistent systems, Numer. Math., 41 (1983), pp. 83-92.
10. Y. CENSOR AND A. LENT, An iterative row-action method for interval convex programming, J. Optim. Theory Appl., 34 (1981), pp. 321-353.
11. Y. CENSOR AND S. REICH, Iterations of paracontractions and firmly nonexpansive operators with applications to feasibility and optimization, Optimization, 37 (1996), pp. 323-339.
12. Y. CENSOR AND J. SEGMAN, On block-iterative entropy maximization, J. Inform. Optim. Sci., 8 (1987), pp. 275-291.
13. Y. CENSOR AND S.A. ZENIOS, Parallel Optimization: Theory, Algorithms, and Applications, Oxford University Press, New York, 1997.
14. M. COLLINS, R.E. SHAPIRE, AND Y. SINGER, Logistic regression, AdaBoost and Bregman distances, Machine Learning, 48 (2002), pp. 253-285.
15. P.L. COMBETTES, The foundations of set-theoretic estimation, Proc. IEEE, 81 (1993), pp. 182-208.
16. P.L. COMBETTES, The convex feasibility problem in image recovery, Adv. in Imaging and Electron Phys., 95 (1996), pp. 155-270.
17. A.R. DE PIERRO AND A.N. IUSEM, A relaxed version of Bregman's method for convex programming, J. Optim. Theory Appl., 51 (1986), pp. 421-440.
18. P.P.B. EGGERMONT, G.T. HERMAN, AND A. LENT, Iterative algorithms for large partitioned linear systems, with applications to image reconstruction, Linear Algebra Appl., 40 (1981), pp. 37-67.
19. S.-C. FANG, R.J. RAJASEKERA, AND H.-S.J. TSAO, Entropy Optimization and Mathematical Programming, Kluwer Academic Publishers, Boston, MA, 1997.
20. L. GUBIN, B. POLYAK, AND E. RAIK, The method of projections for finding the common point of convex sets, Comput. Math. Math. Phys., 7 (1967), pp. 1-24.
21. G.T. HERMAN, Image Reconstruction from Projections: The Fundamentals of Computerized Tomography, Academic Press, New York, 1980.
22. G.T. HERMAN, A. LENT, AND P.H. LUTZ, Relaxation methods for image reconstruction, Comm. ACM, 21 (1978), pp. 152-158.
23. G.T. HERMAN, S. MATEJ, AND B.M. CARVALHO, Algebraic reconstruction techniques using smooth basis functions for helical cone-beam tomography, in Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, D. Butnariu, Y. Censor, and S. Reich, eds., Elsevier Science Publishers, Amsterdam, The Netherlands, 2001, pp. 307-324.
24. K. KIWIEL, Generalized Bregman projections in convex feasibility problems, J. Optim. Theory Appl., 96 (1998), pp. 139-157.
25. K. KIWIEL, Free-steering relaxation methods for problems with strictly convex costs and linear constraints, Math. Oper. Res., 22 (1997), pp. 326-349.
26. D.G. LUENBERGER, Optimization by Vector Space Methods, John Wiley & Sons, New York, 1969.
27. R. MARABINI, G.T. HERMAN, AND J.M. CARAZO, 3D reconstruction in electron microscopy using ART with smooth spherically symmetric volume elements (blobs), Ultramicroscopy, 72 (1998), pp. 53-65.
28. L.D. MARKS, W. SINKLER, AND E. LANDREE, A feasible set approach to the crystallographic phase problem, Acta Cryst. Sect. A, 55 (1999), pp. 601-612.
29. T. OBI, S. MATEJ, R.M. LEWITT, AND G.T. HERMAN, 2.5D simultaneous multislice reconstruction by series expansion methods from Fourier rebinned PET data, IEEE Trans. Medical Imaging, 19 (2000), pp. 474-484.
30. R.T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
31. M.V. SOLODOV AND B.F. SVAITER, An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions, Math. Oper. Res., 25 (2000), pp. 214-230.
32. H. STARK AND Y. YANG, Vector Space Projections: A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics, John Wiley & Sons, New York, 1998.
33. D.C. YOULA, Mathematical theory of image restoration by the method of convex projections, in Image Recovery: Theory and Applications, H. Stark, ed., Academic Press, Orlando, FL, 1987, pp. 29-77.