IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v381y2020ics0096300320302174.html
   My bibliography  Save this article

Backward-Forward-Reflected-Backward Splitting for Three Operator Monotone Inclusions

Author

Listed:
  • Rieger, Janosch
  • Tam, Matthew K.

Abstract

In this work, we propose and analyse two splitting algorithms for finding a zero of the sum of three monotone operators, one of which is assumed to be Lipschitz continuous. Each iteration of these algorithms require one forward evaluation of the Lipschitz continuous operator and one resolvent evaluation of each of the other two operators. By specialising to two operator inclusions, we recover the forward-reflected-backward and the reflected-forward-backward splitting methods as particular cases. The inspiration for the proposed algorithms arises from interpretations of the aforementioned reflected splitting algorithms as discretisations of the continuous-time proximal point algorithm.

Suggested Citation

  • Rieger, Janosch & Tam, Matthew K., 2020. "Backward-Forward-Reflected-Backward Splitting for Three Operator Monotone Inclusions," Applied Mathematics and Computation, Elsevier, vol. 381(C).
  • Handle: RePEc:eee:apmaco:v:381:y:2020:i:c:s0096300320302174
    DOI: 10.1016/j.amc.2020.125248
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320302174
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2020.125248?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Taylor, A. & Hendrickx, J. & Glineur, F., 2015. "Smooth Strongly Convex Interpolation and Exact Worst-case Performance of First-order Methods," LIDAM Discussion Papers CORE 2015013, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Ernest K. Ryu & Bằng Công Vũ, 2020. "Finding the Forward-Douglas–Rachford-Forward Method," Journal of Optimization Theory and Applications, Springer, vol. 184(3), pages 858-876, March.
    3. B. Abbas & H. Attouch & Benar F. Svaiter, 2014. "Newton-Like Dynamics and Forward-Backward Methods for Structured Monotone Inclusions in Hilbert Spaces," Journal of Optimization Theory and Applications, Springer, vol. 161(2), pages 331-360, May.
    4. Francisco J. Aragón Artacho & Rubén Campoy, 2019. "Computing the Resolvent of the Sum of Maximally Monotone Operators with the Averaged Alternating Modified Reflections Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 181(3), pages 709-726, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yonghong Yao & Abubakar Adamu & Yekini Shehu, 2024. "Forward–Reflected–Backward Splitting Algorithms with Momentum: Weak, Linear and Strong Convergence Results," Journal of Optimization Theory and Applications, Springer, vol. 201(3), pages 1364-1397, June.
    2. Francisco J. Aragón Artacho & Rubén Campoy & Matthew K. Tam, 2021. "Strengthened splitting methods for computing resolvents," Computational Optimization and Applications, Springer, vol. 80(2), pages 549-585, November.
    3. Rubén Campoy, 2022. "A product space reformulation with reduced dimension for splitting algorithms," Computational Optimization and Applications, Springer, vol. 83(1), pages 319-348, September.
    4. Luis M. Briceño-Arias & Fernando Roldán, 2022. "Four-Operator Splitting via a Forward–Backward–Half-Forward Algorithm with Line Search," Journal of Optimization Theory and Applications, Springer, vol. 195(1), pages 205-225, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sandra S. Y. Tan & Antonios Varvitsiotis & Vincent Y. F. Tan, 2021. "Analysis of Optimization Algorithms via Sum-of-Squares," Journal of Optimization Theory and Applications, Springer, vol. 190(1), pages 56-81, July.
    2. TAYLOR, Adrien B. & HENDRICKX, Julien M. & François GLINEUR, 2016. "Exact worst-case performance of first-order methods for composite convex optimization," LIDAM Discussion Papers CORE 2016052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Donghwan Kim & Jeffrey A. Fessler, 2021. "Optimizing the Efficiency of First-Order Methods for Decreasing the Gradient of Smooth Convex Functions," Journal of Optimization Theory and Applications, Springer, vol. 188(1), pages 192-219, January.
    4. Boţ, R.I. & Csetnek, E.R. & Vuong, P.T., 2020. "The forward–backward–forward method from continuous and discrete perspective for pseudo-monotone variational inequalities in Hilbert spaces," European Journal of Operational Research, Elsevier, vol. 287(1), pages 49-60.
    5. Francisco J. Aragón Artacho & Rubén Campoy & Matthew K. Tam, 2021. "Strengthened splitting methods for computing resolvents," Computational Optimization and Applications, Springer, vol. 80(2), pages 549-585, November.
    6. Adrien B. Taylor & Julien M. Hendrickx & François Glineur, 2018. "Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization," Journal of Optimization Theory and Applications, Springer, vol. 178(2), pages 455-476, August.
    7. Ernest K. Ryu & Bằng Công Vũ, 2020. "Finding the Forward-Douglas–Rachford-Forward Method," Journal of Optimization Theory and Applications, Springer, vol. 184(3), pages 858-876, March.
    8. Samir Adly & Hedy Attouch & Van Nam Vo, 2023. "Convergence of Inertial Dynamics Driven by Sums of Potential and Nonpotential Operators with Implicit Newton-Like Damping," Journal of Optimization Theory and Applications, Springer, vol. 198(1), pages 290-331, July.
    9. Boţ, Radu Ioan & Kanzler, Laura, 2021. "A forward-backward dynamical approach for nonsmooth problems with block structure coupled by a smooth function," Applied Mathematics and Computation, Elsevier, vol. 394(C).
    10. Pankaj Gautam & Daya Ram Sahu & Avinash Dixit & Tanmoy Som, 2021. "Forward–Backward–Half Forward Dynamical Systems for Monotone Inclusion Problems with Application to v-GNE," Journal of Optimization Theory and Applications, Springer, vol. 190(2), pages 491-523, August.
    11. Abbaszadehpeivasti, Hadi & de Klerk, Etienne & Zamani, Moslem, 2022. "The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions," Other publications TiSEM 061688c6-f97c-4024-bb5b-1, Tilburg University, School of Economics and Management.
    12. Vrins, F. & Jeanblanc, M., 2015. "The [phi]-Martingale," LIDAM Discussion Papers CORE 2015022, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. Rubén Campoy, 2022. "A product space reformulation with reduced dimension for splitting algorithms," Computational Optimization and Applications, Springer, vol. 83(1), pages 319-348, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:381:y:2020:i:c:s0096300320302174. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.