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.

    References listed on IDEAS

    as
    1. Alfredo N. Iusem & Alejandro Jofré & Philip Thompson, 2019. "Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities," Mathematics of Operations Research, INFORMS, vol. 44(1), pages 236-263, February.
    2. Xingju Cai & Guoyong Gu & Bingsheng He, 2014. "On the O(1/t) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators," Computational Optimization and Applications, Springer, vol. 57(2), pages 339-363, March.
    3. Huifu Xu, 2010. "Sample Average Approximation Methods For A Class Of Stochastic Variational Inequality Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 27(01), pages 103-119.
    4. B. S. He & L. Z. Liao, 2002. "Improvements of Some Projection Methods for Monotone Nonlinear Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 112(1), pages 111-128, January.
    5. Xingju Cai & Deren Han & Lingling Xu, 2013. "An improved first-order primal-dual algorithm with a new correction step," Journal of Global Optimization, Springer, vol. 57(4), pages 1419-1428, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jun-zuo Li & Yi-bin Xiao, 2025. "A Modified Popov Algorithm for Non-Monotone and Non-Lipschitzian Stochastic Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 205(3), pages 1-26, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiao-Juan Zhang & Xue-Wu Du & Zhen-Ping Yang & Gui-Hua Lin, 2019. "An Infeasible Stochastic Approximation and Projection Algorithm for Stochastic Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 183(3), pages 1053-1076, December.
    2. Jun-zuo Li & Yi-bin Xiao, 2025. "A Modified Popov Algorithm for Non-Monotone and Non-Lipschitzian Stochastic Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 205(3), pages 1-26, June.
    3. Zhong-bao Wang & Xue Chen & Jiang Yi & Zhang-you Chen, 2022. "Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities," Journal of Global Optimization, Springer, vol. 82(3), pages 499-522, March.
    4. M.A. Noor, 2002. "Proximal Methods for Mixed Quasivariational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 115(2), pages 453-459, November.
    5. Bingsheng He & Li-Zhi Liao & Xiang Wang, 2012. "Proximal-like contraction methods for monotone variational inequalities in a unified framework I: Effective quadruplet and primary methods," Computational Optimization and Applications, Springer, vol. 51(2), pages 649-679, March.
    6. Annamaria Barbagallo & Serena Guarino Lo Bianco, 2023. "A random time-dependent noncooperative equilibrium problem," Computational Optimization and Applications, Springer, vol. 84(1), pages 27-52, January.
    7. Bingsheng He & Li-Zhi Liao & Xiang Wang, 2012. "Proximal-like contraction methods for monotone variational inequalities in a unified framework II: general methods and numerical experiments," Computational Optimization and Applications, Springer, vol. 51(2), pages 681-708, March.
    8. Xingju Cai & Guoyong Gu & Bingsheng He, 2014. "On the O(1/t) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators," Computational Optimization and Applications, Springer, vol. 57(2), pages 339-363, March.
    9. Jingjing Peng & Zhijie Wang & Siting Yu & Zengao Tang, 2025. "An Improvement of the Alternating Direction Method of Multipliers to Solve the Convex Optimization Problem," Mathematics, MDPI, vol. 13(5), pages 1-19, February.
    10. Huifu Xu & Dali Zhang, 2013. "Stochastic Nash equilibrium problems: sample average approximation and applications," Computational Optimization and Applications, Springer, vol. 55(3), pages 597-645, July.
    11. He, Bingsheng & He, Xiao-Zheng & Liu, Henry X. & Wu, Ting, 2009. "Self-adaptive projection method for co-coercive variational inequalities," European Journal of Operational Research, Elsevier, vol. 196(1), pages 43-48, July.
    12. Shu Lu & Amarjit Budhiraja, 2013. "Confidence Regions for Stochastic Variational Inequalities," Mathematics of Operations Research, INFORMS, vol. 38(3), pages 545-568, August.
    13. Hongjin He & Jitamitra Desai & Kai Wang, 2016. "A primal–dual prediction–correction algorithm for saddle point optimization," Journal of Global Optimization, Springer, vol. 66(3), pages 573-583, November.
    14. Fan Jiang & Zhiyuan Zhang & Hongjin He, 2023. "Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes," Journal of Global Optimization, Springer, vol. 85(4), pages 821-846, April.
    15. M.A. Noor, 2002. "Proximal Methods for Mixed Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 115(2), pages 447-452, November.
    16. Hu Shao & William Lam & Mei Tam, 2006. "A Reliability-Based Stochastic Traffic Assignment Model for Network with Multiple User Classes under Uncertainty in Demand," Networks and Spatial Economics, Springer, vol. 6(3), pages 173-204, September.
    17. Pham Ngoc Anh, 2023. "New Outer Proximal Methods for Solving Variational Inequality Problems," Journal of Optimization Theory and Applications, Springer, vol. 198(2), pages 479-501, August.
    18. Pang, Li-Ping & Chen, Shuang & Wang, Jin-He, 2015. "Risk management in portfolio applications of non-convex stochastic programming," Applied Mathematics and Computation, Elsevier, vol. 258(C), pages 565-575.
    19. R. Díaz Millán & O. P. Ferreira & L. F. Prudente, 2021. "Alternating conditional gradient method for convex feasibility problems," Computational Optimization and Applications, Springer, vol. 80(1), pages 245-269, September.
    20. Duong Viet Thong & Phan Tu Vuong & Pham Ky Anh & Le Dung Muu, 2022. "A New Projection-type Method with Nondecreasing Adaptive Step-sizes for Pseudo-monotone Variational Inequalities," Networks and Spatial Economics, Springer, vol. 22(4), pages 803-829, December.

    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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.