IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i12p1962-d1679033.html
   My bibliography  Save this article

A Double-Inertial Two-Subgradient Extragradient Algorithm for Solving Variational Inequalities with Minimum-Norm Solutions

Author

Listed:
  • Ioannis K. Argyros

    (Department of Computing and Mathematical Sciences, Cameron University, Lawton, OK 73505, USA)

  • Fouzia Amir

    (Center for Research and Innovation, Asia International University, Bukhara 200100, Uzbekistan)

  • Habib ur Rehman

    (School of Mathematics, Zhejiang Normal University, Jinhua 321004, China)

  • Christopher Argyros

    (School of Computational Science and Engineering, Georgia Institute of Technology, 225 North Avenue NW, Atlanta, GA 30313, USA)

Abstract

Variational inequality problems (VIPs) provide a versatile framework for modeling a wide range of real-world applications, including those in economics, engineering, transportation, and image processing. In this paper, we propose a novel iterative algorithm for solving VIPs in real Hilbert spaces. The method integrates a double-inertial mechanism with the two-subgradient extragradient scheme, leading to improved convergence speed and computational efficiency. A distinguishing feature of the algorithm is its self-adaptive step size strategy, which generates a non-monotonic sequence of step sizes without requiring prior knowledge of the Lipschitz constant. Under the assumption of monotonicity for the underlying operator, we establish strong convergence results. Numerical experiments under various initial conditions demonstrate the method’s effectiveness and robustness, confirming its practical advantages and its natural extension of existing techniques for solving VIPs.

Suggested Citation

  • Ioannis K. Argyros & Fouzia Amir & Habib ur Rehman & Christopher Argyros, 2025. "A Double-Inertial Two-Subgradient Extragradient Algorithm for Solving Variational Inequalities with Minimum-Norm Solutions," Mathematics, MDPI, vol. 13(12), pages 1-26, June.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:12:p:1962-:d:1679033
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/12/1962/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/12/1962/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:12:p:1962-:d:1679033. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.