IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v232y2014icp888-897.html
   My bibliography  Save this article

A SAA nonlinear regularization method for a stochastic extended vertical linear complementarity problem

Author

Listed:
  • Zhang, Jie
  • He, Su-xiang
  • Wang, Quan

Abstract

In this paper we propose a new stochastic equilibrium model, a stochastic extended vertical linear complementarity problem, which arises in the stochastic generalized bimatrix games and includes stochastic linear complementarity problem as its special case. Based on the log-exponential function, a sample average approximation (SAA) regularization method is proposed for solving this problem. The analysis of this regularization method is carried out in two steps: first, under some mild conditions, the existence and convergence results to the proposed method are provided. Second, under conditions on row representative of matrices, the exponential convergence rate of this method is established. At last, the regularization method proposed is applied to finding a generalized Nash equilibrium pair for a stochastic generalized bimatrix game.

Suggested Citation

  • Zhang, Jie & He, Su-xiang & Wang, Quan, 2014. "A SAA nonlinear regularization method for a stochastic extended vertical linear complementarity problem," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 888-897.
    • Handle: RePEc:eee:apmaco:v:232:y:2014:i:c:p:888-897
    DOI: 10.1016/j.amc.2014.01.121
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300314001660
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2014.01.121?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. Alan J. King & R. Tyrrell Rockafellar, 1993. "Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming," Mathematics of Operations Research, INFORMS, vol. 18(1), pages 148-162, February.
    2. Xiaojun Chen & Masao Fukushima, 2005. "Expected Residual Minimization Method for Stochastic Linear Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 1022-1038, November.
    3. Gowda, M Seetharama & Sznajder, Roman, 1996. "A Generalization of the Nash Equilibrium Theorem on Bimatrix Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 25(1), pages 1-12.
    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. Shuang Lin & Jie Zhang & Chen Qiu, 2023. "Asymptotic Analysis for One-Stage Stochastic Linear Complementarity Problems and Applications," Mathematics, MDPI, vol. 11(2), pages 1-14, January.
    2. Ming-Zheng Wang & M. Ali, 2014. "On the ERM formulation and a stochastic approximation algorithm of the stochastic- $$R_0$$ R 0 EVLCP," Annals of Operations Research, Springer, vol. 217(1), pages 513-534, June.
    3. Baha Alzalg & Asma Gafour, 2023. "Convergence of a Weighted Barrier Algorithm for Stochastic Convex Quadratic Semidefinite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 196(2), pages 490-515, February.
    4. G. L. Zhou & L. Caccetta, 2008. "Feasible Semismooth Newton Method for a Class of Stochastic Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 379-392, November.
    5. L. Dai & C. H. Chen & J. R. Birge, 2000. "Convergence Properties of Two-Stage Stochastic Programming," Journal of Optimization Theory and Applications, Springer, vol. 106(3), pages 489-509, September.
    6. 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.
    7. Liyan Xu & Bo Yu, 2014. "CVaR-constrained stochastic programming reformulation for stochastic nonlinear complementarity problems," Computational Optimization and Applications, Springer, vol. 58(2), pages 483-501, June.
    8. Ankur Kulkarni & Uday Shanbhag, 2012. "Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms," Computational Optimization and Applications, Springer, vol. 51(1), pages 77-123, January.
    9. Sanjay Mehrotra & M. Gokhan Ozevin, 2009. "Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse," Operations Research, INFORMS, vol. 57(4), pages 964-974, August.
    10. Shu Lu & Amarjit Budhiraja, 2013. "Confidence Regions for Stochastic Variational Inequalities," Mathematics of Operations Research, INFORMS, vol. 38(3), pages 545-568, August.
    11. van den Elzen, A.H., 1996. "Constructive Application of the Linear Tracing Procedure to Polymatrix Games," Research Memorandum 738, Tilburg University, School of Economics and Management.
    12. Yakui Huang & Hongwei Liu, 2016. "Smoothing projected Barzilai–Borwein method for constrained non-Lipschitz optimization," Computational Optimization and Applications, Springer, vol. 65(3), pages 671-698, December.
    13. 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.
    14. Kramer, Anja & Krebs, Vanessa & Schmidt, Martin, 2021. "Strictly and Γ-robust counterparts of electricity market models: Perfect competition and Nash–Cournot equilibria," Operations Research Perspectives, Elsevier, vol. 8(C).
    15. Silvia Vogel, 2006. "Semiconvergence in distribution of random closed sets with application to random optimization problems," Annals of Operations Research, Springer, vol. 142(1), pages 269-282, February.
    16. 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.
    17. Yang, Xin & Chen, Anthony & Ning, Bin & Tang, Tao, 2016. "A stochastic model for the integrated optimization on metro timetable and speed profile with uncertain train mass," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 424-445.
    18. Sankaranarayanan, Sriram & Feijoo, Felipe & Siddiqui, Sauleh, 2018. "Sensitivity and covariance in stochastic complementarity problems with an application to North American natural gas markets," European Journal of Operational Research, Elsevier, vol. 268(1), pages 25-36.
    19. Ying Cui & Ziyu He & Jong-Shi Pang, 2021. "Nonconvex robust programming via value-function optimization," Computational Optimization and Applications, Springer, vol. 78(2), pages 411-450, March.
    20. Andreas Eichhorn & Werner Römisch, 2007. "Stochastic Integer Programming: Limit Theorems and Confidence Intervals," Mathematics of Operations Research, INFORMS, vol. 32(1), pages 118-135, February.

    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:apmaco:v:232:y:2014:i:c:p:888-897. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.