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

Strongly Convergent Inertial Proximal Point Algorithm Without On-line Rule

Author

Listed:
  • Lateef O. Jolaoso

    (Sefako Makgatho Health Sciences University
    University of Southampton)

  • Yekini Shehu

    (Zhejiang Normal University)

  • Jen-Chih Yao

    (China Medical University Hospital, China Medical University
    Academy of Romanian Scientists
    National Sun Yat-sen University)

Abstract

We present a strongly convergent Halpern-type proximal point algorithm with double inertial effects to find a zero of a maximal monotone operator in Hilbert spaces. The strong convergence results are obtained without on-line rule of the inertial parameters and the iterates. This makes our proof arguments different from what is obtainable in the literature where on-line rule is imposed on a strongly convergent proximal point algorithm with inertial extrapolation. Numerical examples with applications to image restoration and compressed sensing show that our proposed algorithm is useful and has practical advantages over existing ones.

Suggested Citation

  • Lateef O. Jolaoso & Yekini Shehu & Jen-Chih Yao, 2024. "Strongly Convergent Inertial Proximal Point Algorithm Without On-line Rule," Journal of Optimization Theory and Applications, Springer, vol. 200(2), pages 555-584, February.
    • Handle: RePEc:spr:joptap:v:200:y:2024:i:2:d:10.1007_s10957-023-02355-5
    DOI: 10.1007/s10957-023-02355-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-023-02355-5
    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-02355-5?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:2:d:10.1007_s10957-023-02355-5. 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.