Iterations of paracontractions and firmly nonexpansive operators with applications to feasibility and optimization

Optimization

Volumn 37, Issue 4, 1996, Pages 323-339

  Censor, Y ^a   Reich, S ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Asymptotic fixed point; Bregman function; Firmly nonexpansive; Generalized distance; Paracontractions; Projection; Repetitive control

Indexed keywords

EID: 0030456727     PISSN: 02331934     EISSN: None     Source Type: Journal    
DOI: 10.1080/02331939608844225     Document Type: Article

References (33)

1. Aharoni, R. Berman, A. and Censor, Y. (1983) An interior points algorithm for the convex feasibility problem, Advances in Applied Mathematics, 4, 479-489
2. Bauschke, H. H. and Borwein, J. M. (1993) On projection algorithms for solving convex feasibility problems, Research Report 93-12, Dept. of Mathematics and Statistics, Simon Fraser University, Burnaby, B.C., Canada, June. SIAM Review, to appear
3. Ben-Tal, A., Charnes, A. and Teboulle, M. (1989) Entropie means, Journal of Mathematical Analysis and Applications, 139, 537-551
4. Bregman, L. M. (1967) 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, 200-217
5. Butnariu, D. and Censor, Y. (1990) On the behavior of a block-iterative projection method for solving convex feasibility problems, International Journal of Computer Mathematics, 34, 79-94
6. Byrne, C. L. (1993) Iterative image reconstruction algorithms based on cross-entropy minimization, IEEE Transactions on Image Processing, 2, 96-103. Erratum and Addendum, ibid., 4, 225-226, 1995
7. Censor, Y. (1981) Row-action methods for huge and sparse systems and their applications, SIAM Review, 23, 444-464
8. Censor, Y. (1988) Parallel application of block-iterative methods in medical imaging and radiation therapy, Mathematical Programming, 42, 307-325
9. Censor, Y. and Lent, A. (1981) An interative row-action method for interval convex programming, Journal of Optimization Theory and Applications, 34, 321-353
10. Censor, Y. De Pierro, A. R. Elfving, T. Herman, G. T. and Iusem, A. N. (1990) On iterative methods for linearly constrained entropy maximization, in: Numerical Analysis and Mathematical Modelling, (Wakulicz, A.Editor), Banach Center Publications XXIX, PWN-Polish Scientific Publishers, Warsaw, Poland, pp. 145-163
11. Censor, Y., De Pierro, A. R. and Iusem, A.N. (1991) Optimization of Burg's entropy over linear constraints, Applied Numerical Mathematics, 7, 151-165
12. Censor, Y. and Zenios, S. A. (1992) Proximal minimization algorithm with D-functions, Journal of Optimization Theory and Applications, 73, 451-464
13. Censor, Y. and Elfving, T. (1994) A multiprojection algorithm using Bregman projections in a product space, Numerical Algorithms, 8, 221-239
14. Censor, Y., Iusem, A. N. and Zenios, S. A. (1994) An interior point method with Bregman functions for the variational inequality problem with paramonotone operators, Technical Report
15. Chen, G. and Teboulle, M. (1993) Convergence analysis of a proximal-like optimization algorithm using Bregman functions, SIAM Journal on Optimization, 3, 538-543
16. Combettes, P. L. (1993) The foundations of set theoretic estimation, Proceedings of The IEEE, 81, 182-208
17. Csiszár, I. (1991) Why least squares and maximum entropy? An axoimatic approach to inference for linear inverse problems, The Annals of Statistics, 19, 2032-2066
18. De Pierro, A. R. and Iusem, A. N. (1986) A relaxed version of Bregman's method for convex programming, Journal of Optimization Theory and Applications, 51, 421-440
19. Dye, J. M. and Reich, S. (1992) Random products of nonexpansive mappings, in; "Optimization and Nonlinear Analysis", (A. Ioffe, M. Marcus and S. Reich, Editors), Longman Scientific and Technical, Harlow, Great Britain pp. 106-118
20. Eckstein, J. (1993) Nonlinear proximal point algorithms using Bregman functions with applications to convex programming, Mathematics of Operations Research, 18, 202-226
21. Eggermont, P. P. B. (1990) Multiplicative iterative algorithms for convex programming, linear Algebra and Its Applications, 130, 25-42
22. Elfving, T. (1989) An algorithm for maximum entropy image reconstruction from noisy data, Mathematical and Computer Modelling, 12, 729-745
23. Elsner, L. Koltracht, I. and Neumann, M. (1992) Convergence of sequential asynchronous nonlinear paracontractions, Numerische Mathematik, 62, 305-319
24. Goebel, K. and Reich, S. (1984) Uniform Convexity, Hyperbolic Geometry and Nonexpansive Mappings, Marcel Dekker, New York and Basel
25. Gubin, L. G., Polyak, B. T. and Raik, E. V. (1967) The method of projection for finding the common point of convex sets, USSR Computational Mathematics and Mathematical Physics, 7, 1-24
26. Hurt, N. E. (1989) Phase Retrieval and Zero Crossings: Mathematical Methods in Image Reconstruction, Kluwer Academic Publishers, Dordrecht, The Netherlands
27. Iusem, A. N. (1991) On dual convergence and the rate of primal convergence of Bregman's convex programming method, SIAM Journal on Optimization, 1, 401-423
28. Kiwiel, K. C. (1995) Block-iterative surrogate projection methods for convex feasibility problems, Linear Algebra and its Applications, 215, 225-259
29. Pierra, G. (1984) Decomposition through formalization in a product space, Mathematical Programming, 28, 96-115
30. Stark H. Editor (1987) Image Recovery: Theory and Applications, Academic Press, Orlando, Florida
31. Teboulle, M. (1992) Entropie proximal mappings with applications to nonlinear programming, Mathematics of Operations Research, 17, 670-690
32. Tseng, P. (1992) On the convergence of the products of firmly nonexpansive mappings, SIAM Journal on Optimization, 2, 425-434
33. Censor, Y. and Zenios, S.A. (1996, forthcoming) Parallel Optimization: Theory, Algorithms and Applications, Oxford University Press, New York, USA