A variable dimension algorithm for the linear complementarity problem

DOI10.1007/BF01581652zbMath0442.90090MaRDI QIDQ3885547

Ludo van der Heyden

Publication date: 1980

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

linear complementarity problem; different dimensions; sequence of subproblems; variable dimension algorithm; nonmonotonic behavior; index-theoretic arguments

Mathematics Subject Classification ID

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

Related Items

Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems, A variable dimension homotopy for computing spatial equilibria, Jointly constrained bilinear programs and related problems: An overview, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem, A variable-dimension homotopy on networks for computing linear spatial equilibria, Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, A polynomial-time algorithm for a class of linear complementarity problems, The linear complementarity problem, sufficient matrices, and the criss- cross method, Degeneracy in linear complementarity problems: A survey, Computational experience with general equilibrium problems, A finite improvement algorithm for the linear complementarity problem, Linear complementarity problem with upper bounds, Improving projected successive overrelaxation method for linear complementarity problems, Complementarity in Oriented Matroids, Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's, Even more with the Lemke complementarity algorithm, Completely- matrices, A new variable dimension algorithm for the fixed point problem, A Polynomial Method of Weighted Centers for Convex Quadratic Programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complementary pivot theory of mathematical programming
• Completely- matrices
• The Solution of Systems of Piecewise Linear Equations
• A Refinement Procedure for Computing Fixed Points Using Scarf's Primitive Sets
• On generalizing shapley's index theory to labelled pseudomanifolds
• Some pivot schemes for the linear complementarity problem
• Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem
• Equilibrium Points of Bimatrix Games
• Bimatrix Equilibrium Points and Mathematical Programming
• The Linear Complementarity Problem