A variable dimension algorithm for the linear complementarity problem

DOI10.1007/BF01581652zbMath0442.90090OpenAlexW2020249948MaRDI QIDQ3885547

Ludo van der Heyden

Publication date: 1980

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

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

zbMATH Keywords

linear complementarity problemdifferent dimensionssequence of subproblemsvariable dimension algorithmnonmonotonic behaviorindex-theoretic arguments

Mathematics Subject Classification ID

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

Related Items

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

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