Advertisement

Linear Complementarity Since 1978

  • Richard W. Cottle
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 79)

Abstract

We survey developments on the Linear Complementarity Problem (LCP) since 1978, the year in which the International School of Mathematics on Variational Inequalities and Complementarity Problems took place at the ‘Ettore Majorana’ Centre of Scientific Culture in Erice, Sicily. This report will touch on matrix classes and the existence of solutions, complexity, degeneracy resolution, algorithms, software products, applications and generalizations of the LCP.

Keywords

Variational Inequality Mathematical Programming Complementarity Problem Linear Complementarity Problem Nonlinear Complementarity Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Aganagic and R.W. Cottle. A constructive characterization of Q 0 with nonnegative principal minors. Mathematical Programming 37 (1987) 223–252.zbMATHMathSciNetGoogle Scholar
  2. [2]
    D. Baraff. Issues in Computing Contact Forces for Non-penetrating rigid bodies. Algorithmica 10 (1993) 292–352.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    A. Berman and R.J. Plemmons. Nonnegative Matrices in the Mathematical Sciences. New York: Academic Press, 1979.zbMATHGoogle Scholar
  4. [4]
    J.R. Birge and A. Gana. Computational complexity of Van der Heyden’s variable dimension algorithm and Dantzig-Cottle’s principal pivoting method for solving LCPs. Mathematical Programming 26 (1983) 205–214.MathSciNetGoogle Scholar
  5. [5]
    K.C. Border. Fixed Point Theorems with Applications to Economics and Game Theory. Cambridge: Cambridge University Press, 1985.zbMATHGoogle Scholar
  6. [6]
    Brennan and Schwartz. Valuation of American put options. Journal of Finance. 32 (1977) 449–462.CrossRefGoogle Scholar
  7. [7]
    Y-Y. Chang. Least-index resolution of degeneracy in linear complementarity problems. Technical Report 79-14, Department of Operations Research, Stanford University, 1979.Google Scholar
  8. [8]
    S.J. Chung. NP-completeness of the linear complementarity problem. Journal of Optimization Theory and Applications 60 (1989) 393–399.zbMATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    R.W. Cottle. Some recent developments in linear complementarity theory. In [16, pp. 97–104]Google Scholar
  10. [10]
    R.W. Cottle. Completely-Q matrices. Mathematical Programming 19 (1980) 347–351.zbMATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    R.W. Cottle. Observations on a class of nasty linear complementarity problems. Discrete Applied Mathematics 2 (1980) 89–111.zbMATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    R.W. Cottle. The principal pivoting method revisited. Mathematical Programming 48 (1990)369–385.zbMATHCrossRefMathSciNetGoogle Scholar
  13. [13]
    R.W. COTTLE. Are P *-matrices just sufficient? Talk at 36th Joint National ORSA/TIMS Meeting, Phoenix, Arizona, November 1, 1993.Google Scholar
  14. [14]
    R.W. Cottle and Y-Y. Chang. Least-index resolution of degeneracy in linear complemen-tarity problems with sufficient matrices. SIAM Journal on Matrix Analysis and Applications. 13 (1992) 1131–1141.zbMATHCrossRefMathSciNetGoogle Scholar
  15. [15]
    R.W. Cottle and G.B. Dantzig. A generalization of the linear complementarity problem. Journal of Combinatorial Theory 8 (1970) 79–90.zbMATHMathSciNetGoogle Scholar
  16. [16]
    R.W. Cottle, F. Giannessi and, J.-L. Lions. Variational Inequalities and Complementarity Problems. Chichester: John Wiley & Sons, 1980.zbMATHGoogle Scholar
  17. [17]
    R.W. Cottle and S-M. Guu. Two characterizations of sufficient matrices. Linear Algebra and its Applications 17 (1992) 65–74.CrossRefMathSciNetGoogle Scholar
  18. [18]
    R.W. Cottle J-S. Pang, and R.E. Stone. The Linear Complementarity Problem. Boston: Academic Press, 1992.zbMATHGoogle Scholar
  19. [19]
    R.W. Cottle, J-S. Pang, and V. Venkateswaran. Sufficient matrices and the linear complementarity problem. Linear Algebra and its Applications 114/115, (1989) 231–249.CrossRefMathSciNetGoogle Scholar
  20. [20]
    M. C. Coutinho. Dynamic Simulations of Multi-Body Systems. New York: Springer, 1991.Google Scholar
  21. [21]
    G.E. Coxson. The P matrix problem is co-NP complete. Mathematical Programming 64 (1994) 173–178.CrossRefMathSciNetGoogle Scholar
  22. [22]
    J. Crank. Free and Moving Boundary Problems. Oxford: Oxford University Press, 1984.zbMATHGoogle Scholar
  23. [23]
    G.B. Dantzig and R.W. Cottle. Positive (semi-)definite programming, in (J. Abadie, ed.) Nonlinear Programming. Amsterdam: North-Holland, 1967, pp. 55–73.Google Scholar
  24. [24]
    B. De Moor, L. Vandenberghe, and J. Vandewalle. The generalized linear complementarity problem and an algorithm to find all its solutions. Mathematical Programming 57 (1992) 415–426.zbMATHCrossRefMathSciNetGoogle Scholar
  25. [25]
    B. De Schutter and B. De Moor. The extended linear complementarity problem. Mathematical Programming 71 (1995) 289–325.MathSciNetGoogle Scholar
  26. [26]
    S.P. Dirkse and M.C. Ferris. The PATH solver: A non-monotone stabilization scheme for mixed complementarity problems. Optimization Methods and Software 5 (1995) 123–156.Google Scholar
  27. [27]
    B.C. Eaves. The linear complementarity problem, Management Science 17 (1971) 612–634.MathSciNetzbMATHGoogle Scholar
  28. [28]
    A.A. Ebiefung. The Generalized Linear Complementarity Problem and its Applications. Ph.D. thesis. Clemson University, Clemson, S.C., 1991.Google Scholar
  29. [29]
    A.A. Ebiefung. Existence theory and Q-matrix characterization for the generalized linear complementarity problem. Linear Algebra and its Applications 223/224 (1995) 155–169.CrossRefMathSciNetGoogle Scholar
  30. [30]
    A.A. Ebiefung and M.M. Kostreva. Global solvability of generalized linear complementarity problems and a related class of polynomial complementarity problems, in (C. Floudas P. Pardalos, eds.) Recent Advances in Global Optimization. Princeton, N.J.: Princeton University Press, 1992, pp. 102–124.Google Scholar
  31. [31]
    A.A. Ebiefung and M.M. Kostreva. Generalized P 0-and Z-matrices, Linear Algebra and its Applications 195 (1993) 165–179.zbMATHCrossRefMathSciNetGoogle Scholar
  32. [32]
    A. A. Ebiefung and M. M. Kostreva. The generalized Leontief input-output model and its application to the choice of new technology, Annals of Operations Research 44 (1993) 161–172.zbMATHCrossRefMathSciNetGoogle Scholar
  33. [33]
    F. Facchinei and J-S. Pang. Finite-Dimensional Variational Inequalities and Complementarity Problems (Volumes I and II. New York: Springer-Verlag, 2003.Google Scholar
  34. [34]
    Y. Fathi. Computational complexity of LCPs associated with positive definite matrices. Mathematical Programming 17 (1979) 335–344.zbMATHCrossRefMathSciNetGoogle Scholar
  35. [35]
    M.C. Ferris and C. Kanzow. Complementarity and related problems, in (P. Pardalos and M. Resende, eds.) Handbook of Applied Optimization. Oxford: Oxford University Press, 2002.Google Scholar
  36. [36]
    M.C. Ferris and J-S. Pang. Engineering and economic applications of complementarity problems. SIAM Review 39 (1997) 669–713.zbMATHCrossRefMathSciNetGoogle Scholar
  37. [37]
    M.C. Ferris, O.L. Mangasarian, and J-S. Pang, eds. Complementarity: Applications, Algorithms and Extensions. Dordrecht: Kluwer Academic Publishers, 2001.zbMATHGoogle Scholar
  38. [38]
    M.C. Ferris and J-S. Pang, eds. Complementarity and Variational Inequalities. Philadelphia: Society for Industrial and Applied Mathematics, 1997.Google Scholar
  39. [39]
    www.gams/com/solvers/mpsge/syntax.htm.Google Scholar
  40. [40]
    A. Gana Studies in the Complementarity Problem. Ph.D. thesis. University of Michigan, Ann Arbor, 1982.Google Scholar
  41. [41]
    F. Giannessi and A. Maugeri. Variational Inequalities and Network Equilibrium Problems. New York: Plenum Press, 1995.zbMATHGoogle Scholar
  42. [42]
    M.S. Gowda. On reducing a monotone horizontal LCP to an LCP. Applied Mathematics Letters. 8 (1995) 97–100.zbMATHCrossRefMathSciNetGoogle Scholar
  43. [43]
    M.S. Gowda. On the extended linear complementarity problem. Mathematical Programming 72 (1995) 33–50.CrossRefMathSciNetGoogle Scholar
  44. [44]
    O. Güler. Generalized linear complementarity problems. Mathematics of Operations Research 20 (1955) 441–448.Google Scholar
  45. [45]
    S-M. Guu and R.W. Cottle. On a subclass of P0. Linear Algebra and its Applications 223/224 (1995) 325–335.CrossRefMathSciNetGoogle Scholar
  46. [46]
    G.J. Habetler and A.J. Price. Existence theory for generalized nonlinear complementarity problems. Journal of Optimization Theory and Applicatins 7 (1971) 223–239.zbMATHCrossRefMathSciNetGoogle Scholar
  47. [47]
    G.J. Habetler and B.P. Szanc. Existence and uniqueness of solutions for the generalized linear complementarity problem. Journal of Optimization Theory and Applications 84 (1995) 103–116.zbMATHCrossRefMathSciNetGoogle Scholar
  48. [48]
    P.T. Harker and J-S. Pang. Finite-dimensional variational inequalities and nonlinear complementarity problems. Mathematical Programming, Series B 48 (1990) 161–220.zbMATHCrossRefMathSciNetGoogle Scholar
  49. [49]
    P. Hartman and G. Stampacchia. On some nonlinear elliptic differential functional equations. Acta Mathematica 115 (1966) 153–188.CrossRefMathSciNetGoogle Scholar
  50. [50]
    D. Den Hertog, C. Roos, and T. Terlaky. The linear complementarity problem, sufficient matrices, and the criss-cross method. Linear Algebra and its Applications 187 (1993) 1–14.zbMATHCrossRefMathSciNetGoogle Scholar
  51. [51]
    B.F Hobbs Linear complementarity models of Nash-Cournot competition in bilateral and POOLCO power markets. IEEE Transactions on Power Systems 16 (2001) 194–202.CrossRefGoogle Scholar
  52. 52]
    B.F. Hobbs, C.B. Metzler, and J-S. Pang. Strategie gaming analysis for electric power networks: An MPEC approach. IEEE Transactions on Power Systems 15 (2000) 638–645.CrossRefGoogle Scholar
  53. [53]
    J. Huang and J-S. Pang. Option pricing and linear complementarity. The Journal of Computational Finance. 2 (1998) 31–60.Google Scholar
  54. [54]
    A. Ingleton. A problem in linear inequalities. Proceedings of the London Mathematical Society 16 (1966) 519–536.zbMATHCrossRefMathSciNetGoogle Scholar
  55. [55]
    G. Isac. Complementarity Problems [Lecture Notes in Mathematics 1528]. Berlin: Springer Verlag, 1992.zbMATHCrossRefGoogle Scholar
  56. [56]
    G. Isac. Topological Methods in Complementarity Theory. Dordrecht: Kluwer Academic Publishers, 2000.zbMATHGoogle Scholar
  57. [57]
    G. Isac, V.A. Bulavsky, and V.V. Kalashnikov. Complementarity, Equilibrium, Efficiency, and Economics. Dordrecht: Kluwer Academic Publishers, 2002.zbMATHGoogle Scholar
  58. [58]
    P. Jaillet, D. Lamberton, and B. Lapeyre. Acta Applicandae Mathematicae 21 (1990) 263–289.zbMATHCrossRefMathSciNetGoogle Scholar
  59. [59]
    B. Jansen, C. Roos, and T. Terlaky. A family of polynomial affine scaling algorithms for positive semidefinite linear complementarity problems. SIAM Journal on Optimization 7 (1997) 126–140.zbMATHCrossRefMathSciNetGoogle Scholar
  60. [60]
    S. Karamardian. The nonlinear complementarity problem with applications, part 1. Journal of Optimization Theory and Applications 4 (1969) 87–98.zbMATHCrossRefMathSciNetGoogle Scholar
  61. [61]
    S. Karamardian. Generalized complementarity problems. Journal of Optimization Theory and Applications 8 (1971) 161–168.zbMATHCrossRefMathSciNetGoogle Scholar
  62. [62]
    S. Karamardian. The complementarity problem. Mathematical Programming 2 (1972) 107–129.zbMATHCrossRefMathSciNetGoogle Scholar
  63. [63]
    N.K. Karmarkar. A new polynomial-time algorithm in linear programming. Combinatoria 4 (1984) 373–395.zbMATHMathSciNetGoogle Scholar
  64. [64]
    L. Khachiyan. A polynomial algorithm in linear programming (in Russian). Doklady Akademia Nauk SSSR 224 (1979) 1093–1096. [English translation: Soviet Mathematica Doklady 20 (1979) 191–194.]MathSciNetGoogle Scholar
  65. [65]
    L. Khachiyan. Polynomial algorithms in linear programming (in Russian). Zhumal Vychisitel’noi Matematiki i Matematicheskoi Fiziki 20 (1980) 51–68. [English translation: U.S.S.R. Computational Mathematics and Mathematical Physics 20, (1980)53–72.]zbMATHMathSciNetGoogle Scholar
  66. [66]
    V. Klee and G.J. Minty. How good is the simplex algorithm? in (O. Shisha, ed.) Inequalities III. New York: Academic Press, 1972.Google Scholar
  67. [67]
    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, v. 538.] Berlin: Springer-Verlag, 1091.Google Scholar
  68. [68]
    C.D. Kolstad and L. Mathiesen. Computing Cournot-Nash equilibria. Operations Research 39 (1991) 739–748.zbMATHMathSciNetCrossRefGoogle Scholar
  69. [69]
    D. Kuhn and R. Lówen. Piecewise affine bijections of R n, and the equation Sx +Tx = y. Linear Algebra and its Applications 96 (1987) 109–129.zbMATHCrossRefMathSciNetGoogle Scholar
  70. [70]
    C.E. Lemke. Bimatrix equilibrium points and mathematical programming. Management Science 11 (1965) 681–689.MathSciNetGoogle Scholar
  71. [71]
    E. Lemke. A survey of complementarity theory. In [16, pp. 213–239].Google Scholar
  72. [72]
    E. Lemke and J.T. Howson, JR. Equilibrium points of bimatrix games. S1AM Journal on Applied Mathematics 12 (1964) 413–423.zbMATHCrossRefMathSciNetGoogle Scholar
  73. [73]
    Q. Luo and J-S. Pang. Error bounds for analytic systems and their applications. Mathematical Programming 67 (1994) 1–28.CrossRefMathSciNetGoogle Scholar
  74. [74]
    Q. Luo, J-S. Pang, and D. Ralph. Mathematical Programs with Equilibrium Constraints. Cambridge: Cambridge University Press, 1996.Google Scholar
  75. [75]
    O.L. Mangasarian and J-S. Pang. The extended linear complementarity problem. SIAM Journal on Matrix Analysis and Applications 16 (1995) 359–368.zbMATHCrossRefMathSciNetGoogle Scholar
  76. [76]
    L. Mathiesen. Computational experience in solving equilibrium models by a sequence of linear complementarity problems. Operations Research 33 (1985) 1225–1250.zbMATHMathSciNetGoogle Scholar
  77. [77]
    L. Mathiesen. An algorithm based on a sequence of linear complementarity problems applied to a Walrasian equilibrium model: An example: Mathematical Programming 37 (1987) 1–18.zbMATHMathSciNetGoogle Scholar
  78. [78]
    C.B. Metzler. Complementarity Modeis of Competitive Oligopolistic Electric Power Markets. Ph.D. thesis. The Johns Hopkins University, Baltimore, Md., 2000.Google Scholar
  79. [79]
    K.G. Murty. On the number of solutions to the linear complementarity problem and spanning properties of complementary cones. Linear Algebra and its Applications 5 (1972)65–108.zbMATHCrossRefMathSciNetGoogle Scholar
  80. [80]
    K.G. Murty. Computational complexity of complementary pivot methods. Mathematical Programming Study 7 (1978) 61–73.zbMATHMathSciNetGoogle Scholar
  81. [81]
    K.G. Murty Linear Complementarity, Linear and Nonlinear Programming. Berlin: Heldermann Verlag, 1988.zbMATHGoogle Scholar
  82. [82]
    Y. Nesterov and A. Nemirovski. Interior-Point Algorithms in Convex Programming. Philadelphia: SIAM, 1994.zbMATHGoogle Scholar
  83. [83]
    J-S. Pang and D. Chan. Iterative methods for variational and complementarity problems. Mathematical Programming 24 (1982) 284–313.zbMATHCrossRefMathSciNetGoogle Scholar
  84. [84]
    T.D. Parsons. Applications of principal pivoting, in (H.W. Kuhn, ed.) Proceedings of the Princeton Symposium on Mathematical Programming. Princeton, N.J.: Princeton University Press, 1970.Google Scholar
  85. [85]
    F. Pfeiffer And C. Glocker. Multibody Dynamics with Unilateral Contacts. New York: John Wiley & Sons, 1996.zbMATHGoogle Scholar
  86. [86]
    H. Pieper. Algorithms for Mathematical Programs with Equilibrium Constraints with Applications to Deregulated Electricity Markets. Ph.D. thesis. Stanford University, Stanford, Calif., 2001.Google Scholar
  87. [87]
    F. A. Potra and R. Sheng. A large-step infeasible-interior-point method for the P*-matrix LCP. SIAM Journal on Optimization 7 (1997) 318–335.zbMATHCrossRefMathSciNetGoogle Scholar
  88. [88]
    H. Samelson, R.M. THRALL, and O. WESLER. A partition theorem for Euclidean n-space. Proceedings of the American Mathematical Society 9 (1958) 805–807.zbMATHCrossRefMathSciNetGoogle Scholar
  89. [89]
    R.E. Stone. Geometric Aspects of the Linear Complementarity Problem. Ph.D. thesis. Stanford University, Stanford, Calif., 1981.Google Scholar
  90. [90]
    B.P. Szanc. The Generalized Complementarity Problem. Ph.D. thesis. Rensselaer Polytechnic Institute, Troy, N.Y., 1989.Google Scholar
  91. [91]
    T. Terlaky. A convergent criss-cross method. Mathematische Operationsforschung und Statistik, ser. Optimization 16 (1985) 683–690.zbMATHMathSciNetGoogle Scholar
  92. [92]
    M. J. Todd. The many facets of linear programming. Mathematical Programming 91 (2002)401–416.CrossRefMathSciNetGoogle Scholar
  93. [93]
    R.H. Tütüncu and M.J. Todd. Reducing horizontal linear complementarity problems. Linear Algebra and its Applications 223/224 (1993) 717–729.CrossRefGoogle Scholar
  94. [94]
    H. Väliaho. Criteria for sufficient matrices. Linear Algebra and its Applications 233 (1996) 109–129.zbMATHCrossRefMathSciNetGoogle Scholar
  95. [95]
    H. Väliaho. P *-matrices are just sufficient. Linear Algebra and its Applications 239 (1996) 103–108.zbMATHMathSciNetGoogle Scholar
  96. [96]
    H. Väliaho. Determining the handicap of a sufficient matrix. Linear Algebra and its Applications 253 (1997) 279–298.zbMATHCrossRefMathSciNetGoogle Scholar
  97. [97]
    S.J. Wr.Ight. An infeasible-interior-point algorithm for linear complementarity problems. Mathematical Programming 67 (1994) 29–51.CrossRefMathSciNetGoogle Scholar
  98. [98]
    S.J. Wrjght. Primal-Dual Interior-Point Methods. Philadelphia: SIAM, 1997.Google Scholar
  99. [99]
    Y. Ye Interior Algorithms for Linear, Quadratic, and Linearly Constrained Convex Programs. Ph.D. thesis. Stanford University, Stanford, Calif, 1988.Google Scholar
  100. [100]
    Y. Ye. A further result on the potential reduction algorithm for the P-matrix linear complementarity problem in (P.M. Pardalos, ed.) Advances in Optimization and Parallel Computing. Amsterdam: North-Holland, 1992, pp. 310–316.Google Scholar
  101. [101]
    Y. Ye. Interior Point Methods. New York: John Wiley & Sons, 1997.Google Scholar
  102. [102]
    Y. Ye And P. Pardalos. A class of linear complementarity problems solvable in polynomial time. Linear Algebra and its Applications 152 (1991) 3–17.zbMATHCrossRefMathSciNetGoogle Scholar
  103. [103]
    Y. Zhang. On the convergence of a class of infeasible interior-point algorithms for the horizontal linear complementarity problem. SIAM Journal on Optimization 4 (1994) 208–227.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • Richard W. Cottle
    • 1
  1. 1.Dept. of Operation ResearchStanford UniversityStanfordUSA

Personalised recommendations