Skip to main content
SpringerLink
Log in

Robust solution of monotone stochastic linear complementarity problems

  • FULL LENGTH PAPER
  • Published:
Mathematical Programming Submit manuscript

Abstract

We consider the stochastic linear complementarity problem (SLCP) involving a random matrix whose expectation matrix is positive semi-definite. We show that the expected residual minimization (ERM) formulation of this problem has a nonempty and bounded solution set if the expected value (EV) formulation, which reduces to the LCP with the positive semi-definite expectation matrix, has a nonempty and bounded solution set. We give a new error bound for the monotone LCP and use it to show that solutions of the ERM formulation are robust in the sense that they may have a minimum sensitivity with respect to random parameter variations in SLCP. Numerical examples including a stochastic traffic equilibrium problem are given to illustrate the characteristics of the solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Birge J.R. and Louveaux F. (1997). Introduction to Stochastic Programming. Springer, New York

    MATH  Google Scholar 

  2. Chen B., Chen X. and Kanzow C. (2000). A penalized Fischer–Burmeister NCP-function. Math. Program. 88: 211–216

    Article  MathSciNet  MATH  Google Scholar 

  3. Chen X. and Fukushima M. (2005). Expected residual minimization method for stochastic linear complementarity problems. Math. Oper. Res. 30: 1022–1038

    Article  MathSciNet  MATH  Google Scholar 

  4. Cottle R.W., Pang J.-S. and Stone R.E. (1992). The Linear Complementarity Problem. Academic, New York

    MATH  Google Scholar 

  5. Daffermos S. (1980). Traffic equilibrium and variational inequalities. Transportation Sci. 14: 42–54

    Article  MathSciNet  Google Scholar 

  6. Facchinei F. and Pang J.-S. (2003). Finite-Dimensional Variational Inequalities and Complementarity Problems, I and II. Springer, New York

    Google Scholar 

  7. Fang, H., Chen, X., Fukushima, M.: Stochastic R 0 matrix linear complementarity problems. SIAM J. Optim. 18, 482–506 (2007)

  8. Ferris, M.C.: ftp://ftp.cs.wisc.edu/math-prog/matlab/lemke.m, Department of Computer Science, University of Wisconsin (1998)

  9. Ferris M.C. and Pang J.-S. (1997). Engineering and economic applications of complementarity problems. SIAM Rev. 39: 669–713

    Article  MathSciNet  MATH  Google Scholar 

  10. Frank M. and Wolfe P. (1956). An algorithm for quadratic programming. Nav. Res. Logist. 3: 95–110

    Article  MathSciNet  Google Scholar 

  11. Gürkan G., Özge A.Y. and Robinson S.M. (1999). Sample-path solution of stochastic variational inequalities. Math. Program. 84: 313–333

    Article  MathSciNet  MATH  Google Scholar 

  12. Kall P. and Wallace S.W. (1994). Stochastic Programming. Wiley, Chichester

    MATH  Google Scholar 

  13. Kanzow C., Yamashita N. and Fukushima M. (1997). New NCP-functions and their properties. J. Optim. Theory Appl. 94: 115–135

    Article  MathSciNet  MATH  Google Scholar 

  14. Kleywegt A.J., Shapiro A. and Homen-De-Mello T. (2001). The sample average approximation method for stochastic disete optimization. SIAM J. Optim. 12: 479–502

    Article  MathSciNet  MATH  Google Scholar 

  15. Lin G.H. and Fukushima M. (2006). New reformulations for stochastic nonlinear complementarity problems. Optim. Methods Softw. 21: 551–564

    Article  MathSciNet  MATH  Google Scholar 

  16. Luo Z.-Q. and Tseng P. (1997). A new class of merit functions for the nonlinear complementarity problem. In: Ferris, M.C. and Pang, J.-S. (eds) Complementarity and Variational Problems: State of the Art., pp 204–225. SIAM, Philadelphia

    Google Scholar 

  17. Mangasarian O.L. and Ren J. (1994). New improved error bounds for the linear complementarity problem. Math. Program. 66: 241–255

    Article  MathSciNet  Google Scholar 

  18. Marti K. (2005). Stochastic Optimization Methods. Springer, Berlin

    MATH  Google Scholar 

  19. Tseng P. (1996). Growth behavior of a class of merit functions for the nonlinear complementarity problem. J. Optim. Theory Appl. 89: 17–37

    Article  MathSciNet  MATH  Google Scholar 

  20. Sun D. and Qi L. (1999). On NCP-functions. Comp. Optim. Appl. 13: 201–220

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Faculty of Science and Technology, Hirosaki University, Hirosaki, 036-8561, Japan

    Xiaojun Chen & Chao Zhang

  2. Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, 606-8501, Japan

    Masao Fukushima

Authors
  1. Xiaojun Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Masao Fukushima
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Masao Fukushima.

Additional information

It is our great pleasure and honor to dedicate this paper to Professor Steve Robinson on the occasion of his 65th birthday. His original ideas and deep insight have always been so inspiring and beneficial to our work. This paper is just one of such instances.

This work was supported in part by a Grant-in-Aid for Scientific Research from Japan Society for the Promotion of Science.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, X., Zhang, C. & Fukushima, M. Robust solution of monotone stochastic linear complementarity problems. Math. Program. 117, 51–80 (2009). https://doi.org/10.1007/s10107-007-0163-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-007-0163-z

Keywords

Mathematics Subject Classification (2000)

Search

Navigation