On the Bregman-proximal iterative algorithm for the monotone inclusion problem in Banach spaces

References

• Martinet, B. (1970). Regularisation d’inequations variationnelles par approximations successives. Rev. Fr. Inform. Rech. Oper. 4:154–158.
   Google Scholar
• Bruck, R. E., Jr. (1974). A strongly convergent iterative method for the solution of 0∈Ux for a maximal monotone operator U in Hilbert spaces. J. Math. Anal. Appl. 48:114–126. DOI: 10.1016/0022-247X(74)90219-4.
   Web of Science ®Google Scholar
• Bruck, R. E., Reich, S. (1977). Nonexpansive projections and resolvents of accretive operators in Banach spaces. Houston J. Math. 3:459–470.
   Google Scholar
• Berinde, V. (2007). Iterative Approximation of Fixed Points. Lecture Notes in Mathematics. London: Springer.
   Google Scholar
• Kačurovskii, R. I. (1960). On monotone operators and convex functionals. Usp. Mat, Nauk. 15:213–215.
   Google Scholar
• Minty, G. J. (1962). Monotone (nonlinear) operators in Hilbert spaces. Duke Math. J. 29:341–346. DOI: 10.1215/S0012-7094-62-02933-2.
   Web of Science ®Google Scholar
• Rockafellar, R. T. (1976). Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14:877–898. DOI: 10.1137/0314056.
   Web of Science ®Google Scholar
• Xu, H. K. (2006). A regularization method for the proximal point algorithm. J. Glob. Optim. 36:115–125. DOI: 10.1007/s10898-006-9002-7.
   Web of Science ®Google Scholar
• Zarantonello, E. H. (1960). Solving functional equations by contractive averaging. Technical Report 160. USA Army Math., Madison, Wisconsin.
   Google Scholar
• Zhao, X., Yao, J. C., Yao, Y. (2020). A proximal algorithm for solving split monotone variational inclusions. U.P.B. Sci. Bull., Series A 82(3):43–52.
   Google Scholar
• Yao, Y., Shehu, Y., Li, X., Dong, Q. L. (2021). A method with inertial extrapolation step for split monotone inclusion problems. Optimization 70:741–761. DOI: 10.1080/02331934.2020.1857754.
   Web of Science ®Google Scholar
• Kohsaka, F., Takahashi, W. (2004). Strong convergence of an iterative sequence for maximal monotone operators in a Banach space. Abstr. Appl. Anal. 3:239–249.
   Google Scholar
• Kamimura, S., Takahashi, W. (2000). Approximating solutions of maximal monotone operators in Hilbert spaces. J. Approx. Theory 106:226–240. DOI: 10.1006/jath.2000.3493.
   Web of Science ®Google Scholar
• Xu, H. K. (2002). Iterative algorithms for nonlinear operators. J. London Math. Soc. 66:240–256. DOI: 10.1112/S0024610702003332.
   Web of Science ®Google Scholar
• Zegeye, H. (2008). Strong convergence theorems for maximal monotone mappings in Banach spaces. J. Math. Anal. Appl. 343:663–671. DOI: 10.1016/j.jmaa.2008.01.076.
   Web of Science ®Google Scholar
• Verma, R. U. (2009). General proximal point algorithm involving η-maximal accretiveness framework in Banach spaces. Positivity 13:771–782. DOI: 10.1007/s11117-008-2268-x.
   Web of Science ®Google Scholar
• Rouhani, B. D., Mohebbi, V. (2020). Strong convergence of an inexact proximal point algorithm in a Banach space. J. Optim. Theory Appl. 186:134–147. DOI: 10.1007/s10957-020-01695-w.
   Web of Science ®Google Scholar
• Bregman, L. M. (1967). 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. Phys. 7:200–217. DOI: 10.1016/0041-5553(67)90040-7.
   Google Scholar
• Censor, Y., Lent, A. (1981). An iterative row-action method for interval convex programming. J. Optim. Theory Appl. 34:321–353. DOI: 10.1007/BF00934676.
   Web of Science ®Google Scholar
• Burachik, R. S., Iusem, A. (1998). A generalized proximal point algorithm for the variational inequality problem in Hilbert space. SIAM J. Optim. 8:197–216. DOI: 10.1137/S1052623495286302.
   Web of Science ®Google Scholar
• Dragomir, R. A., Taylor, A. B., dÁspremont, A., Bolte, J. (2022). Optimal complexity and certification of Bregman first-order methods. Math. Program. 194:41–83. DOI: 10.1007/s10107-021-01618-1.
   Web of Science ®Google Scholar
