IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v200y2024i3d10.1007_s10957-023-02343-9.html
   My bibliography  Save this article

Inertial Proximal Point Algorithms for Solving a Class of Split Feasibility Problems

Author

Listed:
  • Simeon Reich

    (The Technion – Israel Institute of Technology)

  • Truong Minh Tuyen

    (Thai Nguyen University of Sciences)

  • Phan Thi Huyen

    (Thai Nguyen University of Technology)

Abstract

We study the split common solution problem with multiple output sets for monotone operator equations in Hilbert spaces. In order to solve this problem, we introduce two new algorithms which are based on the inertial proximal point algorithm. We first establish a weak convergence theorem and a convergence rate for the first algorithm. Next, we also establish the strong convergence of sequences generated by the second algorithm. An application of our main theorems to solving the split minimum point problem with multiple output sets and a pertinent numerical example are also presented in Sects. 6 and 7, respectively.

Suggested Citation

  • Simeon Reich & Truong Minh Tuyen & Phan Thi Huyen, 2024. "Inertial Proximal Point Algorithms for Solving a Class of Split Feasibility Problems," Journal of Optimization Theory and Applications, Springer, vol. 200(3), pages 951-977, March.
    • Handle: RePEc:spr:joptap:v:200:y:2024:i:3:d:10.1007_s10957-023-02343-9
    DOI: 10.1007/s10957-023-02343-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-023-02343-9
    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-023-02343-9?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:200:y:2024:i:3:d:10.1007_s10957-023-02343-9. 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.