A variable dimension algorithm for the linear complementarity problem

DOI10.1007/BF01581652MaRDI QIDQ3885547zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3487169 (Why is no real title available?)
• scientific article; zbMATH DE number 3571895 (Why is no real title available?)
• scientific article; zbMATH DE number 3422228 (Why is no real title available?)
• A Refinement Procedure for Computing Fixed Points Using Scarf's Primitive Sets
• Bimatrix Equilibrium Points and Mathematical Programming
• Complementary pivot theory of mathematical programming
• Completely- matrices
• Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem
• Equilibrium Points of Bimatrix Games
• On generalizing shapley's index theory to labelled pseudomanifolds
• Some pivot schemes for the linear complementarity problem
• The Linear Complementarity Problem
• The Solution of Systems of Piecewise Linear Equations

Cited in

(20)

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

This page was built for publication: A variable dimension algorithm for the linear complementarity problem

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