Redundant axioms in the definition of Bregman functions

Journal of Convex Analysis

Volumn 10, Issue 1, 2003, Pages 245-254

  Butnariu, Dan ^a   Byrne, Charles ^b   Censor, Yair ^a  

^a UNIVERSITY OF HAIFA   (Israel)

^b UNIVERSITY OF MASSACHUSETTS LOWELL   (United States)

Author keywords

Bregman distance; Bregman function; Kullback Leibler distance; Modulus of total convexity; Sequential consistency; Totally convex function

Indexed keywords

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

References (11)

1. H. H. Bauschke, J. M. Borwein: Legendre functions and the method of random Bregman projections, Journal of Convex Analysis 4 (1997) 27-67.
2. H. H. Bauschke, J. M. Borwein: Joint and separate convexity of the Bregman distance, in: Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, D. Butnariu, Y. Censor, S. Reich (eds.), Elesevier Science, Amsterdam, Netherlands (2001) 23-36.
3. L. M. Bregman: The relaxation method for 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.
4. D. Butnariu, Y. Censor, S. Reich: Iterative averaging of entropic projections for solving stochastic convex feasibility problems, Computational Optimization and Applications 8 (1997) 21-39.
5. D. Butnariu, A. N. Iusem: Totally Convex Function for Fixed Points Computation and Infinite Dimensional Optimization, Kluwer Academic Publishers, Dordrecht, Netherlands (2000).
6. C. Byrne, Y. Censor: Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback-Leibler distance minimization, Annals of Operations Research 105 (2001) 77-98.
7. Y. Censor, A. Lent: An iterative row-action method for interval convex programming, Journal of Optimization Theory and Applications 34 (1981) 322-353.
8. Y. Censor, S. A. Zenios: Parallel Optimization: Theory, Algorithms, and Applications, Oxford University Press, New York (1997).
9. K. Kiwiel: Free-steering relaxation methods for problems with strictly convex costs and linear constraints, Mathematics of Operations Research 22 (1997) 326-349.
10. R. T. Rockafellar: Convex Analysis, Princeton University Press, Princeton, New Jersey (1970).
11. M. V. Solodov, B. F. Svaiter: An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions, Mathematics of Operations Research 25 (2000) 214-230.