The linear complementarity problem, sufficient matrices, and the criss- cross method
From MaRDI portal
Publication:1260955
DOI10.1016/0024-3795(93)90124-7zbMath0778.65044WikidataQ56504898 ScholiaQ56504898MaRDI QIDQ1260955
Cornelis Roos, Tamás Terlaky, Dick den Hertog
Publication date: 29 August 1993
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(93)90124-7
linear complementarity problems; \(P\)-matrices; bisymmetric matrices; principal pivoting method; criss-cross method; oriented matroid programming problems
65K05: Numerical mathematical programming methods
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
A procedure for the one-parametric linear complementarity problem, Pivot rules for linear programming: A survey on recent theoretical developments, Criss-cross methods: A fresh view on pivot algorithms, EP theorems and linear complementarity problems, New variants of finite criss-cross pivot algorithms for linear programming, The finite criss-cross method for hyperbolic programming, New variants of the criss-cross method for linearly constrained convex quadratic programming, Criteria for sufficient matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- The principal pivoting method revisited
- Linear quadratic programming in oriented matroids
- A finite crisscross method for oriented matroids
- Symmetry and positive definiteness in oriented matroids
- Sufficient matrices and the linear complementarity problem
- A polynomial-time algorithm for a class of linear complementarity problems
- A class of linear complementarity problems solvable in polynomial time
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Two characterizations of sufficient matrices
- Complementary pivot theory of mathematical programming
- A convergent criss-cross method
- A constructive characterization ofQ o-matrices with nonnegative principal minors
- A variable dimension algorithm for the linear complementarity problem
- A Polynomial Method of Weighted Centers for Convex Quadratic Programming
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
- Some generalizations of the criss-cross method for quadratic programming
- Bimatrix Equilibrium Points and Mathematical Programming
