Skip to main content
SpringerLink
Log in

Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

We present a shifted skew-symmetric iteration method for solving the nonsymmetric positive definite or positive semidefinite linear complementarity problems. This method is based on the symmetric and skew-symmetric splitting of the system matrix, which has been adopted to establish efficient splitting iteration methods for solving the nonsymmetric systems of linear equations. Global convergence of the method is proved, and the corresponding inexact splitting iteration scheme is established and analyzed in detail. Numerical results show that the new methods are feasible and effective for solving large sparse and nonsymmetric linear complementarity problems.

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. Ahn, B.H.: Solution of nonsymmetric linear complementarity problems by iterative methods. J. Optim. Theory Appl. 33, 175–185 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  2. Axelsson, O., Bai, Z.-Z., Qiu, S.-X.: A class of nested iteration schemes for linear systems with a coefficient matrix with a dominant positive definite symmetric part. Numer. Algorithms 35, 351–372 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bai, Z.-Z.: The convergence of parallel iteration algorithms for linear complementarity problems. Comput. Math. Appl. 32, 1–17 (1996)

    Article  MATH  Google Scholar 

  4. Bai, Z.-Z.: On the convergence of the multisplitting methods for the linear complementarity problem. SIAM J. Matrix Anal. Appl. 21, 67–78 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bai, Z.-Z.: Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem. J. Comput. Math. 19, 281–292 (2001)

    MATH  MathSciNet  Google Scholar 

  6. Bai, Z.-Z., Chi, X.-B.: Asymptotically optimal successive overrelaxation methods for systems of linear equations. J. Comput. Math. 21, 603–612 (2003)

    MATH  MathSciNet  Google Scholar 

  7. Bai, Z.-Z., Dong, J.-L.: A modified damped Newton method for linear complementarity problems. Numer. Algorithms 42, 207–228 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Bai, Z.-Z., Evans, D.J.: Matrix multisplitting relaxation methods for linear complementarity problems. Int. J. Comput. Math. 63, 309–326 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  9. Bai, Z.-Z., Evans, D.J.: Chaotic iterative methods for the linear complementarity problems. J. Comput. Appl. Math. 96, 127–138 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Bai, Z.-Z., Evans, D.J.: Matrix multisplitting methods with applications to linear complementarity problems: parallel synchronous and chaotic methods. Réseaux et systèmes répartis: Calculateurs Parallelès 13, 125–154 (2001)

    Google Scholar 

  11. Bai, Z.-Z., Evans, D.J.: Matrix multisplitting methods with applications to linear complementarity problems: parallel asynchronous methods. Int. J. Comput. Math. 79, 205–232 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Bai, Z.-Z., Golub, G.H., Ng, M.K.: Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems. SIAM J. Matrix Anal. Appl. 24, 603–626 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Bai, Z.-Z., Golub, G.H., Pan, J.-Y.: Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive semidefinite linear systems. Numer. Math. 98, 1–32 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  14. Bai, Z.-Z., Qiu, S.-X.: Splitting minimal residual methods for linear systems whose coefficient matrices have a dominant indefinite symmetric part. Math. Numer. Sinica 24, 113–128 (2002, in Chinese)

    MathSciNet  Google Scholar 

  15. Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences. Academic, New York (1979)

    MATH  Google Scholar 

  16. Concus, P., Golub, G.H.: A generalized conjugate gradient method for non-symmetric systems of linear equations. In: Glowinski, R., Lions, J.R. (eds.) Computing Methods in Applied Sciences and Engineering. Lecture Notes in Econom. and Math. Systems, vol. 134, pp. 56–65. Springer, Berlin (1976) (Also available online from http://www.sccm.stanford.edu/)

  17. Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. Academic, San Diego (1992)

    MATH  Google Scholar 

  18. Cryer, C.W.: The solution of a quadratic programming using systematic overrelaxation. SIAM J. Control 9, 385–392 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  19. Dirkse, S.P., Ferris, M.C.: The PATH solver: a non-monotone stabilization scheme for mixed complementarity problems. Optim. Methods Softw. 5, 123–156 (1995)

    Article  Google Scholar 

  20. Jiang, M.-Q., Dong, J.-L.: On convergence of two-stage splitting methods for linear complementarity problems. J. Comput. Appl. Math. 181, 58–69 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  21. Kinderlehrer, D., Stampacchia, G.: An Introduction to Variational Inequalities and Their Applications. Academic, New Nork (1980)

    MATH  Google Scholar 

  22. Mangasarian, O.L.: Solutions of symmetric linear complementarity problems by iterative methods. J. Optim. Theory Appl. 22, 465–485 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  23. Murty, K.G.: Linear Complementarity, Linear and Nonlinear Programming. Heldermann, Berlin (1988)

    MATH  Google Scholar 

  24. Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Academic, New York (1970)

    MATH  Google Scholar 

  25. Pang, J.-S.: On the convergence of a basic iterative method for the implicit complementarity problem. J. Optim. Theory Appl. 37, 149–162 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  26. Pang, J.-S.: Inexact Newton methods for the nonlinear complementarity problem. Math. Program. 36, 54–71 (1986)

    Article  MATH  Google Scholar 

  27. Pang, J.-S., Yang, J.-M.: Two-stage parallel iterative methods for the symmetric linear complementarity problem. Ann. Oper. Res. 14, 61–75 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  28. Tseng, P.: On linear convergence of iterative methods for the variational inequality problem. J. Comput. Appl. Math. 60, 237–252 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  29. Varga, R.S.: Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs (1962)

    Google Scholar 

Download references

Author information

Author notes

  1. Jun-Liang Dong

    Present address: College of Applied Sciences, Beijing University of Technology, Beijing, 100124, People’s Republic of China

Authors and Affiliations

  1. State Key Laboratory of Scientific/Engineering Computing, Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, P.O. Box 2719, Beijing, 100080, People’s Republic of China

    Jun-Liang Dong

Authors
  1. Jun-Liang Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jun-Liang Dong.

Additional information

The research of this author is supported by The Doctoral Starting-Up Research Foundation (No. X0006014200801) and The Basic Research Foundation of College of Applied Sciences (No. 97006014200702), Beijing University of Technology, P.R. China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dong, JL. Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems. Numer Algor 54, 343–357 (2010). https://doi.org/10.1007/s11075-009-9338-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-009-9338-4

Keywords

Mathematics Subject Classifications (2000)

Search

Navigation