The generalized Bregman distance
Files
(Published version)
Date
2021
Authors
Burachik, R.S.
Dao, M.N.
Lindstrom, S.B.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
SIAM Journal on Optimization, 2021; 31(1):404-424
Statement of Responsibility
Conference Name
Abstract
Recently, a new kind of distance has been introduced for the graphs of two point-to-set operators, one of which is maximally monotone. When both operators are the subdifferential of a proper lower semicontinuous convex function, this kind of distance specializes under modest assumptions to the classical Bregman distance. We name this new kind of distance the generalized Bregman distance, and we shed light on it with examples that utilize the other two most natural representative functions: the Fitzpatrick function and its conjugate. We provide sufficient conditions for convexity, coercivity, and supercoercivity: properties which are essential for implementation in proximal point type algorithms. We establish these results for both the left and right variants of this new kind of distance. We construct examples closely related to the Kullback--Leibler divergence, which was previously considered in the context of Bregman distances and whose importance in information theory is well known. In so doing, we demonstrate how to compute a difficult Fitzpatrick conjugate function, and we discover natural occurrences of the Lambert ${\mathcal W}$ function, whose importance in optimization is of growing interest.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2021 SIAM
Access Condition Notes: Accepted manuscript available on open access