Abstract
The stochastic convex feasibility problem (SCFP) is the problem of finding almost common points of measurable families of closed convex subsets in reflexive and separable Banach spaces. In this paper we prove convergence criteria for two iterative algorithms devised to solve SCFPs. To do that, we first analyze the concepts of Bregman projection and Bregman function with emphasis on the properties of their local moduli of convexity. The areas of applicability of the algorithms we present include optimization problems, linear operator equations, inverse problems, etc., which can be represented as SCFPs and solved as such. Examples showing how these algorithms can be implemented are also given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ya. Alber, “Metric and generalized projection operators in Banach spaces,” in Functional Differential Equations, M.E. Drakhlin and E. Litsyn (Eds.), The Research Institute of the College of Iudea and Samaria Publications: Kedumim-Ariel, Israel, 1993, pp. 1-21.
Ya. Alber and D. Butnariu, “Convergence of Bregman-projection methods for solving convex feasibility problems in reflexive Banach spaces,” J. Optim. Theory Appl., vol. 92, pp. 33-61, 1997.
J.-P. Aubin and H. Frankowska, Set-Valued Analysis, Birkhäuser: Basel, 1990.
H.H. Bauschke and J.M. Borwein, “On projection algorithms for solving convex feasibility problems,” SIAM Rev., vol. 38, pp. 367-426, 1996.
H.H. Bauschke and J.M. Borwein, “Legendre functions and the method of random Bregman projections,” J. Convex Anal., vol. 4, pp. 27-67, 1997.
L.M. Bregman, “The relaxation method for finding common points of convex sets and its application to the solution of convex programming,” USSR Comp. Math. and Math. Phys., vol. 7, pp. 200-217, 1967.
H. Brezis, Analyse Fonctionelle: Théorie et Applications, Masson: Paris, 1983.
F.E. Browder, “Nonlinear operators and nonlinear equations of evolution in banach spaces,” in Proceedings of Symposia in Pure Mathematics, vol. XVIII, Part 2, American Mathematical Society: Providence, Rhode Island, 1976.
R.S. Burachik, “Generalized proximal point methods for the variational inequality problem,” Ph.D. Thesis, Instituto de Matemática Pura e Aplicada, Rio de Janeiro, Brazil, 1995.
D. Butnariu, “The expected-projection methods: Its behavior and applications to linear operator equations and convex optimization,” J. Applied Analysis, vol. 1, no. 1, pp. 95-108, 1995.
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.
D. Butnariu, Y. Censor, and S. Reich, “Iterative averaging of entropic projections for solving stochastic convex feasibility problems,” Comput. Optim. Appl., vol. 8, pp. 21-38, 1997.
D. Butnariu and S.D. Flå m, “Strong convergence of expected projection methods in Hilbert spaces,” Numer. Funct. Anal. Optim., vol. 16, pp. 601-636, 1995.
D. Butnariu and A.N. Iusem, “Local moduli of convexity and their applications to finding almost common fixed points of mesurable families of operators,” in Recent Developments in Optimization and Nonlinear Analysis, Contemporary Mathematics, vol. 204, Y. Censor and S. Reich (Eds.), American Mathematical Society: Providence, Rhode Island, 1997, pp. 33-61.
D. Butnariu and A. Mehrez, “Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems,” Comput. Optim. Appl., vol. 1, pp. 307-326, 1992.
Y. Censor and A. Lent, “An iterative row action method for interval convex programming,” J. Optim. Theory Appl., vol. 34, no. 3, pp. 321-353, 1981.
Y. Censor and S. Zenios, Parallel Optimization: Theory, Algorithms and Applications, Oxford University Press, 1997.
G. Cimmino, Calcolo approsimato per le soluzioni di sistemi di ecuazioni lineari, La Riserca Scientifica, Roma, XVI, Anno IX, vol. 2, pp. 326-333, 1938.
F.H. Clarke, Optimization and Nonsmooth Analysis, John Wiley and Sons: New York, 1983.
P.L. Combettes, “The convex feasibility problem in image recovery,” in Advances in Imaging and Electron Phiyisc, vol. 95, P. Hawkes (Ed.), Academic Press: New York, 1995, pp. 155-270.
A.R. De Pierro and A.N. Iusem, “A parallel projection method for finding a common point of a family of convex sets,” Pesquisa Operacional, vol. 5, pp. 243-253, 1985.
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.
V.I. Isratescu, Strict Convexity and Complex Strict Convexity, Lecture Notes in Pure and Applied Mathematics, vol. 89, Marcel Dekker: New York, 1984.
A.N. Iusem and A.R. De Pierro, “Convergence results for an accelerated Cimmino algorithm,” Numer. Math., vol. 49, pp. 347-368, 1986.
W.J. Kammerer and M.Z. Nashed, “Iterative methods for best approximate solutions of linear integral equations of the first and second kind,” J. Math. Anal. Appl., vol. 40, pp. 547-573, 1972.
L.V.K. Kantorovich and G.P. Akilov, Functional Analysis, Pergamon Press: Oxford, 1982.
J. Mikusinski, The Bochner Integral, Academic Press: New York, 1978.
J. von Neumann, Functional Operators-Vol. II, The Geometry of Orthogonal Spaces, in Annals of Mathematics Studies, No. 22, Princeton University Press, 1950. (Reprint of mimeographed lecture notes distributed in 1933.)
R.R. Phelps, Convex Functions, Monotone Operators and Differentiability, 2nd Edition, Springer Verlag: Berlin, 1993.
S. Reich, “A weak convergence theorem for the alternanting method with Bregman distances,” in Theory and Applications of Nonlinear Operators of Accretive and Monotone Types, A.G. Kartsatos (Ed.), Marcel Dekker: New York, 1996, pp. 313-318.
R.T. Rockafellar and R.J.-B. Wets, “Scenarios of policy aggregation in optimization under uncertainty,” Math. Oper. Res., vol. 16, pp. 119-147, 1991.
A.A. Vladimirov, Y.E. Nesterov, and Y.N. Chekanov, “Uniformly convex functionals,” Vestnik Moskovskaya Universiteta, Series Mathematika i Kybernetika, vol. 3, pp. 12-23, 1978, in Russian.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Butnariu, D., Iusem, A.N. & Burachik, R.S. Iterative Methods of Solving Stochastic Convex Feasibility Problems and Applications. Computational Optimization and Applications 15, 269–307 (2000). https://doi.org/10.1023/A:1008795702124
Issue Date:
DOI: https://doi.org/10.1023/A:1008795702124