IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v206y2025i3d10.1007_s10957-025-02741-1.html
   My bibliography  Save this article

New Splitting Algorithm with Three Inertial Steps for Three-Operator Monotone Inclusion Problems

Author

Listed:
  • Yonghong Yao

    (Tiangong University
    China Medical University Hospital, China Medical University
    Kyung Hee University)

  • Sani Salisu

    (Sule Lamido University Kafin Hausa)

  • Zai-Yun Peng

    (Yunnan Normal University
    Yunnan Key Laboratory of Modern Analytical Mathematics and Applications)

  • Yekini Shehu

    (Zhejiang Normal University)

Abstract

This paper introduces a new splitting algorithm to solve a three-operator monotone inclusion problem that comprises of the sum of a maximal monotone operator, Lipschitz continuous monotone operator, and a cocoercive operator in real Hilbert spaces. The new splitting algorithm features the following (i) three different inertial extrapolation steps; (ii) one forward evaluation of the Lipschitz continuous monotone operator, one forward evaluation of the cocoercive operator and one backward evaluation of the maximal monotone operator at each iteration. The more interesting feature of the proposed algorithm is that each of the involved operators is evaluated at different inertial step. We establish weak, strong and linear convergence of the sequence of iterates under standard assumptions, respectively. Several known splitting algorithms for the monotone inclusion problems of three-operator sum that have appeared in the literature are considered as special cases of our algorithm. Numerical tests confirm the superiority of our algorithm over related ones in the literature.

Suggested Citation

  • Yonghong Yao & Sani Salisu & Zai-Yun Peng & Yekini Shehu, 2025. "New Splitting Algorithm with Three Inertial Steps for Three-Operator Monotone Inclusion Problems," Journal of Optimization Theory and Applications, Springer, vol. 206(3), pages 1-28, September.
    • Handle: RePEc:spr:joptap:v:206:y:2025:i:3:d:10.1007_s10957-025-02741-1
    DOI: 10.1007/s10957-025-02741-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-025-02741-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-025-02741-1?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.

    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:spr:joptap:v:206:y:2025:i:3:d:10.1007_s10957-025-02741-1. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.