Matrices and the linear complementarity problem
From MaRDI portal
(Redirected from Publication:1154944)
surveylinear complementarity problemQ-matrixexistence and uniqueness resultsP-matrixZ-matrixL-matrixK-matrix
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Positive matrices and their generalizations; cones of matrices (15B48) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites work
- scientific article; zbMATH DE number 3687119 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- scientific article; zbMATH DE number 3311772 (Why is no real title available?)
- scientific article; zbMATH DE number 3332061 (Why is no real title available?)
- scientific article; zbMATH DE number 3350062 (Why is no real title available?)
- scientific article; zbMATH DE number 3361689 (Why is no real title available?)
- A Least-Element Theory of Solving Linear Complementarity Problems as Linear Programs
- A Partition Theorem for Euclidean n-Space
- A linear complementarity problem with an n by 2n “P”-matrix
- A note on an open problem in linear complementarity
- A parametric linear complementarity problem involving derivatives
- Bimatrix Equilibrium Points and Mathematical Programming
- Characterization of linear complementarity problems as linear programs
- Characterizations of bounded solutions of linear complementarity problems
- Coercivity Conditions in Nonlinear Complementarity Problems
- Complementary pivot theory of mathematical programming
- Existence of solution rays for linear complementarity problems with Z-matrices
- Existence theory for generalized nonlinear complementarity problems
- Linear complementarity problems and characterizations of Minkowski matrices
- Linear complementarity problems solvable by A single linear program
- Minimality and complementarity properties associated with Z-functions and M-functions
- Monotone solutions of the parametric linear complementarity problem
- More with the Lemke complementarity algorithm
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- On classes of copositive matrices
- On solving linear complementarity problems as linear programs
- On the basic theorem of complementarity
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- On the simplex method and a class of linear complementarity problems
- On the solution of large, structured linear complementarity problems: The tridiagonal case
- On values and strategies for infinite-time linear quadratic games
- Orientation in Complementary Pivot Algorithms
- Polyhedral sets having a least element
- Q-matrices and spherical geometry
- Sets of Generalized Complementarity Problems and P-Matrices
- Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
- Some classes of matrices in linear complementarity theory
- The Jacobian matrix and global univalence of mappings
- The Solution of Systems of Piecewise Linear Equations
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- The complementarity problem
- Two remarks on copositive matrices
Cited in
(2)
This page was built for publication: Matrices and the linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1154944)