IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v89y2024i1d10.1007_s10898-023-01346-0.html
   My bibliography  Save this article

Variable sample-size optimistic mirror descent algorithm for stochastic mixed variational inequalities

Author

Listed:
  • Zhen-Ping Yang

    (Jiaying University)

  • Yong Zhao

    (Chongqing Jiaotong University)

  • Gui-Hua Lin

    (Shanghai University)

Abstract

In this paper, we propose a variable sample-size optimistic mirror descent algorithm under the Bregman distance for a class of stochastic mixed variational inequalities. Different from those conventional variable sample-size extragradient algorithms to evaluate the expected mapping twice at each iteration, our algorithm requires only one evaluation of the expected mapping and hence can significantly reduce the computation load. In the monotone case, the proposed algorithm can achieve $${\mathcal {O}}(1/t)$$ O ( 1 / t ) ergodic convergence rate in terms of the expected restricted gap function and, under the strongly generalized monotonicity condition, the proposed algorithm has a locally linear convergence rate of the Bregman distance between iterations and solutions when the sample size increases geometrically. Furthermore, we derive some results on stochastic local stability under the generalized monotonicity condition. Numerical experiments indicate that the proposed algorithm compares favorably with some existing methods.

Suggested Citation

  • Zhen-Ping Yang & Yong Zhao & Gui-Hua Lin, 2024. "Variable sample-size optimistic mirror descent algorithm for stochastic mixed variational inequalities," Journal of Global Optimization, Springer, vol. 89(1), pages 143-170, May.
  • Handle: RePEc:spr:jglopt:v:89:y:2024:i:1:d:10.1007_s10898-023-01346-0
    DOI: 10.1007/s10898-023-01346-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-023-01346-0
    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-023-01346-0?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. Aswin Kannan & Uday V. Shanbhag, 2019. "Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants," Computational Optimization and Applications, Springer, vol. 74(3), pages 779-820, December.
    2. Jinlong Lei & Uday V. Shanbhag & Jong-Shi Pang & Suvrajeet Sen, 2020. "On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 157-190, February.
    3. B. Jadamba & F. Raciti, 2015. "Variational Inequality Approach to Stochastic Nash Equilibrium Problems with an Application to Cournot Oligopoly," Journal of Optimization Theory and Applications, Springer, vol. 165(3), pages 1050-1070, June.
    4. Ahmet Alacaoglu & Yura Malitsky & Volkan Cevher, 2021. "Forward-reflected-backward method with variance reduction," Computational Optimization and Applications, Springer, vol. 80(2), pages 321-346, November.
    5. Xiantao Xiao, 2021. "A Unified Convergence Analysis of Stochastic Bregman Proximal Gradient and Extragradient Methods," Journal of Optimization Theory and Applications, Springer, vol. 188(3), pages 605-627, March.
    6. Jiří V. Outrata & Jan Valdman, 2020. "On computation of optimal strategies in oligopolistic markets respecting the cost of change," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(3), pages 489-509, December.
    7. repec:inm:orstsy:v:11:y:2021:i:2:p:112-139 is not listed on IDEAS
    Full references (including those not matched with items on IDEAS)

    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. Zhen-Ping Yang & Gui-Hua Lin, 2021. "Variance-Based Single-Call Proximal Extragradient Algorithms for Stochastic Mixed Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 190(2), pages 393-427, August.
    2. 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.
    3. 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.
    4. Simone Balmelli & Francesco Moresino, 2023. "Coordination of Plug-In Electric Vehicle Charging in a Stochastic Framework: A Decentralized Tax/Incentive-Based Mechanism to Reach Global Optimality," Mathematics, MDPI, vol. 11(4), pages 1-24, February.
    5. Jie Jiang & Xiaojun Chen & Zhiping Chen, 2020. "Quantitative analysis for a class of two-stage stochastic linear variational inequality problems," Computational Optimization and Applications, Springer, vol. 76(2), pages 431-460, June.
    6. Shisheng Cui & Uday Shanbhag & Mathias Staudigl & Phan Vuong, 2022. "Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces," Computational Optimization and Applications, Springer, vol. 83(2), pages 465-524, November.
    7. Jinlong Lei & Uday V. Shanbhag, 2020. "Asynchronous Schemes for Stochastic and Misspecified Potential Games and Nonconvex Optimization," Operations Research, INFORMS, vol. 68(6), pages 1742-1766, November.
    8. Francesca Faraci & Baasansuren Jadamba & Fabio Raciti, 2016. "On Stochastic Variational Inequalities with Mean Value Constraints," Journal of Optimization Theory and Applications, Springer, vol. 171(2), pages 675-693, November.
    9. Xiantao Xiao, 2021. "A Unified Convergence Analysis of Stochastic Bregman Proximal Gradient and Extragradient Methods," Journal of Optimization Theory and Applications, Springer, vol. 188(3), pages 605-627, March.
    10. Vikas Vikram Singh & Abdel Lisser, 2018. "A Characterization of Nash Equilibrium for the Games with Random Payoffs," Journal of Optimization Theory and Applications, Springer, vol. 178(3), pages 998-1013, September.
    11. Wang, Zheng & Li, Chaojie & Zhou, Xiaojun & Xie, Renyou & Li, Xiangyu & Dong, Zhaoyang, 2023. "Stochastic bidding for VPPs enabled ancillary services: A case study," Applied Energy, Elsevier, vol. 352(C).
    12. Gui-Hua Lin & Zhen-Ping Yang & Hai-An Yin & Jin Zhang, 2023. "A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems," Computational Optimization and Applications, Springer, vol. 86(2), pages 669-710, November.
    13. Georgia Fargetta & Antonino Maugeri & Laura Scrimali, 2022. "A Stochastic Nash Equilibrium Problem for Medical Supply Competition," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 354-380, June.
    14. Patrick R. Johnstone & Jonathan Eckstein & Thomas Flynn & Shinjae Yoo, 2024. "Stochastic projective splitting," Computational Optimization and Applications, Springer, vol. 87(2), pages 397-437, March.
    15. Pichugin, Alexander & Pechin, Maksim & Beznosikov, Aleksandr & Novitskii, Vasilii & Gasnikov, Alexander, 2024. "Method with batching for stochastic finite-sum variational inequalities in non-Euclidean setting," Chaos, Solitons & Fractals, Elsevier, vol. 187(C).
    16. Vikas Vikram Singh & Abdel Lisser, 2018. "Variational inequality formulation for the games with random payoffs," Journal of Global Optimization, Springer, vol. 72(4), pages 743-760, December.
    17. Xingbang Cui & Jie Sun & Liping Zhang, 2023. "On Multistage Pseudomonotone Stochastic Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 199(1), pages 363-391, October.
    18. Bin Zhou & Jie Jiang & Hailin Sun, 2024. "Dynamic stochastic projection method for multistage stochastic variational inequalities," Computational Optimization and Applications, Springer, vol. 89(2), pages 485-516, November.

    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:89:y:2024:i:1:d:10.1007_s10898-023-01346-0. 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.