Skip to main content
SpringerLink
Log in

Algorithms for Linear Complementarity Problems

  • Chapter
Algorithms for Continuous Optimization

Part of the book series: NATO ASI Series ((ASIC,volume 434))

Abstract

This paper presents a survey of the Linear Complementarity Problem (LCP). The most important existence and complexity results of the LCP are first reviewed. Direct, iterative and enumerative algorithms are then discussed together with their benefits and drawbacks.

Some important global optimization problems can be solved by a sequential technique that is based on the solution of a Generalized Linear Complementarity Problem (GLCP). This problem is also discussed in this paper, namely its complexity and some procedures for its solution.

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. B. Ahn. Iterative methods for linear complementarity problems with upper bounds on primary variables. Mathematical Programming, 26:295–315, 1986.

    Google Scholar 

  2. B. Ahn. Solution of nonsymmetric linear complementarity problems by iterative methods. Journal of Optimization Theory and Applications, 33:175–185, 1981

    MathSciNet  MATH  Google Scholar 

  3. F. Al-Khayyal. An implicit enumeration procedure for the general linear complementarity problem. Mathematical Programming Study, 31:1–20, 1987

    MathSciNet  MATH  Google Scholar 

  4. F. Al-Khayyal. Linear, quadratic and bilinear programming approaches to the linear complementarity problem. European Journal of Operational Research, 24:216–227, 1986

    MathSciNet  MATH  Google Scholar 

  5. F. Al-Khayyal. On characterizing linear complementarity problems as linear programs. Optimization, 20:715–724, 1989

    MathSciNet  MATH  Google Scholar 

  6. J. Bard and J. Falk. A separable programming approach to the linear complementarity problem. Computers and Operations Research, 9:153–159, 1982

    MathSciNet  Google Scholar 

  7. A. Berman and R. Plemmons. Nonnegative Matrices in the Mathematical Sciences. Academic Press, New York, 1979

    MATH  Google Scholar 

  8. D. Bertsekas. Projected Newton methods for optimization problems with simple constraints. SIAM Journal on Control and Optimization, 20:222–246, 1982

    MathSciNet  Google Scholar 

  9. W. Bialas and M. Karwan. Two-level linear programming. Management Science, 30:1004–1020, 1984

    MathSciNet  MATH  Google Scholar 

  10. S. Billups and M. Ferris. Convergence of interior-point algorithms from arbitrary starting points. Working Paper, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, USA, 1993

    Google Scholar 

  11. A. Brandt and C. Cryer. Multigrid algorithms for the solution of linear complementarity problems arising from free boundary problems. SIAM Journal on Scientific and Statistical Computing, 4:655–684, 1983

    MathSciNet  MATH  Google Scholar 

  12. R. Chandrasekaran. A special case of the complementary pivot problem. Opsearch, 7:263–268, 1970

    MathSciNet  Google Scholar 

  13. Y. Cheng. On the gradient-projection method for solving the nonsymmetric linear complementarity problem. Journal of Optimization Theory and Applications, 43:527–541, 1984

    MathSciNet  MATH  Google Scholar 

  14. S. Chung. NP-completeness of the linear complementarity problem. Journal of Optimization Theory and Applications, 60:393–399, 1989

    MathSciNet  MATH  Google Scholar 

  15. T. Coleman and L. Hulbert. A direct active set algorithm for large sparse quadratic programs with bounds. Mathematical Programming, 45:373–406, 1989

    MathSciNet  MATH  Google Scholar 

  16. T. Coleman and L. Hulbert. A globally and superlinearly convergent algorithm for convex quadratic programs with bounds. SIAM Journal on Optimization, 3:298–321, 1993

    MathSciNet  MATH  Google Scholar 

  17. T. Coleman and Y. Li. A reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables. Technical Report TR 92–1315, Department of Computer Science, Cornell University, Ithaca, New York, USA, 1992

    Google Scholar 

  18. A. Conn, N. Gould, and Ph. Toint. Global convergence of a class of trust regions algorithm for optimization with simple bounds. SIAM Journal on Numerical Analysis, 25:433–460, 1988

    MathSciNet  MATH  Google Scholar 

  19. R. Cottle. The principal pivoting method of quadratic programming. In G. Dantzig and A. Veinott Jr., editors, Mathematics of Decision Sciences, pages 144–162, American Mathematical Society, Providence, 1968

    Google Scholar 

  20. R. Cottle, G. Golub, and R. Sacher. On the solution of large, structured linear complementarity problems: the block partitioned case. Applied Mathematics and Optimization, 4:347–363, 1978

    MathSciNet  MATH  Google Scholar 

  21. R. Cottle, J. Pang, and R. Stone. The Linear Complementarity Problem. Academic Press, New York, 1992

    MATH  Google Scholar 

  22. R. Cottle, J. Pang, and V. Venkateswaran. Sufficient matrices and the linear complementarity problem. Linear Algebra and its Applications, 114/115:231–249, 1989

    MathSciNet  Google Scholar 

  23. R. Dembo and U. Tulowitzski. On the minimization of quadratic functions subject to box constraints. Technical Report, Department of Computer Science, Yale University, New Haven, Connecticut, USA, 1983

    Google Scholar 

  24. D. Den Hertog, C. Roos, and T. Terlaky. The linear complementarity problem, sufficient matrices and the criss-cross method. Working Paper, Delft University of Technology, Delft, Netherlands, 1990

    Google Scholar 

  25. J. Dennis Jr. and R. Schnabel. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs, New York, 1983

    MATH  Google Scholar 

  26. I. Duff, A. Erisman, and J. Reid. Direct Methods for Sparse Matrices. Clarendon Press, Oxford, 1986

    MATH  Google Scholar 

  27. F. Facchinei and S. Lucidi. A class of penalty functions for optimization problems with bound constraints. Optimization, 26:239–259, 1992

    MathSciNet  MATH  Google Scholar 

  28. L. Fernandes, M. Coelho, J. Júdice, and J. Patricio. On the solution of a spatial equilibrium problem. To appear in Investigação Operacional, 1993

    Google Scholar 

  29. L. Fernandes, J. Júdice, and J. Patricio. An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems. Working Paper, Department of Mathematics, University of Coimbra, Coimbra, Portugal, 1993

    Google Scholar 

  30. R. Fletcher and M. Jackson. Minimization of a quadratic function subject only to upper and lower bounds. Journal Institute of Mathematics and Applications, 14:159–174, 1974

    MathSciNet  MATH  Google Scholar 

  31. A. Friedlander, J. Martinez, and M. Raydan. A new method for box constrained convex quadratic minimization problems. Working Paper, Department of Applied Mathematics, University of Campinas, Campinas, Brazil, 1993

    Google Scholar 

  32. A. Friedlander, J. Martinez, and S. Santos. A new trust-region algorithm for bound constrained minimization. To appear in Applied Mathematics and Optimization, 1993

    Google Scholar 

  33. A. Friedlander, J. Martinez, and S. Santos. Resolution of linear complementarity problems using minimization with simple bounds. Working Paper, Department of Applied Mathematics, University of Campinas, Campinas, Brazil, 1993

    Google Scholar 

  34. U. Garcia Palomares. Extension of SOR methods for solving symmetric linear complementarity and quadratic programming problems. Working Paper, Departamento de Processos y Sistemas, Universidad Simon Bolivar, Caracas, Venezuela, 1992

    Google Scholar 

  35. P. Gill, W. Murray, and M. Wright. Practical Optimization. Academic Press, New York, 1981

    MATH  Google Scholar 

  36. C. Glassey. A quadratic network optimization model for equilibrium single commodity trade flow. Mathematical Programming, 14:98–107, 1978

    MathSciNet  MATH  Google Scholar 

  37. R. Glowinski. Finite elements and variational inequalities. MRC Technical Report 1885, Mathematics Research Center, University of Wisconsin, Madison, Wisconsin, USA, 1978

    Google Scholar 

  38. R. Graves. A principal pivoting simplex algorithm for linear and quadratic programming. Operations Research, 15:482–494, 1967

    MathSciNet  MATH  Google Scholar 

  39. L. Grippo, L. Lampariello, and S. Lucidi. A class of nonmonotone stabilization methods in unconstrained optimization. Numerische Mathematik, 59:779–805, 1991

    MathSciNet  MATH  Google Scholar 

  40. F. Guder, J. Morris, and S. Yoon. Parallel and serial successive overrelaxation for multicommodity spatial price equilibrium problems. Transportation Science, 26:48–58, 1992

    Google Scholar 

  41. P. Harker and J. Pang. A damped Newton’s method for the linear complementarity problem. In E. Allgower and K. Georg, editors, Computational Solution of Nonlinear Equations, Lecture Notes in Applied Mathematics 26, pages 265–284, American Mathematical Society, Providence, 1990

    Google Scholar 

  42. P. Harker and J. Pang. Finite-dimensional variational inequalities and nonlinear complementarity problems: a survey of theory, algorithms and applications. Mathematical Programming, 48:161–220, 1990

    MathSciNet  MATH  Google Scholar 

  43. R. Horst and H. Tuy. Global Optimization. Springer-Verlag, Heildelberg, 1990

    MATH  Google Scholar 

  44. J Júdice and A. Faustino. A computational analysis of LCP methods for bilinear and concave quadratic programming. Computers and Operations Research, 18:645–654, 1991

    MathSciNet  MATH  Google Scholar 

  45. J. Júdice and A. Faustino. An experimental investigation of enumerative methods for the linear complementarity problem. Computers and Operations Research, 15:417–426, 1988

    MathSciNet  MATH  Google Scholar 

  46. J. Júdice and A. Faustino. The linear-quadratic bilevel programming problem. To appear in Canadian Journal of Operational Research and Information Processing, 1993

    Google Scholar 

  47. J. Júdice and A. Faustino. A sequential LCP algorithm for bilevel linear programming. Annals of Operations Research, 34:89–106, 1992

    MathSciNet  MATH  Google Scholar 

  48. J. Júdice and A. Faustino. Solution of large-scale convex quadratic programs by Lemke’s method. In M. Turkman and M. Carvalho, editors, Proceedings of First Conference on Statistics and Optimization, pages 681–695, University of Lisbon, Lisbon, 1991

    Google Scholar 

  49. J. Júdice and A. Faustino. Solution of the concave linear complementarity problem. In C. Floudas and P. Pardalos, editors, Recent Advances in Global Optimization, pages 76–101, Princeton University Press, Princeton, 1991

    Google Scholar 

  50. J. Júdice and A. Faustino. The solution of the linear bilevel programming problem by using the linear complementarity problem. Investigação Operational, 8:77–95, 1988

    Google Scholar 

  51. J. Júdice, J. Machado, and A. Faustino. An extension of Lemke’s method for the solution of a generalized linear complementarity problem. In P. Kail, editor, Lecture Notes in Control and Information Sciences 180, pages 221–230, Springer-Verlag, Berlin, 1992

    Google Scholar 

  52. J. Júdice and M. Pires. A basic set algorithm for a generalized linear complementarity problem. Journal of Optimization Theory and Applications, 74:391–412, 1992

    MathSciNet  MATH  Google Scholar 

  53. J. Júdice and M. Pires. A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems. To appear in Computers and Operations Research, 1993

    Google Scholar 

  54. J. Júdice and M. Pires. Direct methods for convex quadratic programs subject to box constraints. Investigação Operational, 9:23–56, 1989

    Google Scholar 

  55. J. Júdice and M. Pires. A polynomial method for a generalized linear complementarity problem with a nonsingular M matrix. IMA Journal of Mathematics Applied in Business and Industry, 4:211–224, 1992

    MathSciNet  MATH  Google Scholar 

  56. J. Júdice and L. Vicente. On the solution of a generalized linear complementarity problem. To appear in Journal of Global Optimization, 1993

    Google Scholar 

  57. B. Kalantari and J. Rosen. Penalty for zero-one equivalent problem. Mathematical Programming, 24:229–232, 1982

    MathSciNet  MATH  Google Scholar 

  58. E. Keller. The general quadratic optimization problem. Mathematical Programming, 5:311–337, 1973

    MathSciNet  MATH  Google Scholar 

  59. M. Kocvara and J. Zowe. An iterative two-step algorithm for linear complementarity problems. Working Paper, Mathematical Institute, University of Bayreuth, Bayreuth, Germany, 1993

    Google Scholar 

  60. M. Kojima, N. Megiddo, T. Noma, and A. Yoshise. A unified approach to interior-point algorithms for linear complementarity problems. Lecture Notes in Computer Science 538, Springer-Verlag, Berlin, 1991

    Google Scholar 

  61. M. Kojima, S. Mizuno, and A. Yoshise. A polynomial time algorithm for a class of linear complementarity problems. Mathematical Programming, 44:1—26, 1989

    MathSciNet  Google Scholar 

  62. M. Kostreva. Block pivoting methods for solving the complementarity problem. Linear Algebra and its Applications, 21:207–215, 1979

    MathSciNet  Google Scholar 

  63. M. Kostreva. Direct Algorithms for Complementarity Problems. PhD thesis, Rensselaer Polytechnique Institute, New York, USA, 1976

    Google Scholar 

  64. C. Lemke. On complementary pivot theory. In G. Dantzig and A. Veinott, editors, Mathematics of Decision Sciences, pages 95–114, American Mathematical Society, Providence, 1968

    Google Scholar 

  65. Y. Lin and C. Cryer. An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems. Applied Mathematics and Optimization, 13:1–17, 1985

    MathSciNet  MATH  Google Scholar 

  66. Y. Lin and J. Pang. Iterative methods for large convex quadratic programs: a survey. SIAM Journal on Control and Optimization, 25:383–411, 1987

    MathSciNet  MATH  Google Scholar 

  67. Z. Luo and P. Tseng. On the convergence of a splitting algorithm for the symmetric monotone linear complementarity problem. SIAM Journal on Control and Optimization, 29:1037–1060, 1991

    MathSciNet  MATH  Google Scholar 

  68. I. Lustig, R. Marsten, and D. Shanno. On implementing Mehrotra’s predictor-corrector interior-point method for linear programming. SIAM Journal on Optimization, 2:435–449, 1992

    MathSciNet  MATH  Google Scholar 

  69. O. Mangasarian. Equivalence of the complementarity problem to a system of nonlinear equations. SIAM Journal on Applied Mathematics, 31:89–92, 1976

    MathSciNet  MATH  Google Scholar 

  70. O. Mangasarian. Linear complementarity problems solvable by a single linear program. Mathematical Programming, 10:263–270, 1976

    MathSciNet  MATH  Google Scholar 

  71. O. Mangasarian. Simplified characterizations of linear complementarity problems solvable as linear programs. Mathematics of Operations Research, 4:268–273, 1979

    MathSciNet  MATH  Google Scholar 

  72. O. Mangasarian. Solution of symmetric linear complementarity problems by iterative methods. Journal of Optimization Theory and Applications, 22:465–485, 1977

    MathSciNet  MATH  Google Scholar 

  73. S. Mehrotra. On the implementation of a primal-dual interior-point method. SIAM Journal on Optimization, 2:575–601, 1992

    MathSciNet  MATH  Google Scholar 

  74. S. Mizuno, M. Kojima, and M. Todd. Infeasible interior-point primal-dual potential-reduction algorithms for linear programming. Working Paper, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York, 1993

    Google Scholar 

  75. S. Mohan. On the simplex method and a class of complementarity problems. Linear Algebra and its Applications, 14:1–9, 1976

    MathSciNet  MATH  Google Scholar 

  76. J. Moré and G. Toraldo. Algorithms for bound constrained quadratic programming problems. Numerische Mathematik, 55:377–400, 1989

    MathSciNet  MATH  Google Scholar 

  77. J. Moré and G. Toraldo. On the solution of large quadratic programming problems with bound constraints. SIAM Journal on Optimization, 1:93–113, 1991

    MathSciNet  MATH  Google Scholar 

  78. K. Murty. Linear Complementarity, Linear and Nonlinear Programming. Heldermann Verlag, Berlin, 1988

    MATH  Google Scholar 

  79. K. Murty. Linear Programming. John Wiley & Sons, New York, 1983

    MATH  Google Scholar 

  80. K. Murty. Note on a Bard-type scheme for solving the complementarity problem. Opsearch, 11:123–130, 1974

    MathSciNet  Google Scholar 

  81. A. Nagurney. Network Economics: a Variational Inequality Approach. Kluwer. London, 1993

    MATH  Google Scholar 

  82. D. O’Leary. A generalized conjugate-gradient algorithm for solving a class of quadratic programming problems. Linear Algebra and its Applications, 34:371–399, 1980

    MathSciNet  MATH  Google Scholar 

  83. J. Ortega. Introduction to Parallel and Vector Solution of Linear Systems. Plenum Press, New York, 1988

    MATH  Google Scholar 

  84. J. Pang. On a class of least-element complementarity problems. Mathematical Programming, 16:325–347, 1979

    MathSciNet  MATH  Google Scholar 

  85. J. Pang and L. Chandrasekaran. Linear complementarity problems solvable by a polynomial bounded pivoting algorithm. Mathematical Programming Study, 25:13–27, 1985

    MathSciNet  MATH  Google Scholar 

  86. J. Pang, I. Kaneko, and W. Hallman. On the solution of some (parametric) linear complementarity problems with application to portfolio analysis, structural engineering and graduation. Mathematical Programming, 16:325–347, 1979

    MathSciNet  MATH  Google Scholar 

  87. J. Pang and S. Lee. A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model. Mathematical Programming, 20:81–102, 1981

    MathSciNet  MATH  Google Scholar 

  88. P. Pardalos. Linear complementarity problems solvable by integer programming. Optimization, 19:467–476, 1988

    MathSciNet  MATH  Google Scholar 

  89. P. Pardalos and J. Rosen. Global Optimization: Algorithms and Applications. Lecture Notes in Computer Science 268, Springer-Verlag, Berlin, 1987

    Google Scholar 

  90. P. Pardalos and J. Rosen. Global optimization approach to the linear complementarity problem. SIAM Journal on Scientific and Statistical Computing, 9:341–353, 1988

    MathSciNet  Google Scholar 

  91. P. Pardalos and Y. Ye. The general linear complementarity problem. Working Paper, Department of Management Sciences, University of Iowa, Iowa, USA, 1991

    Google Scholar 

  92. P. Pardalos, Y. Ye, and C. Han. An interior-point algorithm for large-scale quadratic problems with box constraints. In Lecture Notes in Control and Information 144, pages 413–422, Springer-Verlag, Berlin, 1990

    Google Scholar 

  93. P. Pardalos, Y. Ye, C. Han, and J. Kaliski. Solution of Po-matrix linear complementarity problems using a potential reduction algorithm. To appear in SIAM Journal of Matrix Analysis and Applications, 1993

    Google Scholar 

  94. F. Pires. Monotone Linear Complementarity Problems. PhD thesis, University of Algarve, Portugal, 1993. (in Portuguese)

    Google Scholar 

  95. B. Ramarao and C. Shetty. Application of disjunctive programming to the linear complementarity problem. Naval Research Logistics Quaterly, 31:589–600, 1984

    MathSciNet  MATH  Google Scholar 

  96. R. Sargent. An efficient implementation of the Lemke’s algorithm and its extension to deal with upper and lower bounds. Mathematical Programming Study, 7:36–54, 1978

    MathSciNet  MATH  Google Scholar 

  97. D. Shanno. Computational experience with logarithmic barrier methods for linear and nonlinear complementarity problems. Rutcor Research Report RRR 18–93, Rutgers University, New Brunswick, USA, 1993

    Google Scholar 

  98. D. Talman and L. Van der Heyden. Algorithms for the linear complementarity problem which allow an arbitrary starting point. In B. Eaves, F. Gould, H. Peitgen, and M. Todd, editors, Homotopy Methods and Global Convergence, pages 267–286, Plenum Press, New York, 1981

    Google Scholar 

  99. J. Tomlin. Robust implementation of Lemke’s method for the the linear complementarity problem. Mathematical Programming Study, 7:55–60, 1978

    MathSciNet  MATH  Google Scholar 

  100. S. Wright. A path following infeasible interior-point algorithm for linear complementarity problems. Technecal Report MCS-P 334–1192, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Illinois, USA, 1992

    Google Scholar 

  101. E. Yang and J. Tolle. A class of methods for solving large convex quadratic programs subject to box constraints. Mathematical Programming, 51:223–228, 1991

    MathSciNet  MATH  Google Scholar 

  102. Y. Ye. A fully polynomial-time approximation algorithm for computing a stationary point of the general linear complementarity problem. Working Paper 90–10, College of Business Administration, University of Iowa, Iowa, USA, 1990

    Google Scholar 

  103. Y. Ye and P. Pardalos. A class of linear complementarity problems solvable in polynomial time. Linear Algebra and its Applications, 152:3–19, 1991

    MathSciNet  MATH  Google Scholar 

  104. Y. Zhang. On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem. To appear in SIAM Journal on Optimization, 1993

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemàtica, Universidade de Coimbra, 3000, Coimbra, Portugal

    Joaquim J. Júdice

Authors
  1. Joaquim J. Júdice
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of Bergamo, Bergamo, Italy

    Emilio Spedicato

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Kluwer Academic Publishers

About this chapter

Cite this chapter

Júdice, J.J. (1994). Algorithms for Linear Complementarity Problems. In: Spedicato, E. (eds) Algorithms for Continuous Optimization. NATO ASI Series, vol 434. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0369-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-0369-2_15

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6652-5

  • Online ISBN: 978-94-009-0369-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation