Optimization Online


Reduntant axioms in the definitionof Bregman functions

Dan Butnariu (dbutnaru***at***math.haifa.ac.il)
Charles Byrne (Charles_Byrne***at***uml.edu)
Yair Censor (yair***at***math.haifa.ac.il)

Abstract: The definition of a Bregman function, given by Censor and Lent in 1981 on the basis of Bregman's seminal 1967 paper, was subsequently used in a plethora of research works as a tool for building sequential and inherently parallel feasibility and optimization algorithms. Solodov and Svaiter have recently shown that it is not

Keywords: Bregman function, Bregman distance, Kullback-Leibler distance, modulus of total convexity, sequential consistency, totally convex function.

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: Journal of Convex Analysis, Vol. 10 (2003), pp. 245-254.


Entry Submitted: 03/17/2002
Entry Accepted: 03/17/2002
Entry Last Modified: 10/04/2004

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society