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

Improved variance reduction extragradient method with line search for stochastic variational inequalities

Author

Listed:
  • Ting Li

    (Nanjing Normal University)

  • Xingju Cai

    (Nanjing Normal University)

  • Yongzhong Song

    (Nanjing Normal University)

  • Yumin Ma

    (Nanjing Normal University)

Abstract

In this paper, we investigate the numerical methods for solving stochastic variational inequalities. Using line search scheme, we propose an improved variance based stochastic extragradient method with different step sizes in the prediction and correction steps. The range of correction step size which can guarantee the convergence is also given. For the initial line search step size of each iteration, an adaptive method is adopted. Rather than the same scale for each reduction, a proportional reduction related to the problem is used to meet the line search criteria. Under the assumptions of Lipschitz continuous, pseudo-monotone operator and independent identically distributed sampling, the iterative complexity and the oracle complexity are obtained. When estimating the upper bound of the second order moment of the martingale difference sequence, we give a more convenient and comprehensible proof instead of using the Burkholder-Davis-Gundy inequality. The proposed algorithm is applied to fractional programming problems and the $$l_2$$ l 2 regularized logistic regression problem. The numerical results demonstrate its superiority.

Suggested Citation

  • Ting Li & Xingju Cai & Yongzhong Song & Yumin Ma, 2023. "Improved variance reduction extragradient method with line search for stochastic variational inequalities," Journal of Global Optimization, Springer, vol. 87(2), pages 423-446, November.
  • Handle: RePEc:spr:jglopt:v:87:y:2023:i:2:d:10.1007_s10898-022-01135-1
    DOI: 10.1007/s10898-022-01135-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-022-01135-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-022-01135-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:87:y:2023:i:2:d:10.1007_s10898-022-01135-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.