Parallel pivotal algorithm for solving the linear complementarity problem

  • K. T. Medhi
Contributed Papers
  • 62 Downloads

Abstract

We propose a parallel implementation of the classical Lemke's algorithm for solving the linear complementarity problem. The algorithm is designed for a loosely coupled network of computers which is characterized by relatively high communication costs. We provide an accurate prediction of speedup based on a simple operation count. The algorithm produces speedup nearp, wherep is the number of processors, when tested on large problems as demonstrated by computational results on the CRYSTAL token-ring multicomputer and the Sequent Balance 21000 multiprocessor.

Key Words

Parallel algorithms Lemke's algorithm linear complementarity problem distributed algorithms 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lemke, C. E.,Bimatrix Equilibrium Points and Mathematical Programming, Management Science, Vol. 11, pp. 681–689, 1965.Google Scholar
  2. 2.
    De Witt, D. J., Finkel, R., andSolomon, M.,The Crystal Multicomputer: Design and Implementation Experience, IEEE Transactions on Software Engineering, Vol. SE-13, pp. 953–966, 1987.Google Scholar
  3. 3.
    Schnabel, R. B.,Parallel Computing in Optimization, Technical Report No. CU-CS-282-84, Department of Computer Science, University of Colorado, Boulder, Colorado, 1984.Google Scholar
  4. 4.
    Bhide, C. W.,Parallel Simplex Method, Experience with Crystal, Charlotte, and Lynx—Second Report, Edited by R. Finkelet al., Technical Report No. 649, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, 1986.Google Scholar
  5. 5.
    Phillips, A. T., andRosen, J. B.,Multitasking Mathematical Programming Algorithms, Technical Report No. 86-10, Department of Computer Science, University of Minnesota, Minneapolis, Minnesota, 1986.Google Scholar
  6. 6.
    Agrawal, R., andJagadish, H. V.,Parallel Computation on Loosely-Coupled Workstations, Technical Report, Computer Technology Research Laboratory, AT&T Bell Laboratories, 1986.Google Scholar
  7. 7.
    Lemke, C. E., andHowson, J. T.,Equilibrium Points of Bimatrix Games, SIAM Journal on Applied Mathematics, Vol. 12, pp. 413–423, 1964.Google Scholar
  8. 8.
    Cottle, R. W., andDantzig, G. B.,Complementary Pivot Theory of Mathematical Programming, Linear Algebra and Applications, Vol. 1, pp. 103–125, 1968.Google Scholar
  9. 9.
    Tomlin, J. A.,Robust Implementation of Lemke's Method for the Linear Complementarity Problem, Mathematical Programming Study, Vol. 7, pp. 55–60, 1978.Google Scholar

Copyright information

© Plenum Publishing Corporation 1991

Authors and Affiliations

  • K. T. Medhi
    • 1
  1. 1.AT&TKansas City

Personalised recommendations