Legendre functions and the method of random bregman projections

Journal of Convex Analysis

Volumn 4, Issue 1, 1997, Pages 27-67

  Bauschke, Heinz H ^a   Borwein, Jonathan M ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Bregman function; Bregman projection; Convex feasibility problem; Convex function; Convex set; Essentially smooth function; Essentially strictly convex function; Hermitian matrix; Legendre function; Projection

Indexed keywords

EID: 21744459385     PISSN: 09446532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (32)

1. Y. Alber and D. Butnariu: Convergence of Bregman-projection methods for solving consistent convex feasibility problems in reflexive Banach spaces. Journal of Optimization Theory and Applications (1994) Accepted for Publication.
2. H.H. Bauschke: A norm convergence result on random products of relaxed projections in Hilbert space. Transactions of the American Mathematical Society, 347(4) (1995) 1365-1374.
3. H.H. Bauschke and J.M. Borwein: On projection algorithms for solving convex feasibility problems. SIAM Review 38(3) (1996) 367-426.
4. 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. U.S.S.R. Computational Mathematics and Mathematical Physics 7(3) (1967) 200-217.
5. R.S. Burachik: Generalized Proximal Point Methods of the Variational Inequality Problem. PhD thesis, Rio de Janeiro, 1995.
6. Y. Censor and T. Elfving: A multiprojection algorithm using Bregman projections in a product space. Numerical Algorithms 8 (1994) 221-239.
7. Y. Censor and A. Lent: An iterative row-action method for interval convex programming. Journal of Optimization Theory and Applications 34(3) (1981) 321-353.
8. Y. Censor and A. Lent: Optimization of "log x" entropy over linear equality constraints. SIAM Journal on Control and Optimization 25(4) (1987) 921-933.
9. Y. Censor, A.R. de Pierro, T. Elfving, G.T. Herman, and A.N. Iusem: On iterative methods for linearly constrained entropy maximization. In A. Wakulicz, editor, Numerical Analysis and Mathematical Modelling, pages 145-163, Warsaw, 1990. Polish Scientific Publishers. Banach Center Publications Volume 24.
10. Y. Censor, A.R. de Pierro, and A.N. Iusem: On maximization of entropies and a generalization of Bregman's method for convex programming. Technical Report MIPG 113, Medical Image Processing Group, Department of Radiology, University of Pennsylvania, Philadelphia, U.S.A., 1986.
11. Y. Censor, A.R. de Pierro, and A.N. Iusem: Optimization of Burg's entropy over linear constraints. Applied Numerical Mathematics 7 (1991) 151-165.
12. Y. Censor and S. Reich: Iterations of paracontractions and firmly nonexpansive operators with applications to feasibility and optimization. Optimization 37(4) (1996) 323-339.
13. G. Chen and M. Teboulle: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM Journal on Optimization 3(3) (1993) 538-543.
14. J. Eckstein: Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming. Mathematics of Operations Research 18(1) (1993) 202-226.
15. L. Elsner, I. Koltracht, and M. Neumann: Convergence of sequential and asynchronous nonlinear paracontractions. Numerische Mathematik 62 (1992) 305-319.
16. S.D. Flåm and J. Zowe: Relaxed outer projections, weighted averages and convex feasibility. BIT 30 (1990) 289-300.
17. J.-B. Hiriart-Urruty and G. Lemaréchal: Convex Analysis and Minimization Algorithms II, volume 306 of Grundlehren der mathematischen Wissenschaften. Springer-Verlag, 1993.
18. A.N. Iusem, 1994: Personal communication.
19. A.N. Iusem: Proximal point methods in optimization, May 1994. Unpublished manuscript.
20. K.C. Kiwiel: conference talk in Ann Arbor, Michigan, August 1994.
21. K.C. Kiwiel: Free-steering relaxation methods for problems with strictly convex costs and linear constraints. WP-94-89, International Institute for Applied Systems Analysis, Laxenburg, Austria, September 1994. Revised July 1995.
22. A.S. Lewis: Convex analysis on the Hermitian matrices. SIAM Journal on Optimization 6(1) (1996) 164-177.
23. A.S. Lewis, 1994: Personal communication.
24. A.S. Lewis: The convex analysis of unitarily invariant matrix norms. Journal of Convex Analysis 2 (1995) 173-183.
25. A.S. Lewis: Derivatives of spectral functions. Mathematics of Operations Research 21(3) (1996) 576-588.
26. A.S. Lewis: Group invariance and convex matrix analysis. SIAM Journal on Matrix Analysis 17(4) (1996) 927-949.
27. A.W. Marshall and I. Olkin: Inequalities: Theory of Majorization and Its Applications, volume 143 of Mathematics in Science and Engineering. Academic Press, New York, 1979.
28. G. Pierra: Decomposition through formalization in a product space. Mathematical Programming 28 (1984) 96-115.
29. 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(3) (1986) 421-440.
30. R.T. Rockafellar: Convex Analysis. Princeton University Press, Princeton, NJ, 1970.
31. M. Teboulle: Entropic proximal mappings with applications to nonlinear programming. Mathematics of Operations-Research 17(3) (1992) 670-690.
32. P. Tseng: On the convergence of the products of firmly nonexpansive mappings. SIAM Journal on Optimization 2(3) (1992) 425-434.