Abstract
Every maximally monotone operator can be associated with a family of convex functions, called the Fitzpatrick family or family of representative functions. Surprisingly, in 2017, Burachik and Martínez-Legaz showed that the well-known Bregman distance is a particular case of a general family of distances, each one induced by a specific maximally monotone operator and a specific choice of one of its representative functions. For the family of generalized Bregman distances, sufficient conditions for convexity, coercivity, and supercoercivity have recently been furnished. Motivated by these advances, we introduce in the present paper the generalized left and right envelopes and proximity operators, and we provide asymptotic results for parameters. Certain results extend readily from the more specific Bregman context, while others only extend for certain generalized cases. To illustrate, we construct examples from the Bregman generalizing case, together with the natural “extreme” cases that highlight the importance of which generalized Bregman distance is chosen.
Similar content being viewed by others
Notes
In [7], the authors assume joint convexity and coercivity of \({\mathcal {D}}_f\) to obtain non-emptiness of the right proximity operator images by [6, Proposition 3.5]; the latter result relies on the lower semicontinuity of the right distance as shown in [6, Lemma 2.6]. Thus, our rather weak assumption that the right distance be lower semicontinuous is much less restrictive than the assumptions in [7].
References
Attouch, H.: Convergence de fonctions convexes, des sous-différentiels et semi-groupes associés. Comptes Rendus de l’Académie des Sciences de Paris 284, 539–542 (1977)
Attouch, H.: Variational Convergence for Functions and Operators. Pitman, Boston (1984)
Attouch, H., Wets, R.J.-B.: Approximation and convergence in nonlinear optimization. In: Mangasarian, O., Meyer, R., Robinson, S. (eds.) Nonlinear Programming, vol. 4, pp. 367–394. Academic Press, New York (1983)
Bauschke, H.H., Borwein, J.M.: Legendre functions and the method of random Bregman projections. J. Convex Anal. 4(1), 27–67 (1997)
Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, Cham (2017)
Bauschke, H.H., Combettes, P.L., Noll, D.: Joint minimization with alternating Bregman proximity operators. Pac. J. Optim. 2(3), 401–424 (2006)
Bauschke, H.H., Dao, M.N., Lindstrom, S.B.: Regularizing with Bregman-Moreau envelopes. SIAM J. Optim. 28(4), 3208–3228 (2018)
Bauschke, H.H., Lindstrom, S.B.: Proximal averages for minimization of entropy functionals. Pure Appl. Funct. Anal. 5(3), 505–531 (2020)
Bauschke, H.H., McLaren, D.A., Sendov, H.S.: Fitzpatrick functions: inequalities, examples, and remarks on a problem by S. Fitzpatrick. J. Convex Anal. 13(3–4), 499–523 (2006)
Borwein, J.M., Lindstrom, S.B.: Meetings with Lambert W and other special functions in optimization and analysis. Pure Appl. Funct. Anal. 1(3), 361–396 (2017)
Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200–217 (1967)
Brezis, H.: Functional Analysis. Sobolev Spaces and Partial Differential Equations. Springer, New York (2011)
Burachik, R.S., Dao, M.N., Lindstrom, S.B.: The generalized Bregman distance. SIAM J. Optim. 31(1), 404–424 (2021)
Burachik, R.S., Dutta, J.: Inexact proximal point methods for variational inequality problems. SIAM J. Optim. 20(5), 2653–2678 (2010)
Burachik, R.S., Iusem, A.N.: A generalized proximal point algorithm for the variational inequality problem in a Hilbert space. SIAM J. Optim. 8(1), 197–216 (1998)
Burachik, R.S., Iusem, A.N.: Set-Valued Mappings and Enlargements of Monotone Operators. Springer, New York (2008)
Burachik, R., Kassay, G.: On a generalized proximal point method for solving equilibrium problems in Banach spaces. Nonlinear Anal. 75(18), 6456–6464 (2012)
Burachik, R.S., Martínez-Legaz, J.E.: On Bregman-type distances for convex functions and maximally monotone operators. Set Valued Var. Anal. 26(2), 369–384 (2018)
Burachik, R.S., Svaiter, B.F.: Maximal monotone operators, convex functions and a special family of enlargements. Set Valued Anal. 10(4), 297–316 (2002)
Byrne, C., Censor, Y.: Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback–Leibler distance minimization. Ann. Oper. Res. 105(1–4), 77–98 (2001)
Censor, Y., Zenios, S.A.: Proximal minimization algorithm with D-functions. J. Optim. Theory Appl. 73(3), 451–464 (1992)
Chao, H., Vandenberghe, L.: Entropic proximal operators for nonnegative trigonometric polynomials. IEEE Trans. Signal Process. 66(18), 4826–4838 (2018)
Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3(3), 538–543 (1993)
Chrétien, S., Guyeux, C., Conesa, B., Delage-Mouroux, R., Jouvenot, M., Huetz, P., Descôtes, F.: A Bregman-proximal point algorithm for robust non-negative matrix factorization with possible missing values and outliers - application to gene expression analysis. BMC Bioinform. 17(8), 623–631 (2016)
Corless, R.M., Gonnet, G.H., Hare, D.E., Jeffrey, D.J., Knuth, D.E.: On the Lambert W function. Adv. Comput. Math. 5(1), 329–359 (1996)
Diestel, J.: Sequences and Series in Banach Spaces. Springer, New York (1984)
Djafari Rouhani, B., Mohebbi, V.: Proximal point method for quasi-equilibrium problems in Banach spaces. Numer. Funct. Anal. Optim. 41(9), 1007–1026 (2020)
Eckstein, J.: Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming. Math. Oper. Res. 18(1), 202–226 (1993)
Fitzpatrick, S.: Representing monotone operators by convex functions. In: Proceedings of The Centre for Mathematical Analysis, Australian National University, vol. 20, pp. 59–65 (1988)
Hiriart-Urruty, J.-B.: Conditions for global optimality. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 1–26. Springer, Boston (1995)
Jiang, X., Vandenberghe, L.: Bregman primal-dual first-order method and application to sparse semidefinite programming, (2020). Available at https://www.optimization-online.org/DB_HTML/2020/03/7702.html
Kiwiel, K.C.: Proximal minimization methods with generalized Bregman functions. SIAM J. Control Optim. 35(4), 1142–1168 (1997)
Moreau, J.-J.: Fonctions convexes duales et points proximaux dans un espace hilbertien. Comptes Rendus de l’Académie des Sciences 255, 2897–2899 (1962)
Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, Berlin (1998)
Schirotzek, W.: Nonsmooth Analysis. Springer, Berlin (2007)
Zălinescu, C.: Convex Analysis in General Vector Spaces. World Scientific, Singapore (2002)
Acknowledgements
The authors are grateful to the two anonymous referees for their careful comments and suggestions. Part of this work was done during MND’s visit to the University of South Australia in 2018 to whom he acknowledges the hospitality. SBL was supported by an Australian Mathematical Society Lift-Off Fellowship and by Hong Kong Research Grants Council PolyU153085/16p.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Juan-Enrique Martínez-Legaz.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
A Appendix: Closed Forms for Envelopes and Proximity Operators
A Appendix: Closed Forms for Envelopes and Proximity Operators
For all our examples, we use the closed distances as described in Remark 2.4. The function denoted \({\mathcal {W}}\) is the principal branch of the Lambert \({\mathcal {W}}\) function, whose occurrences in variational analysis have been discussed in, for example, [8, 10, 25].
Example A.1
(Left prox and envelope for \(\overline{{\mathcal {D}}}^{F_{\log }}\))
Beginning with the smallest member of \({\mathcal {H}}(\log )\), we first consider the left envelope and corresponding proximity operator characterized by
where \(F_{\log }\) is given in [9, Example 3.6] and \(\overline{{\mathcal {D}}^{F_{\log }}}\) is in (39). We have that
The envelope is shown in Fig. 2a.
Example A.2
(Right prox and envelope for \(\overline{{\mathcal {D}}}^{F_{\log }}\))
We next consider the right envelope and corresponding proximity operator characterized by
We use the selection operator \(\overrightarrow{{\text {s}}}_ {\negthinspace \negthinspace \gamma ,\theta }^{F_{\log }}\) because, in this case, the prox operator \(\overrightarrow{{\text {P}}}_ {\negthinspace \negthinspace \gamma ,\theta }^{F_{\log }}\) is set-valued:
The corresponding right envelope is
The envelope is shown in Fig. 3a.
Example A.3
(Left prox and envelope for \(\overline{{\mathcal {D}}}^{\sigma _{\log }}\))
Turning to the biggest of the representative functions for the logarithm, we next consider the left envelope and corresponding proximity operator characterized by
where \(\overline{{\mathcal {D}}^{\sigma _{\log }}}\) is as in 41. We have that
The corresponding envelope is
The envelope is shown in Fig. 2c.
Example A.4
(Right prox and envelope for \(\overline{{\mathcal {D}}}^{\sigma _{\log }}\)) We consider the right envelope and corresponding proximity operator characterized by
The corresponding proximity operator is
while the corresponding envelope is
The envelope is shown in Fig. 3c.
The operators in Example A.5 (and their computation) may be found in [7], with the minor modification that here we are computing with the lower closure of the distance and so obtain closed forms which differ at zero. We include them here for their comparison with the new GBDs for the logarithm.
Example A.5
(Proxes and envelopes for \(\overline{{\mathcal {D}}}^{{\text {ent}}\oplus {\text {ent}}^*}\)) We next consider the case when \(\overline{{\mathcal {D}}}^{{\text {ent}}\oplus {\text {ent}}^*}\) is the closed GBD for the Fenchel–Young representative of \(\log \) (37), a case whose relationship to the Bregman distance for the Boltzmann–Shannon entropy is discussed in Example 2.2. The left proximity operator and envelope are given by
For details, see [7, Example 4.1(ii)]. The envelope is shown in Fig. 2b. The right proximity operator and envelope are given by
For details, see [7, Example 4.1(ii)]. The envelope is shown in Fig. 3b.
Rights and permissions
About this article
Cite this article
Burachik, R.S., Dao, M.N. & Lindstrom, S.B. Generalized Bregman Envelopes and Proximity Operators. J Optim Theory Appl 190, 744–778 (2021). https://doi.org/10.1007/s10957-021-01895-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-021-01895-y
Keywords
- Convex function
- Fitzpatrick function
- Generalized Bregman distance
- Maximally monotone operator
- Moreau envelope
- Proximity operator
- Regularization
- Representative function