Skip to main content
SpringerLink
Log in

Iterative Method for a Class of Linear Complementarity Problems

  • Conference paper
Information Computing and Applications (ICICA 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 105))

Included in the following conference series:

Abstract

An iterative method for solving a class of linear complementarity problems with positive definite symmetric matrices is presented. Firstly, linear complementarity problem is transformed into absolute value equation, which is also a fixed-point problem. Then we present an iterative method for the linear complementarity problem based on fixed-point principle. The method begins with an initial point chosen arbitrarily and converges to optimal solution of original problem after finite iterations. The effectiveness of the method is demonstrated by its ability to solve some standard test problems found in the literature.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Billups, S.C., Murty, K.G.: Complementarity Problems. Journal of Computational and Applied Mathematics 124, 303–318 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problems. Academic Press, London (1992)

    MATH  Google Scholar 

  3. Karmarkar, N.: A new polynomial-time Algorithm for linear programming. Combinatorica 4, 373–395 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A Primal-dual Interior Point Algorithm for Linear Programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming; Interior Point Related Methods, pp. 29–47. Springer, New York (1989)

    Google Scholar 

  5. Megiddo, N.: Pathways to the optimal set in linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming; Interior Point and Related Methods, pp. 158–313. Springer, New York (1989)

    Google Scholar 

  6. 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 

  7. Kojima, M., Megiddo, N., Mizuno, S.: A Primal-dual Infeasible Interior Point Algorithm for Linear Programming. Math. Prog. 61, 261–280 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  8. 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 

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

    Article  MATH  Google Scholar 

  10. Van Bokhoven, W.M.G.: A Class of Linear Complementarity Problems is Solvable in Polynomial Time. Department of Electrical Engineering, University of Technology, P.O.Box 513,560 MB Eindhoven, Netherlands (1980)

    Google Scholar 

  11. Granas, A., Dugundji, J.: Fixed Point Theory. Springer, New York (2003)

    Book  MATH  Google Scholar 

  12. Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, New York (1990)

    MATH  Google Scholar 

  13. Yong, L.: An Interior Point Method for Solving Monotone Linear Complementarity Problem. Journal of Mathematics 29, 681–686 (2009)

    MathSciNet  MATH  Google Scholar 

  14. Yong, L.: Potential-reduction Interior Point Method for Monotone Linear Complementarity Problem. Journal of Shaaxi University of Technology Nature Science Edition 25, 52–57 (2009)

    Google Scholar 

  15. Sun, Z., Zeng, J.: Semismooth Newton Schwarz iterative methods for the linear complementarity problem. BIT Numerical Mathematics 50, 425–429 (2010)

    Article  MathSciNet  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. College of Computer Science, South-Central University for Nationalities, 708 Minyuan Road, 430074, Wuhan, China

    Rongbo Zhu

  2. Victoria University, 8001, Melbourne, VIC, Australia

    Yanchun Zhang

  3. College of sciences, He’Bei polytechnic University, 063000, Tangshan, Hebei, China

    Baoxiang Liu  & Chunfeng Liu  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yong, L. (2010). Iterative Method for a Class of Linear Complementarity Problems. In: Zhu, R., Zhang, Y., Liu, B., Liu, C. (eds) Information Computing and Applications. ICICA 2010. Communications in Computer and Information Science, vol 105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16336-4_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16336-4_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16335-7

  • Online ISBN: 978-3-642-16336-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation