Combinatorial characterizations of \(K\)-matrices
From MaRDI portal
Publication:609481
DOI10.1016/j.laa.2010.08.008zbMath1206.15023arXiv0911.2171OpenAlexW2053642809MaRDI QIDQ609481
Komei Fukuda, Jan Foniok, Lorenz Klaus
Publication date: 1 December 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.2171
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Positive matrices and their generalizations; cones of matrices (15B48) Oriented matroids in discrete geometry (52C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- Good hidden \(P\)-matrix sandwiches
- NP-completeness of the linear complementarity problem
- A correction to a result in linear programming
- Symmetry and positive definiteness in oriented matroids
- On the complexity of polyhedral separability
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Oriented matroids
- Orientability of matroids
- The P-matrix problem is co-NP-complete
- Principal pivot transforms: Properties and applications
- Pivoting in linear complementarity: Two polynomial-time cases
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- Complementarity in Oriented Matroids
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
- Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem
- Oriented Matroids
- Bimatrix Equilibrium Points and Mathematical Programming
- A Probelm in Linear Inequalities
- A Partition Theorem for Euclidean n-Space
This page was built for publication: Combinatorial characterizations of \(K\)-matrices
