A finite improvement algorithm for the linear complementarity problem

DOI10.1016/0377-2217(89)90168-9zbMath0679.90083OpenAlexW1965005791MaRDI QIDQ1823161

Daniel Solow, Konstantinos Paparrizos

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90168-9

zbMATH Keywords

linear complementaritypiecewise linear functionsComputational comparisonssimplex-like algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (1)

A constrained optimization approach to solving certain systems of convex equations

Cites Work

• Unnamed Item
• Unnamed Item
• Complementary pivot theory of mathematical programming
• Generalized upper bounding techniques
• A matrix structural theory of piecewise linear elastoplasticity with interacting yield planes
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem
• A Parametric Linear Complementarity Technique for Optimal Portfolio Selection with a Risk-Free Asset
• A variable dimension algorithm for the linear complementarity problem
• A New and Efficient Algorithm for a Class of Portfolio Selection Problems
• Characterizations of bounded solutions of linear complementarity problems
• A Partial Characterization of a Class of Matrices Defined by Solutions to the Linear Complementarity Problem
• Linear complementarity problems solvable by A single linear program
• Characterization of linear complementarity problems as linear programs
• On solving linear complementarity problems as linear programs
• Computational complexity of complementary pivot methods
• A Least-Element Theory of Solving Linear Complementarity Problems as Linear Programs
• More with the Lemke complementarity algorithm
• On a class of least-element complementarity problems
• On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation
• An algorithm for a piecewise linear model of trade and production with negative prices and bankruptcy
• Generalized equations and their solutions, Part I: Basic theory
• Equilibrium Points of Bimatrix Games
• Bimatrix Equilibrium Points and Mathematical Programming
• A Probelm in Linear Inequalities
• The Linear Complementarity Problem
• On Quadratic Programming
• A Partition Theorem for Euclidean n-Space

This page was built for publication: A finite improvement algorithm for the linear complementarity problem