Abstract
In this small note, we observe some extremal behaviors of Murty's least index method for solving linear complementarity problems. In particular, we show that the expected number of steps for solving Murty's exponential example with a random permutation of variable indices is exactly equal ton, wheren is the size of the input square matrix.
Similar content being viewed by others
References
R.E. Cottle, J. Pang and R.E. Stone,The Linear Complementarity Problems (Academic Press, New York, 1992).
K. Fukuda and T. Terlaky, “Linear complementarity and oriented matroids,”Journal of the Operations Research Society of Japan 35 (1992) 45–61.
E. Klafszky and T. Terlaky, “Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids,”Combinatorica 9 (1989) 189–198.
K. Murty, “Note on Bard-type scheme for solving the complementarity problem,”Opsearch 11 (1974) 123–130.
K. Murty, “Computational complexity of complementary pivot methods,”Mathematical Programming Study 7 (1978) 61–73.
J. Rohn, “A short proof of finiteness of Murty's principal pivoting algorithm,”Mathematical Programming, 46 (1990) 255–256.
C. Roos, “An exponential example for Terlaky's pivoting rule for the criss-cross simplex method,”Mathematical Programming 46 (1990) 79–84.
Author information
Authors and Affiliations
Additional information
Corresponding author.
Rights and permissions
About this article
Cite this article
Fukuda, K., Namiki, M. On extremal behaviors of Murty's least index method. Mathematical Programming 64, 365–370 (1994). https://doi.org/10.1007/BF01582581
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582581