On sequential and parallel projection algorithms for feasibility and optimization

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 4553, Issue , 2001, Pages 1-9

  Censor, Yair ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Block iterative; Bregman projections; Convex feasibility; Projection algorithms; String averaging

Indexed keywords

ASYMPTOTIC STABILITY; CONVERGENCE OF NUMERICAL METHODS; IMAGE RECONSTRUCTION; INVERSE PROBLEMS; LINEAR EQUATIONS; MATRIX ALGEBRA; PARALLEL ALGORITHMS; RADIOTHERAPY; SET THEORY;

BLOCK ITERATIVE ALGORITHM; BLOCK ITERATIVE COMPONENT AVERAGING ALGORITHM; BREGMAN PROJECTIONS; CONVEX FEASIBILITY PROBLEM; CONVEX SETS; PROJECTION ALGORITHMS; SEQUENTIAL ALGORITHM; STRING AVERAGING ALGORITHM;

OPTIMIZATION;

EID: 0035768299     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.441550     Document Type: Conference Paper

References (48)

1. 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, NY, USA, 1998.
2. Y. Censor and S.A. Zenios, Parallel Optimization: Theory, Algorithms, and Applications, Oxford University Press, New York, NY, USA, 1997.
3. P.L. Combettes, "The foundations of set-theoretic estimation," Proceedings of the IEEE 81 pp. 182-208, 1993.
4. P.L. Combettes, "The convex feasibility problem in image recovery," Advances in Imaging and Electron Physics 95, pp. 155-270, 1996.
5. G.T. Herman, Image Reconstruction From Projections: The Fundamentals of Computerized Tomography, Academic Press, New York, NY, USA, 1980.
6. 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, pp. 607-623, 1988.
7. Y. Censor, "Mathematical aspects of radiation therapy treatment planning: continuous inversion versus full discretization and optimization versus feasibility," in Computational Radiology and Imaging: Therapy and Diagnostics, C. Börgers and F. Natterer, eds., pp. 101-112, The IMA Volumes in Mathematics and its Applications, Vol. 110, Springer-Verlag, New York, NY, USA, 1999.
8. L.D. Marks, W. Sinkler and E. Landree, "A feasible set approach to the crystallographic phase problem," Acta Crystallographica A55, pp. 601-612, 1999.
9. H.H. Bauschke and J.M. Borwein, "On projection algorithms for solving convex feasibility problems," SIAM Review 38, pp. 367-426, 1996.
10. F. Deutsch, Best Approximation in Inner product Spaces, Springer-Verlag, New York, NY, USA, 2001.
11. L.M. Bregman, Y. Censor and S. Reich, "Dykstra's algorithm as the nonlinear extension of Bregman's optimization method," Journal of Convex Analysis 6 pp. 319-334, 1999.
12. H.H. Bauschke and P.L. Combettes, "A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces," Mathematics of Operations Research 26, pp. 248-264, 2001.
13. H.H. Bauschke, "The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space," Journal of Mathematical Analysis and Applications 202, pp. 150-159, 1996.
14. Y. Censor and A. Lent, "An iterative row-action method for interval convex programming," Journal of Optimization Theory and Applications 34, pp. 321-353, 1981.
15. 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," USSR Computational Mathematics and Mathematical Physics 7, pp. 200-217, 1967.
16. Y. Censor and T. Elfving, "A multiprojections algorithm using Bregman projections in a product space," Numerical Algorithms 8, pp. 221-239, 1994.
17. Y. Censor and S. Reich, "Iterations of paracontractions and firmly nonexpansive operators with applications to feasibility and optimization," Optimization 37, pp. 323-339, 1996.
18. A.R. De Pierro and A.N. Iusem, "A relaxed version of Bregman's method for convex programming," Journal of Optimization Theory and Applications 51, pp. 421-440, 1986.
19. K. Kiwiel, "Generalized Bregman projections in convex feasibility problems," Journal of Optimization Theory and Applications 96, pp. 139-157, 1998.
20. K. Kiwiel, "Free-steering relaxation methods for problems with strictly convex costs and linear constraints," Mathematics of Operations Research 22, pp. 326-349, 1997.
21. H.H. Bauschke and J.M. Borwein, "Legendre functions and the method of random Bregman projections," Journal of Convex Analysis, 4, pp. 27-67, 1997.
22. D. Butnariu and A.N. Iusem, Totally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization, Kluwer Academic Publishers, Dordrecht, the Netherlands, 2000.
23. T. Kotzer, N. Cohen and J. Shamir, "A projection-based algorithm for consistent and inconsistent constraints," SIAM Journal of Optimization 7, pp. 527-546, 1997.
24. D. Lyszyk and J. Shamir, "Signal processing under uncertain conditions by parallel projections onto fuzzy sets," Journal of the Optical Society of America A 16, pp. 1602-1611, 1999.
25. I. Csiszár and G. Tusnády, "Information geometry and alternating minimization procedures," Statistics and Decisions Supplement Issue No. 1, pp. 205-237, 1984.
26. D. Butnariu, Y. Censor and S. Reich, "Iterative averaging of entropic projections for solving stochastic convex feasibility problems," Computational Optimization and Applications 8, pp. 21-39, 1997.
27. L.M. Bregman, "The method of successive projections for finding a common point of convex sets," Soviet Mathematics Doklady 6, pp. 688-692, 1965.
28. L. Gubin, B. Polyak and E. Raik, "The method of projections for finding the common point of convex sets," USSR Computational Mathematics and Mathematical Physics 7, pp. 1-24, 1967.
29. D.C. Youla, "Mathematical theory of image restoration by the method of convex projections," in Image Recovery: Theory and Applications, H. Stark, ed., pp. 29-77, Academic Press, Orlando, Florida, USA, 1987.
30. Y. Censor, T. Elfving and G.T. Herman, "Averaging strings of sequential iterations for convex feasibility problems," in Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, D. Butnariu, Y. Censor, and S. Reich, eds., pp. 101-114, Elsevier Science Publishers, Amsterdam, The Netherlands, 2001.
31. G. Cimmino, "Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari," La Ricerca Scientifica XVI Series II, Anno IX, 1, pp. 326-333, 1938.
32. R. Aharoni Y. Censor, "Block-iterative projection methods for parallel computation of solutions to convex feasibility problems," Linear Algebra and Its Applications 120, pp. 165-175, 1989.
33. D. Butnariu and Y. Censor, "Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces," Journal of Computational and Applied Mathematics 53, pp. 33-42, 1994.
34. H.H. Bauschke, J.M. Borwein and A.S. Lewis, "The method of cyclic projections for closed convex sets in Hilbert space," Contemporary Mathematics 204, pp. 1-38, 1997.
35. T. Elfving, "Block-iterative methods for consistent and inconsistent linear equations," Numerische Mathematik 35, pp. 1-12, 1980.
36. P.P.B. Eggermont, G.T. Herman and A. Lent, "Iterative algorithms for large partitioned linear systems, with applications to image reconstruction," Linear Algebra and Its Applications 40, pp. 37-67, 1981.
37. P.L. Combettes, "Inconsistent signal feasibility problems: least-squares solutions in a product space," IEEE Transactions on Signal Processing SP-42, pp. 2955-2966, 1994.
38. A.N. Iusem and A.R. De Pierro, "Convergence results for an accelerated nonlinear Cimmino algorithm," Numerische Mathematik 49, pp. 367-378, 1986.
39. Y. Censor and G.T. Herman, "Block-iterative algorithms with underrelaxed Bregman projections," Technical Report, May 2001.
40. C.L. Byrne, "Block-iterative methods for image reconstruction from projections," IEEE Transactions on Image Processing IP-5, pp. 792-794, 1996.
41. C.L. Byrne, "Block-iterative interior point optimization methods for image reconstruction from limited data," Inverse Problems 16, pp. 1405-1419, 2000.
42. C.L. Byrne, "Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization," in Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, D. Butnariu, Y. Censor, and S. Reich, eds., pp. 87-99, Elsevier Science Publishers, Amsterdam, the Netherlands, 2001.
43. C.L. Byrne, "Notes on block-iterative or ordered subset methods for image reconstruction," Technical Report, September 2000.
44. P.L. Combettes, "Strong convergence of block-iterative outer approximation methods for convex optimization," SIAM Journal on Control Optimization 38, pp. 538-565, 2000.
45. P.L. Combettes, "Quasi-Fejérian analysis of some optimization algorithms," in Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, D. Butnariu, Y. Censor, and S. Reich, eds., pp. 115-152, Elsevier Science Publishers, Amsterdam, The Netherlands, 2001.
46. Y. Censor, "Row-action methods for huge and sparse systems and their applications," SIAM Review 23 pp. 444-466, 1981.
47. Y. Censor, D. Gordon and R. Gordon, "BICAV: A block-iterative, parallel algorithm for sparse systems with pixel-dependent weighting," IEEE Transactions on Medical Imaging, to appear.
48. Y. Censor, D. Gordon and R. Gordon, "Component averaging: An efficient iterative parallel algorithm for large and sparse unstructural problems," Parallel Computing 27, pp. 777-808, 2001.