Averaging strings of sequential iterations for convex feasibility problems

Studies in Computational Mathematics

Volumn 8, Issue C, 2001, Pages 101-113

  Censor, Y ^a   Elfving, T ^b   Herman, G T ^c  

^a UNIVERSITY OF HAIFA   (Israel)

^b LINKÖPING UNIVERSITY   (Sweden)

^c Temple University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956677460     PISSN: 1570579X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1570-579X(01)80009-4     Document Type: Chapter

References (33)

1. Aharoni R., and Censor Y. Block-iterative methods for parallel computation of solutions to convex feasibility problems. Linear Algebra and Its Applications 120 (1989) 165-175
2. Bauschke H.H. A norm convergence result on random products of relaxed projections in Hilbert space. Transactions of the American Mathematical Society 347 (1995) 1365-1373
3. Bauschke H.H., and Borwein J.M. On projection algorithms for solving convex feasibility problems. SIAM Review 38 (1996) 367-426
4. Bauschke H.H., and Borwein J.M. Legendre functions and the method of random Bregman projections. Journal of Convex Analysis 4 (1997) 27-67
5. Bauschke H.H., Borwein J.M., and Lewis A.S. The method of cyclic projections for closed convex sets in Hilbert space. Contemporary Mathematics 204 (1997) 1-38
6. Baillon J.M., Bruck R.E., and Reich S. On the asymptotic behavior of nonexpansive mappings and semigroups in Banach spaces. Houston Journal of Mathematics 4 (1978) 1-9
7. Bregman L.M. 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 (1967) 200-217
8. Bregman L.M., Censor Y., and Reich S. Dykstra's algorithms as the nonlinear extension of Bregman's optimization method. Journal of Convex Analysis 6 (1999) 319-334
9. Bruck R.E., and Reich S. Nonexpansive projections and resolvents of accretive operators in Banach spaces. Houston Journal of Mathematics 3 (1977) 459-470
10. Butnariu D., and Censor Y. Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces. Journal of Computational and Applied Mathematics 53 (1994) 33-42
11. Butnariu D., Censor Y., and Reich S. Iterative averaging of entropic projection for solving stochastic convex feasibility problems. Computational Optimization and Applications 8 (1997) 21-39
12. Censor Y., and Elfving T. A multiprojection algorithm using Bregman projections in a product space. Numerical Algorithms 8 (1994) 221-239
13. Censor Y., and Lent A. An iterative row-action method for interval convex programming. Journal of Optimization Theory and Applications 34 (1981) 321-353
14. Censor Y., and Reich S. Iterations of paracontractions and firmly nonexpansive operators with applications to feasibility and optimization. Optimization 37 (1996) 323-339
15. Censor Y., and Zenios S.A. Parallel Optimization: Theory, Algorithms, and Applications (1997), Oxford University Press, New York
16. G. C. Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari. La Ricerca Scientifica XVI Series II, Anno IX 1 (1938) 326-333
17. Csiszár I., and Tusnády G. Information geometry and alternating minimization procedures. Statistics and Decisions Supplement Issue No. 1 (1984) 205-237
18. Combettes P.L. Inconsistent signal feasibility problems: least-squares solutions in a product space. IEEE Transactions on Signal Processing SP-42 (1994) 2955-2966
19. De Pierro A.R., and Iusem A.N. A relaxed version of Bregman's method for convex programming. Journal of Optimization Theory and Applications 51 (1986) 421-440
20. Dye J.M., and Reich S. Unrestricted iteration of projections in Hilbert space. Journal of Mathematical Analysis and Applications 156 (1991) 101-119
21. Dye J.M., and Reich S. On the unrestricted iterations of nonexpansive mappings in Hilbert space. Nonlinear Analysis, Theory, Methods and Applications 18 (1992) 199-207
22. Dye J.M., Kuczumow T., Lin P.-K., and Reich S. Convergence of unrestricted products of nonexpansive mappings in spaces with the Opial property. Nonlinear Analysis, Theory, Methods and Applications 26 (1996) 767-773
23. Eggermont P.P.B., Herman G.T., and Lent A. Iterative algorithms for large partitioned linear systems, with applications to image reconstruction. Linear Algebra and Its Applications 40 (1981) 37-67
24. Elfving T. Block-iterative methods for consistent and inconsistent linear equations. Numerische Mathematik 35 (1980) 1-12
25. Elsner L., Koltracht I., and Neumann M. Convergence of sequential and asynchronous nonlinear paracontractions. Numerische Mathematik 62 (1992) 305-319
26. Gubin L.G., Polyak B.T., and Raik E.V. The method of projections for finding the common point of convex sets. USSR Computational Mathematics and Mathematical Physics 7 (1967) 1-24
27. Iusem A.N., and De Pierro A.R. Convergence results for an accelerated nonlinear Cimmino algorithm. Numerische Mathematik 49 (1986) 367-378
28. Kiwiel K.C. Generalized Bregman projections in convex feasibility problems. Journal of Optimization Theory and Applications 96 (1998) 139-157
29. Kotzer T., Cohen N., and Shamir J. A projection-based algorithm for consistent and inconsistent constraints. SIAM Journal on Optimization 7 (1997) 527-546
30. Lyszyk D., and Shamir J. Signal processing under uncertain conditions by parallel projections onto fuzzy sets. Journal of the Optical Society of America A 16 (1999) 1602-1611
31. Pierra G. Decomposition through formalization in a product space. Mathematical Programming 28 (1984) 96-115
32. Reich S. A limit theorem for projections. Linear and Multilinear Algebra 13 (1983) 281-290
33. Rockafellar R.T. Convex Analysis (1970), Princeton University Press, Princeton, New Jersey