Combined approach to solve the linear complementarity problem

MaRDI QIDQ4642220zbMATH OpenFDO

Authors Zakia Kebbiche, H. Roumili

Publication date 22 May 2018

zbMATH Keywords

Lemke's algorithmlinear programlinear complementary problemnotion of pivotquadratic convex program

Mathematics Subject Classification ID

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

Recommendations

• Comparative study between Lemke's method and the interior point method for the monotone linear complementarity problem
• A new approach for solving an optimization problem
• A combined homotopy interior point method for the linear complementarity problem
• scientific article; zbMATH DE number 2128205
• Linear complementarity problem and multiobjective optimization

Cited in

(7)

• On solving linear complementarity problems by DC programming and DCA
• Unified approaches for solvable and unsolvable linear complementarity problems
• Subspace accelerated matrix splitting algorithms for asymmetric and symmetric linear complementarity problems
• A new approach for solving an optimization problem
• An improved global harmony search algorithm for linear complementarity problem
• Comparative study between Lemke's method and the interior point method for the monotone linear complementarity problem
• scientific article; zbMATH DE number 2128205 (Why is no real title available?)

This page was built for publication: Combined approach to solve the linear complementarity problem

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