Sign-solvable linear complementarity problems

DOI10.1016/J.LAA.2008.03.022MaRDI QIDQ929486zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

linear complementarity problemsqualitative matrix theory

Mathematics Subject Classification ID

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)

Recommendations

• Sign-Solvable Linear Complementarity Problems
• Solving linear programs from sign patterns
• Signsolvability revisited
• Sparse Linear Complementarity Problems
• The Linear Complementarity Problems with a Few Variables per Constraint

Cites work

• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 825098 (Why is no real title available?)
• scientific article; zbMATH DE number 3312380 (Why is no real title available?)
• scientific article; zbMATH DE number 3048439 (Why is no real title available?)
• Bimatrix Equilibrium Points and Mathematical Programming
• Brace generation
• Characterization of even directed graphs
• Complementary pivot theory of mathematical programming
• Linear systems with signed solutions
• Matching theory
• Mixed dominating matrices
• Mixed matrices and binomial ideals
• NP-completeness of the linear complementarity problem
• On matrices which have signed null-spaces
• Permanents, Pfaffian orientations, and even directed circuits
• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
• Pólya's permanent problem
• Recursive structure of S-matrices and an O(m^ 2) algorithm for recognizing sign solvability
• Signsolvability revisited
• Solving linear programs from sign patterns
• Solving the Linear Complementarity Problem in Circuit Simulation
• Some NP-complete problems in linear programming
• Some properties of matrices with signed null spaces.
• Systems of linear interval equations
• The P-matrix problem is co-NP-complete

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)