• Teboulle, M. (2018). A simplified view of first order methods for optimization. Math. Program., Ser. B 170:67–96. DOI: 10.1007/s10107-018-1284-2.
   Web of Science ®Google Scholar
• Bertsekas, D. P. (2015). Convex Optimization Algorithms. Belmont: Athena Scientific.
   Google Scholar
• Beck, A. (2017). First Order Methods in Optimization. Philadelphia: SIAM.
   Google Scholar
• Rockafellar, R. T. (1970). Convex Analysis. Princeton: Princeton University Press.
   Google Scholar
• Reem, D., Reich, S. (2018). Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization. Rend. Circ. Mat. Palermo 67:337–371. DOI: 10.1007/s12215-017-0318-6.
   Web of Science ®Google Scholar
• Chen, G., Teboulle, M. (1993). Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3:538–543. DOI: 10.1137/0803026.
   Web of Science ®Google Scholar
• Reem, D., Reich, S., De Pierro, A. (2019). Re-examination of Bregman functions and new properties of their divergences. Optimization 68:279–348. DOI: 10.1080/02331934.2018.1543295.
   Web of Science ®Google Scholar
• Butnariu, D., Iusem, A. N. (2000). Totally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization. Dordrecht: Kluwer Academic Publishers.
   Google Scholar
• Butnariu, D., Reich, S., Zaslavski, A. J. (2006). There are many totally convex functions. J. Convex Anal. 13:623–632.
   Web of Science ®Google Scholar
• Martín-Márquez, V., Reich, S., Sabach, S. (2013). Iterative methods for approximating fixed points of Bregman nonexpansive operators. Discrete Contin. Dyn. Syst. 6:1043–1063.
   Web of Science ®Google Scholar
• Reich, S., Sabach, S. (2010). Two strong convergence theorems for a proximal method in reflexive Banach spaces. Numer. Funct. Anal. Optim. 31:22–44. DOI: 10.1080/01630560903499852.
   Web of Science ®Google Scholar
• Browder, F. E. (1968). Nonlinear maximal monotone operators in Banach spaces. Math. Annal. 175:89–113. DOI: 10.1007/BF01418765.
   Web of Science ®Google Scholar
• Rockafellar, R. T. (1970). On the maximality of sums of nonlinear operators. Trans. Amer. Math. Soc. 149:75–88. DOI: 10.1090/S0002-9947-1970-0282272-5.
   Web of Science ®Google Scholar
• Rockafellar, R. T. (1970). On the maximal monotonity of subdifferential mappings. Pac. J. Math. 33:209–216. DOI: 10.2140/pjm.1970.33.209.
   Web of Science ®Google Scholar
• Maingé, P. E. (2007). Approximation methods for common fixed points of nonexpansive mappingn Hilbert spaces. J. Math. Anal. Appl. 325:469–479. DOI: 10.1016/j.jmaa.2005.12.066.
   Web of Science ®Google Scholar
• Cionarescu, I. (1990). Geometry of Banach Spaces, Duality Mappings and Nonlinear Problems. Dordrecht: Kluwer.
   Google Scholar
• Reich, S. (1992). Bull. Amer. Math. Soc. 26:367–370. DOI: 10.1090/S0273-0979-1992-00287-2.
   Google Scholar
• Bauschke, H. H., Borwein, J. M., Combettes, P. L. (2001). Essential smoothness, essential strict convexity, and legendre functions in Banach spaces. Commun. Contemp. Math. 3:615–647. DOI: 10.1142/S0219199701000524.
   Web of Science ®Google Scholar
• Eckstein, J. (1993). Nonlinear proximal point algorithms using Bregman functions, with applicationsto convex programming. Math. Oper. Res. 18:202–226. DOI: 10.1287/moor.18.1.202.
   Web of Science ®Google Scholar
• Motreanu, D., Panagiotopoulos, P. D. (1999). Minimax Theorems and Qualitative Properties of the Solutions of Hemivariational Inequalities. Nonconvex Optimization and Its Applications. New York: Kluwer Academic.
   Google Scholar
• Moameni, A. (2020). Critical point theory on convex subsets with applications in differential equations and analysis. J. Math. Pures Appl. 141:266–315. DOI: 10.1016/j.matpur.2020.05.005.
   Web of Science ®Google Scholar
• Clarke, F. (2013). Functional Analysis Calculus of Variations and Optimal Control. London: Springer-Verlag, pp. 193–209.
   Google Scholar