Sign-solvable linear complementarity problems
From MaRDI portal
Publication:929486
DOI10.1016/j.laa.2008.03.022zbMath1145.90094OpenAlexW2141351272WikidataQ112882158 ScholiaQ112882158MaRDI QIDQ929486
Publication date: 17 June 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2008.03.022
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Linear inequalities of matrices (15A39) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (5)
The Linear Complementarity Problems with a Few Variables per Constraint ⋮ Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem ⋮ Trichotomy for integer linear systems based on their sign patterns ⋮ A non-modulus linear method for solving the linear complementarity problem ⋮ On perturbation bounds of the linear complementarity problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On matrices which have signed null-spaces
- Systems of linear interval equations
- Signsolvability revisited
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Solving linear programs from sign patterns
- Characterization of even directed graphs
- Matching theory
- Recursive structure of S-matrices and an \(O(m^ 2)\) algorithm for recognizing sign solvability
- NP-completeness of the linear complementarity problem
- The P-matrix problem is co-NP-complete
- Mixed dominating matrices
- Some properties of matrices with signed null spaces.
- Linear systems with signed solutions
- Pólya's permanent problem
- Mixed matrices and binomial ideals
- Some NP-complete problems in linear programming
- Permanents, Pfaffian orientations, and even directed circuits
- Complementary pivot theory of mathematical programming
- Brace generation
- Solving the Linear Complementarity Problem in Circuit Simulation
- Bimatrix Equilibrium Points and Mathematical Programming
This page was built for publication: Sign-solvable linear complementarity problems
