Abstract
In this paper, we propose a new splitting algorithm to find the zero of a monotone inclusion problem that features the sum of three maximal monotone operators and a Lipschitz continuous monotone operator in Hilbert spaces. We prove that the sequence of iterates generated by our proposed splitting algorithm converges weakly to the zero of the considered inclusion problem under mild conditions on the iterative parameters. Several splitting algorithms in the literature are recovered as special cases of our proposed algorithm. Another interesting feature of our algorithm is that one forward evaluation of the Lipschitz continuous monotone operator is utilized at each iteration. Numerical results are given to support the theoretical analysis.













Similar content being viewed by others
Data Availability
Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.
Code Availability
The Matlab codes employed to run the numerical experiments are available on request.
References
Aragón Artacho, F.J., Campoy, R., Tam, M.K.: Strengthened splitting methods for computing resolvents. Comput. Optim. Appl. 80, 549–585 (2021)
Aragón Artacho, F.J., Campoy, R., Tam, M.K., Torregroa-Belén, D.: Distributed forward-backward methods for ring networks. Comput. Optim. Appl. 86, 845–870 (2023)
Aragón Artacho, F.J., Censor, Y., Gibali, A.: The cyclic Douglas–Rachford algorithm with \(r\)-sets-Douglas–Rachford operators. Optim. Methods Softw. 34, 875–889 (2019)
Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, New York (2017)
Borwein, J.M., Tam, M.K.: A cyclic Douglas–Rachford iteration scheme. J. Optim. Theory Appl. 160, 1–29 (2014)
Briceño-Arias, L.M.: Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions. Optimization 64, 1239–1261 (2015)
Cai, J.F., Candes, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956–1982 (2010)
Combettes, P.L., Pesquet, J.C.: A Douglas–Rachford splitting approach to nonsmooth convex variational signal recovery. IEEE J. Sel. Top. Signal Process. 1, 564–574 (2007)
Davis, D., Yin, W.T.: A three-operator splitting scheme and its optimization applications. Set-Valued Var. Anal. 25, 829–858 (2019)
Goldstein, A.A.: Convex programming in Hilbert space. Bull. Am. Math. Soc. 70, 709–710 (1964)
Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16, 964–979 (1979)
Malitsky, Y., Tam, M.K.: A forward-backward splitting method for monotone inclusions without cocoercivity. SIAM J. Optim. 30, 1451–1472 (2020)
Opial, Z.: Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc. 73, 591–597 (1967)
Raguet, H., Fadili, J., Peyré, G.: A generalized forward-backward splitting. SIAM J. Imag. Sci. 6, 1199–1226 (2013)
Rieger, J., Tam, M.K.: Backward-forward-reflected-backward splitting for three operator monotone inclusion. Appl. Math. Comput. 381, 125248 (2020)
Ryu, E.K.: Uniqueness of DRS as the 2 oprator resolvent-splitting and impossibility of 3 operator resolvent-splitting. Math. Program. 182, 233–273 (2020)
Tseng, P.: A modified forward-backward splitting method for maximal monotone mapping. SIAM J. Control. Optim. 38, 431–446 (2000)
Zong, C.X., Tang, Y.C., Zhang, G.F.: Solving monotone inclusions involving the sum of three maximally monotone operators and cocoercive operator with applications. Set-Val. Var. Anal. (2023). https://doi.org/10.1007/s11228-023-00677-0
Author information
Authors and Affiliations
Contributions
YW and J-CY conceived and designed the analysis; YC and YS wrote the manuscript, HR prepared all the figures and tables.
Corresponding author
Ethics declarations
Conflict of interest
The authors declare no Conflict of interest.
Consent for publication
All the authors gave consent for the publication of identifiable details to be published in the journal and article.
Ethical Approval and Consent to participate
All the authors gave the ethical approval and consent to participate in this article.
Additional information
Communicated by Aviv Gibali.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Cao, Y., Wang, Y., ur Rehman, H. et al. Convergence Analysis of a New Forward-Reflected-Backward Algorithm for Four Operators Without Cocoercivity. J Optim Theory Appl 203, 256–284 (2024). https://doi.org/10.1007/s10957-024-02501-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-024-02501-7