Parallel pivotal algorithm for solving the linear complementarity problem

DOI10.1007/BF00940644MaRDI QIDQ2277374zbMATH OpenFDO

Authors Karen T. Medhi

Publication date 1991

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

Full work available at URL https://doi.org/10.1007/BF00940644

zbMATH Keywords

distributed algorithmsLemke's algorithmlinear complementarityparallel implementation

Mathematics Subject Classification ID

Distributed algorithms (68W15) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Review text

See the preview in Zbl 0702.90084.

Cites work

• Bimatrix Equilibrium Points and Mathematical Programming
• Complementary pivot theory of mathematical programming
• Equilibrium Points of Bimatrix Games
• scientific article; zbMATH DE number 3908182 (Why is no real title available?)
• Robust implementation of Lemke's method for the linear complementarity problem

Cited in

(3)

• Randomized pivot algorithms for \(P\)-matrix linear complementarity problems
• A pivoting algorithm for linear programming with linear complementarity constraints
• Parallel algorithm for solving linear programming problem under conditions of incomplete data

This page was built for publication: Parallel pivotal algorithm for solving the linear complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277374)