Skip to main content
SpringerLink
Log in

Nonlinear Complementarity Problem and Solution Methods

  • Conference paper
Artificial Intelligence and Computational Intelligence (AICI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6319))

Abstract

This paper provides a survey to some of recent developments in the field of nonlinear complementarity problems (NCP). Some existence conditions of solution to the NCP are given according to the monotonicity of the functions, and corresponding NCP examples are demonstrated respectively. Meanwhile, a couple of different solution methods for NCP are described. Finally, we provide a brief summary of current research trends.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lemke, C.E., Howson, J.T.: Equilibrium points of bimatrix games. SIAM J. Appl. Math. 12, 413–423 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  2. Billups, S.C., Murty, K.G.: Complementarity Problems. Journal of Computational and Applied Mathematics 124, 303–318 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ferris, M.C., Pang, J.S. (eds.): Complementarity and Variational Problems: State of the Art. SIAM Publications, Philadelphia (1997)

    Google Scholar 

  4. Ferris, M.C., Pang, J.S.: Engineering and economic applications of complementarity problems. SIAM Review 39, 669–713 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ferris, M.C., Pang, J.S., Ferris, M.C., Pang, J.S. (eds.): Complementarity and Variational Problems: State of the Art. SIAM Publications, Philadelphia (1997)

    Google Scholar 

  6. Harker, P.T., Pang, J.S., Harker, P.T., Pang, J.S.: Finite-dimensional variational inequality and nonlinear complementarity problems, a survey review of theory, algorithms and applications. Math. Prog. 48, 161–220 (1990)

    Article  MATH  Google Scholar 

  7. Ferris, M.C., Kanzow, C.: Complementarity and related problems: A survey. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization, pp. 514–530. Oxford University Press, New York (2002)

    Google Scholar 

  8. Xia, Y., Leung, H., Wang, J.: A projection neural network and its application to constrained optimization problems. IEEE Transactions on Circuits and Systems–I 49, 447–458 (2002)

    Article  MathSciNet  Google Scholar 

  9. Kojima, M., Shindo, S.: Extensions of Newton and quasi-Newton methods to systems of PC equations. Journal of Operations Research Society of Japan 29, 352–374 (1986)

    MathSciNet  MATH  Google Scholar 

  10. Jiang, H., Qi, L.: A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems. SIAM J. Control Optim. 35, 178–193 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kanzowa, C.: Some equation-based methods for the nonlinear complementarity problem. Optimization Methods and Software 3, 327–340 (1994)

    Article  Google Scholar 

  12. Xiu, N.H., Zhang, J.: Some recent advances in projection-type methods for variational inequalities. J. Comput. Appl. Math. 152, 559–571 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. Du, S., Gao, Y.: Merit functions for nonsmooth complementarity problems and related descent algorithm. Applied Mathematics - A Journal of Chinese Universities 25, 78–84 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Sun, D., Qi, L.: On NCP-Functions. Computational Optimization and Applications 13, 201–220 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Chen, J.-S., Pan, S.: A family of NCP-functions and a descent method for the nonlinear complementarity problem. Computational Optimization and Applications 40, 389–404 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Li, D., Fukushima, M.: Smoothing Newton and Quasi-Newton Methods for Mixed Complementarity Problems. Comput. Optim. Appl. 17, 203–230 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  17. Lopes, V.L.R., Martínez, J.M., Pérez, R., Lopes, R.: On the Local Convergence of Quasi-Newton Methods for Nonlinear Complementarity Problems. Appl. Numer Math. 30, 3–7 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  18. Qi, L., Sun, D.: A survey of some nonsmooth equations and smoothing Newton methods. In: Eberhard, A., Glover, B., Hill, R., Ralph, D. (eds.) Progress in optimization, pp. 121–146 (1999)

    Google Scholar 

  19. Qi, L., Sun, D., Zhou, G.: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities. Mathematical Programming 87, 1–35 (2000)

    MathSciNet  MATH  Google Scholar 

  20. Kojima, M., Mizuno, S., Yoshise, A.: A Polynomial-time Algorithm for a Class of Linear Complementarity Problems. Math. Prog. 44, 1–26 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  21. Zhang, Y.: On the Convergence of a Class of Infeasible-Interior-Point Methods for the Horizontal Linear Complementarity Problem. SIMA J. Optim. 4, 208–227 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  22. Wright, S.J.: An Infeasible-Interior-Point Algorithm for Linear Complementarily Problems. Math. Prog. 67, 29–52 (1994)

    Article  MATH  Google Scholar 

  23. Potra, F.A., Wright, S.J.: Interior-point methods. J. Comput. Appl. Math. 124, 255–281 (2000)

    Article  MATH  Google Scholar 

  24. Isac, G., Kostreva, M.M., Wiecek, M.M.: Multiple objective approximation of feasible but unsolvable linear complementarity problems. Journal of Optimization Theory and Applications 86, 389–405 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  25. Kostreva, M.M., Wiecek, M.M.: Linear complementarity problems and multiple objective programming. Mathematical Programming 60, 349–359 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  26. Kostreva, M.M., Yang, X.Q.: Unified Approaches for Solvable and Unsolvable. Linear Complementarity Problems, European Journal of Operational Research 158, 409–417 (2004)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Shaanxi University of Technology, Hanzhong, 723001, Shaanxi, P.R. China

    Longquan Yong

Authors
  1. Longquan Yong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Business Administration, Caritas Francis Hsu College, 18 Chui Ling Road, Tseung Kwan O, Hong Kong, China

    Fu Lee Wang

  2. School of Business Information Technology, RMIT University, City Campus, 124 La Trobe Street, 3000, Melbourne, Victoria, Australia

    Hepu Deng

  3. Department of Computer Science, Nanjing University, 210093, Nanjing, China

    Yang Gao

  4. School of Computer, Nanjing University of Posts and Telecommunications, 210003, Nanjing, China

    Jingsheng Lei

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yong, L. (2010). Nonlinear Complementarity Problem and Solution Methods. In: Wang, F.L., Deng, H., Gao, Y., Lei, J. (eds) Artificial Intelligence and Computational Intelligence. AICI 2010. Lecture Notes in Computer Science(), vol 6319. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16530-6_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16530-6_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16529-0

  • Online ISBN: 978-3-642-16530-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation