ComputingComputer ScienceAlgorithmsOptimizationTheory Of ComputationMathematical ProgrammingNonlinear ProgrammingOptimization TheoryQuadratic ProgrammingDegeneracyStationary Points
A procedure based on Lemke's algorithm is developed which either computes stationary points for general quadratic programs or else shows that the program has no optimum. If a general quadratic program has an optimum and satisfies a non-degeneracy condition then it is demonstrated that there are an odd number of stationary points.
6
Bimatrix Equilibrium Points and Mathematical Programming
C. E. Lemke · Management Science · 1965 · 1K citations · Full text
The Linear Complementarity Problem
B. Curtis Eaves · Management Science · 1971 · 288 citations