IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v201y2022icp616-639.html
   My bibliography  Save this article

Two generalized non-monotone explicit strongly convergent extragradient methods for solving pseudomonotone equilibrium problems and applications

Author

Listed:
  • Rehman, Habib ur
  • Kumam, Poom
  • Özdemir, Murat
  • Karahan, Ibrahim

Abstract

The main objective of this paper is to introduce two new proximal-like methods to solve the equilibrium problem in a real Hilbert space. The equilibrium problem is a general mathematical problem that unites several useful mathematical problems, including optimization problems, variational inequalities, fixed-point problems, saddle point problems, complementary problems, and Nash equilibrium problems. Both new methods are analogous to the well-known extragradient method, which has been used in the literature to solve variational inequality problems. The proposed methods make use of a non-monotone variable step size rule that is revised for each iteration and is determined mainly by previous iterations. The advantage of these methods is that they can be used without prior knowledge of Lipschitz-type constants or any line-search method. By allowing for some mild condition, the strong convergence of both methods is established. Numerical studies are presented to demonstrate the computational behavior of new methods and to compare them to other existing methods.

Suggested Citation

  • Rehman, Habib ur & Kumam, Poom & Özdemir, Murat & Karahan, Ibrahim, 2022. "Two generalized non-monotone explicit strongly convergent extragradient methods for solving pseudomonotone equilibrium problems and applications," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 201(C), pages 616-639.
  • Handle: RePEc:eee:matcom:v:201:y:2022:i:c:p:616-639
    DOI: 10.1016/j.matcom.2021.05.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475421001725
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2021.05.001?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:eee:matcom:v:201:y:2022:i:c:p:616-639. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.