On quasi-solution to infeasible linear complementarity problem obtained by Lemke's method

DOI10.2478/BF02475952zbMath1053.65045MaRDI QIDQ1422621

Leonid Denisovich Popov

Publication date: 23 February 2004

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

Chebyshev approximationLemke's methodinfeasible linear complementarity problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Extreme-point and pivoting methods (90C49)

Uses Software

• SNOPT

Cites Work

• Experiments with successive quadratic programming algorithms
• Multiple-objective approximation of feasible but unsolvable linear complementarity problems
• Complementary pivot theory of mathematical programming
• A constructive characterization ofQ o-matrices with nonnegative principal minors
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Equilibrium Points of Bimatrix Games
• The Linear Complementarity Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On quasi-solution to infeasible linear complementarity problem obtained by Lemke's method