IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v89y2024i4d10.1007_s10898-024-01377-1.html
   My bibliography  Save this article

Simple proximal-type algorithms for equilibrium problems

Author

Listed:
  • Yonghong Yao

    (Tiangong University
    Kyung Hee University)

  • Abubakar Adamu

    (Near East University
    African University of Science and Technology)

  • Yekini Shehu

    (Zhejiang Normal University)

  • Jen-Chih Yao

    (China Medical University
    Academy of Romanian Scientists)

Abstract

This paper proposes two simple and elegant proximal-type algorithms to solve equilibrium problems with pseudo-monotone bifunctions in the setting of Hilbert spaces. The proposed algorithms use one proximal point evaluation of the bifunction at each iteration. Consequently, prove that the sequences of iterates generated by the first algorithm converge weakly to a solution of the equilibrium problem (assuming existence) and obtain a linear convergence rate under standard assumptions. We also design a viscosity version of the first algorithm and obtain its corresponding strong convergence result. Some popular existing algorithms in the literature are recovered. We finally give some numerical tests and compare our algorithms with some related ones to show the performance and efficiency of our proposed algorithms.

Suggested Citation

  • Yonghong Yao & Abubakar Adamu & Yekini Shehu & Jen-Chih Yao, 2024. "Simple proximal-type algorithms for equilibrium problems," Journal of Global Optimization, Springer, vol. 89(4), pages 1069-1098, August.
    • Handle: RePEc:spr:jglopt:v:89:y:2024:i:4:d:10.1007_s10898-024-01377-1
    DOI: 10.1007/s10898-024-01377-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-024-01377-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/s10898-024-01377-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:jglopt:v:89:y:2024:i:4:d:10.1007_s10898-024-01377-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.