On extremal behaviors of Murty's least index method

DOI10.1007/BF01582581zbMath0805.90105WikidataQ56504902 ScholiaQ56504902MaRDI QIDQ1332313

Makoto Namiki, Komei Fukuda

Publication date: 8 September 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

linear complementarityMurty's least index method

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Pivoting in linear complementarity: Two polynomial-time cases, Criss-cross methods: A fresh view on pivot algorithms

Cites Work

• Unnamed Item
• Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
• An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
• A short proof of finiteness of Murty's principal pivoting algorithm
• LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
• Computational complexity of complementary pivot methods