ON FULLY SEMIMONOTONE MATRICES

DOI10.1142/S0219198913400367zbMath1308.90182MaRDI QIDQ5396055

No author found.

Publication date: 5 February 2014

Published in: International Game Theory Review (Search for Journal in Brave)

zbMATH Keywords

incidencelinear complementarity problemfully semimonotone matricescomplementary cones

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (2)

Preface: International conference on game theory and optimization, June 6--10, 2016, Indian Institute of Technology Madras, Chennai, India ⋮ T. Parthasarathy's contributions to complementarity problems: a survey

Cites Work

• A copositive Q-matrix which is not \(R_ 0\)
• The linear complementarity problem and a subclass of fully semimonotone matrices
• On the connectedness of solution sets in linear complementarity problems
• \(P_ c\)-matrices and the linear complementarity problem
• An example of a nonregular semimonotone \(Q\)-matrix
• On Q-matrices
• OnQ-matrices
• The Linear Complementarity Problem
• On the uniqueness of solutions to linear complementarity problems
• A constructive characterization ofQ o-matrices with nonnegative principal minors
• On the Solution Sets of Linear Complementarity Problems
• Some Properties of Fully Semimonotone, $Q_0 $-Matrices
• Equilibrium Points of Bimatrix Games
• Bimatrix Equilibrium Points and Mathematical Programming
• The Linear Complementarity Problem
• The complementarity problem
• The Unloading Problem for Plane Curves
• On the classes of fully copositive and fully semimonotone matrices

This page was built for publication: ON FULLY SEMIMONOTONE MATRICES