The linear complementarity problem, sufficient matrices, and the criss- cross method
From MaRDI portal
Publication:1260955
DOI10.1016/0024-3795(93)90124-7zbMath0778.65044OpenAlexW1982749624WikidataQ56504898 ScholiaQ56504898MaRDI QIDQ1260955
Tamás Terlaky, Dick den Hertog, Cornelis Roos
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\)-matricesbisymmetric matricesprincipal pivoting methodcriss-cross methodoriented matroid programming problems
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Positive-definite tensors to nonlinear complementarity problems, New variants of the criss-cross method for linearly constrained convex quadratic programming, Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation, A Unified Framework for Structured Graph Learning via Spectral Constraints, Criteria for sufficient matrices, Criss-cross methods: A fresh view on pivot algorithms, On ill-posedness and stability of tensor variational inequalities: application to an economic equilibrium, EP theorems and linear complementarity problems, Finiteness of Criss-Cross Method in Complementarity Problem, Unnamed Item, Exterior point simplex-type algorithms for linear and network optimization problems, The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems, A polynomial path-following interior point algorithm for general linear complementarity problems, Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied, The finite criss-cross method for hyperbolic programming, New criss-cross type algorithms for linear complementarity problems with sufficient matrices, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique, Data-Driven Preference Learning Methods for Value-Driven Multiple Criteria Sorting with Interacting Criteria, On column competent matrices and linear complementarity problem, Pivot rules for linear programming: A survey on recent theoretical developments, A procedure for the one-parametric linear complementarity problem, New variants of finite criss-cross pivot algorithms for linear programming
Cites Work
- 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
- Unnamed Item
- Unnamed Item
