A finite improvement algorithm for the linear complementarity problem
From MaRDI portal
Recommendations
- An Infeasible-Interior-Point Method for Linear Complementarity Problems
- A polynomial-time algorithm for a class of linear complementarity problems
- AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM
- A rapid algorithm for a class of linear complementarity problems
- scientific article; zbMATH DE number 1326028
Cites work
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- A Least-Element Theory of Solving Linear Complementarity Problems as Linear Programs
- A New and Efficient Algorithm for a Class of Portfolio Selection Problems
- A Parametric Linear Complementarity Technique for Optimal Portfolio Selection with a Risk-Free Asset
- A Partial Characterization of a Class of Matrices Defined by Solutions to the Linear Complementarity Problem
- A Partition Theorem for Euclidean n-Space
- A Probelm in Linear Inequalities
- A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem
- A matrix structural theory of piecewise linear elastoplasticity with interacting yield planes
- A variable dimension algorithm for the linear complementarity problem
- An algorithm for a piecewise linear model of trade and production with negative prices and bankruptcy
- Bimatrix Equilibrium Points and Mathematical Programming
- Characterization of linear complementarity problems as linear programs
- Characterizations of bounded solutions of linear complementarity problems
- Complementary pivot theory of mathematical programming
- Computational complexity of complementary pivot methods
- Equilibrium Points of Bimatrix Games
- Generalized equations and their solutions, Part I: Basic theory
- Generalized upper bounding techniques
- Linear complementarity problems solvable by A single linear program
- More with the Lemke complementarity algorithm
- On Quadratic Programming
- On a class of least-element complementarity problems
- On solving linear complementarity problems as linear programs
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation
- The Linear Complementarity Problem
Cited in
(13)- Projective algorithms for solving complementarity problems
- A Finite Algorithm for Almost Linear Complementarity Problems
- Improved algorithms for linear complementarity problem arising from collision response
- A constrained optimization approach to solving certain systems of convex equations
- Using vector divisions in solving the linear complementarity problem
- scientific article; zbMATH DE number 432996 (Why is no real title available?)
- Least squares with inequality restrictions: a symmetric positive-definite linear complementarity problem algorithm
- Solving the Linear Complementarity Problem in Circuit Simulation
- On processability of Lemke's algorithm
- A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps
- A short proof of finiteness of Murty's principal pivoting algorithm
- Solving strongly monotone linear complementarity problems
- On a ``stability in the linear complementarity problem
This page was built for publication: A finite improvement 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 Q1823161)
