Iterative Averaging of Entropic Projections for Solving Stochastic Convex Feasibility Problems

Computational Optimization and Applications

Volumn 8, Issue 1, 1997, Pages 21-39

  Butnariu, Dan ^a   Censor, Yair ^a   Reich, Simeon ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Bregman projection; Entropic projection; Modulus of local convexity; Stochastic convex feasibility problem; Very convex function

Indexed keywords

ENTROPY; ITERATIVE METHODS; MATHEMATICAL OPERATORS; PROBABILITY; SET THEORY; THEOREM PROVING;

ENTROPIC PROJECTIONS;

RANDOM PROCESSES;

EID: 0031188734     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008654413997     Document Type: Article

References (20)

1. Y. Alber and D. Butnariu, "Convergence of Bregman-prqjection methods for solving consistent convex feasibility problems in reflexive Banach spaces," J. Optim. Theory and Appl., vol. 92, pp. 33-61, 1997.
2. J.-P. Aubin and H. Frankowska, Set-Valued Analysis, Birkhäuser: Boston, 1990.
3. H.H. Bauschke and J.M. Borwein, "On projection algorithms for solving convex feasibility problems," SIAM Review, vol. 38, pp. 367-426, 1996.
4. H.H. Bauschke and J.M. Borwein, "Legendre functions and the method of random Bregman projections," Convex Analysis (to appear).
5. L.M. Bregman, "The relaxation method for finding the common point of convex sets and its application to the solution of convex programming," USSR Comp. Math, and Math. Phys., vol. 7, pp. 200-217, 1967.
6. D. Butnariu, "The expected-projection method: Its behavior and applications to linear operator equations and convex optimization," J. Applied Analysis, vol. 1, pp. 95-108, 1995.
7. D. Butnariu and Y. Censor, "Strong convergence of almost simultaneous projection methods in Hilbert spaces," J. Comput. Appl. Math., vol. 53, pp. 33-42, 1994.
8. D. Butnariu and S.D. Flåm, "Strong convergence of expected-projection methods in Hilbert spaces," Numer. Funct. Anal. Optim., vol. 15, pp. 601-636, 1995.
9. Y. Censor and A. Lent, "An iterative row-action method for interval convex programming," J. Optim. Theory and Appl., vol. 34, no. 3, pp. 321-353, 1981.
10. Y. Censor and T. Elfving, "A multiprojection algorithm using Bregman projections in a product space," Numerical Algorithms, vol. 8, pp. 221-239, 1994.
11. Y. Censor and S. Reich, "Iterations of paracontractions and firmly nonexpansive operators with applications to feasibility and optimization," Optimization, vol. 37, pp. 323-339, 1996.
12. F.H. Clarke, Optimization and Nonsmooth Analysis, John Willey & Sons: New York, 1983.
13. P.L. Combettes, "The foundations of set theoretic estimation," Proc. IEEE, vol. 81, pp. 182-208, 1993.
14. A.R. De Pierro and A.N. Iusem, "A relaxed version of Bregman's method for convex programming," J. Optim. Theory Appl., vol. 51, pp. 421-440, 1986.
15. P.R. Halmos, Measure Theory, Springer-Verlag: New York, 1974.
16. A.N. Iusem and A.R. De Pierro, "Convergence results for an accelerated Cimmino algorithm," Numer. Math., vol. 49, pp. 347-368, 1986.
17. R.R. Phelps, Convex Functions, Monotone Operators and Differentiability, Springer-Verlag: Berlin, 1993.
18. R.T. Rockafellar and R.J.-B. Wets, "Scenarios and policy aggregation in optimization under uncertainty," Mathematics of Operation Research, vol. 16, pp. 119-147, 1991.
19. A.A. Vladimirov, Y.E. Nesterov, and Y.N. Cekanov, "Uniformly convex functions," Vestnik Moskovskaya Universiteta, Series Matematika i Kybernetika, vol. 3, pp. 12-23, 1978.
20. R.J.-B. Wets, "Stochastic Programming," in Handbook of Operation Research and Management Sciences, G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd (Eds.), vol. 1: Optimization, North-Holland, Amsterdam, pp. 573-629, 1989.