Sign-solvable linear complementarity problems
DOI10.1016/J.LAA.2008.03.022zbMATH Open1145.90094OpenAlexW2141351272WikidataQ112882158 ScholiaQ112882158MaRDI QIDQ929486FDOQ929486
Authors: Naonori Kakimura 
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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Linear inequalities of matrices (15A39)
Cites Work
- Matching theory
- Pólya's permanent problem
- Permanents, Pfaffian orientations, and even directed circuits
- Title not available (Why is that?)
- Complementary pivot theory of mathematical programming
- Bimatrix Equilibrium Points and Mathematical Programming
- Systems of linear interval equations
- Title not available (Why is that?)
- Signsolvability revisited
- Title not available (Why is that?)
- NP-completeness of the linear complementarity problem
- Some properties of matrices with signed null spaces.
- Linear systems with signed solutions
- On matrices which have signed null-spaces
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Mixed matrices and binomial ideals
- Brace generation
- Characterization of even directed graphs
- The P-matrix problem is co-NP-complete
- Solving linear programs from sign patterns
- Recursive structure of S-matrices and an \(O(m^ 2)\) algorithm for recognizing sign solvability
- Mixed dominating matrices
- Title not available (Why is that?)
- Some NP-complete problems in linear programming
- Solving the Linear Complementarity Problem in Circuit Simulation
Cited In (10)
- Signsolvability revisited
- Sign-Solvable Linear Complementarity Problems
- Solving linear programs from sign patterns
- Linear solving for sign determination
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
- Trichotomy for integer linear systems based on their sign patterns
- The Linear Complementarity Problems with a Few Variables per Constraint
- A non-modulus linear method for solving the linear complementarity problem
- Sign consistent linear programming problems
- On perturbation bounds of the linear complementarity problem
This page was built for publication: Sign-solvable linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q929486)
