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

A Proximal-Type Algorithm with Bregman Distance for Solving Equilibrium Problems

Author

Listed:
  • Grace Nnennaya Ogwo

    (Zhejiang Normal University)

  • Olawale Kazeem Oyewole

    (Tshwane University of Technology)

  • Liya Liu

    (Fuzhou University)

Abstract

In this paper, using the Bregman distance technique, we introduce a proximal-type algorithm for solving equilibrium problems when the bifunction is pseudomonotone in real Hilbert spaces. The proposed algorithm involves only one strongly convex minimization subproblem, which makes our algorithm more effective than some existing algorithms in the literature. Under certain standard assumptions, we obtain a weak convergence result using the proposed algorithm. Finally, we present numerical experiments to illustrate the performance and applicability of our proposed algorithm.

Suggested Citation

  • Grace Nnennaya Ogwo & Olawale Kazeem Oyewole & Liya Liu, 2025. "A Proximal-Type Algorithm with Bregman Distance for Solving Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 207(1), pages 1-24, October.
    • Handle: RePEc:spr:joptap:v:207:y:2025:i:1:d:10.1007_s10957-025-02764-8
    DOI: 10.1007/s10957-025-02764-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-025-02764-8
    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-02764-8?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:207:y:2025:i:1:d:10.1007_s10957-025-02764-8. 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.