Skip to main content
Log in

Abstract

The Moreau envelope, also known as Moreau–Yosida regularization, and the associated proximal mapping have been widely used in Hilbert and Banach spaces. They have been objects of great interest for optimizers since their conception more than half a century ago. They were generalized by the notion of the D-Moreau envelope and D-proximal mapping by replacing the usual square of the Euclidean distance with the conception of Bregman distance for a convex function. Recently, the D-Moreau envelope has been developed in a very general setting. In this article, we present a regularizing and smoothing technique for convex functions defined in Banach spaces. We also investigate several properties of the D-Moreau envelope function and its related D-proximal mapping in Banach spaces. For technical reasons, we restrict our attention to the Lipschitz continuity property of the D-proximal mapping and differentiability properties of the D-Moreau envelope function. In particular, we prove the Fréchet differentiability property of the envelope and the Lipschitz continuity property of its derivative.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Fukushima, M., Qi, L.: A globally and superlinearly convergent algorithm for nonsmooth convex minimization. SIAM J. Optim. 6, 1106–1120 (1996)

    Article  MathSciNet  Google Scholar 

  2. Rockefeller, R.T.: Monotone operators and proximal point algorithm. SIAM J. Control Optim. 14, 877–898 (1976)

    Article  MathSciNet  Google Scholar 

  3. Attouch, H.: Variational Convergence for Functions and Operators. Pitman Advanced Publishing Program, Boston (1984)

    MATH  Google Scholar 

  4. Moreau, J.J.: Proximité et dualité dans un espace hilbertien. Bull. Soc. Math. France 93, 273–299 (1965)

    Article  MathSciNet  Google Scholar 

  5. Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York (2011)

    Book  Google Scholar 

  6. Burger, M., Sawatzky, A., Steidl, G.: First order algorithms in variational image processing. In: Splitting Methods in Communication, Imaging, Science, and Engineering, pp. 345–407. Springer, Cham (2016)

  7. Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1, 127–239 (2014)

    Article  Google Scholar 

  8. Censor, Y., Lent, A.: An iterative row-action method for interval convex programming. J. Optim. Theory Appl. 34, 321–353 (1981)

    Article  MathSciNet  Google Scholar 

  9. 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, 200–217 (1967)

    Article  MathSciNet  Google Scholar 

  10. Kan, C., Song, W.: The Moreau envelope function and proximal mapping in the sense of the Bregman distance. Nonlinear Anal. Theory Methods Appl. 75, 1385–1399 (2012)

    Article  MathSciNet  Google Scholar 

  11. Chen, Y.Y., Kan, C., Song, W.: The Moreau envelope function and proximal mapping with respect to the Bregman distances in Banach spaces. Vietnam J. Math. 40, 181–99 (2012)

    MathSciNet  MATH  Google Scholar 

  12. Bauschke, H.H., Dao, M.N., Lindstrom, S.B.: Regularizing with Bregman–Moreau envelopes. SIAM J. Optim. 28, 3208–3228 (2018)

    Article  MathSciNet  Google Scholar 

  13. Burachik, R.S., Iusem, A.N.: A generalized proximal point algorithm for the variational inequality problem in a Hilbert space. SIAM J. Optim. 8, 197–216 (1998)

    Article  MathSciNet  Google Scholar 

  14. Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)

    MATH  Google Scholar 

  15. Peypouquet, J.: Convex Optimization in Normed Spaces: Theory, Methods and Examples. Springer, Berlin (2015)

    Book  Google Scholar 

  16. Takahashi, W.: Nonlinear Functional Analysis. Fixed Point Theory and Its Applications. Yokohama Publishers, Yokohama (2000)

    MATH  Google Scholar 

  17. Zalinescu, C.: Convex Analysis in General Vector Spaces. World Scientific, River Edge (2002)

    Book  Google Scholar 

  18. Bauschke, H.H., Borwein, J.M., Combettes, P.L.: Bregman monotone optimization algorithms. SIAM J. Control Optim. 42, 596–636 (2003)

    Article  MathSciNet  Google Scholar 

  19. Butnariu, D., Iusem, A.N.: Totally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization, vol. 40. Springer, Berlin (2012)

    MATH  Google Scholar 

  20. Butnariu, D., Resmerita, E.: Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces. Abstr. Appl. Anal. 2006, 1–39 (2006)

    Article  MathSciNet  Google Scholar 

  21. Resmerita, E.: On total convexity, Bregman projections and stability in Banach spaces. J. Convex Anal. 11, 1–16 (2004)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

All the authors express their thanks to the referees for their helpful remarks and comments about this subject.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mohamed Soueycatt.

Additional information

Communicated by Nicolas Hadjisavvas.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Soueycatt, M., Mohammad, Y. & Hamwi, Y. Regularization in Banach Spaces with Respect to the Bregman Distance. J Optim Theory Appl 185, 327–342 (2020). https://doi.org/10.1007/s10957-020-01655-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-020-01655-4

Keywords

Mathematics Subject Classification

Navigation