On semimonotone star matrices and linear complementarity problem
From MaRDI portal
Abstract: In this article, we introduce the class of semimonotone star () matrices. We establish the importance of the class of -matrices in the context of complementarity theory. We show that the principal pivot transform of -matrix is not necessarily in general. However, we prove that -matrices, a subclass of the -matrices with some additional conditions, is in by showing this class is in We prove that LCP can be processable by Lemke's algorithm if We find some conditions for which the solution set of LCP is bounded and stable under the -property. We propose an algorithm based on an interior point method to solve LCP given
Recommendations
- On a class of semimonotone \(Q_ 0\)-matrices in the linear complementarity problem
- scientific article; zbMATH DE number 66882
- Pseudomonotone and copositive star matrices
- The linear complementarity problem and a subclass of fully semimonotone matrices
- On semimonotone matrices with nonnegative principal minors
Cites work
- scientific article; zbMATH DE number 3078983 (Why is no real title available?)
- A Centered Projective Algorithm for Linear Programming
- A constructive characterization ofQ o-matrices with nonnegative principal minors
- A field guide to the matrix classes found in the literature of the linear complementarity problem
- A unified approach to interior point algorithms for linear complementary problems
- Almost \(P_ 0\)-matrices and the class \(Q\)
- Almost copositive matrices
- Characterizing \(Q\)-matrices beyond \(L\)-matrices
- Generalized principal pivot transforms, complementarity theory and their applications in stochastic games
- Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem
- More on positive subdefinite matrices and the linear complementarity problem
- On Solution Stability of the Linear Complementarity Problem
- On almost type classes of matrices withQ-property
- On generalized positive subdefinite matrices and interior point algorithm
- On processability of Lemke's algorithm
- On semimonotone matrices with nonnegative principal minors
- On the Solution Sets of Linear Complementarity Problems
- On the classes of fully copositive and fully semimonotone matrices
- On the connectedness of solution sets in linear complementarity problems
- On the uniqueness of solutions to linear complementarity problems
- Principal pivot transforms of some classes of matrices
- Properties of some matrix classes based on principal pivot transform
- Pseudomonotone and copositive star matrices
- Some Properties of Fully Semimonotone, Q₀ -Matrices
- Some Properties of Generalized Positive Subdefinite Matrices
- Sufficient matrices belong to \(L\).
- The Linear Complementarity Problem
- The Linear Complementarity Problem
- The principal pivoting method revisited
- Two characterizations of sufficient matrices
- \(P_ c\)-matrices and the linear complementarity problem
Cited in
(2)
This page was built for publication: On semimonotone star matrices and linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5072466)