Degeneracy subgraph of the Lemke complementary pivot algorithm and anticycling rule

DOI10.1023/A:1022691830468zbMath0889.90140OpenAlexW190004673MaRDI QIDQ1367725

S. R. Mohan

Publication date: 4 June 1998

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022691830468

zbMATH Keywords

linear complementarity problemcyclingdegeneracy graphtransition node pivot rule

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Systematic construction of examples for cycling in the simplex method

Cites Work

• Unnamed Item
• Unnamed Item
• On the structure of the set bases of a degenerate point
• Survey of solved and open problems in the degeneracy phenomenon
• A new pivoting rule for solving various degeneracy problems
• Degeneracy in linear complementarity problems: A survey
• An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
• Least-Index Resolution of Degeneracy in Linear Complementarity Problems with Sufficient Matrices
• Cycling in linear complementarity problems
• Bimatrix Equilibrium Points and Mathematical Programming
• The Linear Complementarity Problem