On generalizations of positive subdefinite matrices and the linear complementarity problem
DOI10.1080/03081087.2017.1383348zbMATH Open1397.90376OpenAlexW2762191668MaRDI QIDQ5375919FDOQ5375919
Authors: Dipti Dubey, S. K. Neogy 
Publication date: 17 September 2018
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2017.1383348
Recommendations
- scientific article; zbMATH DE number 1748522
- Positive subdefinite matrices, generalized monotonicity, and linear complementarity problems
- On weak generalized positive subdefinite matrices and the linear complementarity problem
- More on positive subdefinite matrices and the linear complementarity problem
- Generalized positive subdefinite matrices
- Some Properties of Generalized Positive Subdefinite Matrices
- On generalized positive subdefinite matrices and interior point algorithm
- The almost positive subdefinite matrix
- scientific article; zbMATH DE number 5007964
- An optimization problem on subsets of the symmetric positive-semidefinite matrices
linear complementarity problemcopositive matricesLemke's algorithmrow sufficient matricesgeneralized positive subdefinite matricesgeneralized positive subdefinite matrices of level \(k\)
Cites Work
- Title not available (Why is that?)
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- Title not available (Why is that?)
- Bimatrix Equilibrium Points and Mathematical Programming
- Improved convergence theorems of modulus-based matrix splitting iteration methods for linear complementarity problems
- Some generalizations of positive definiteness and monotonicity
- Criteria for copositive matrices
- Sufficient matrices and the linear complementarity problem
- Two characterizations of sufficient matrices
- Matrix-theoretic criteria for the quasi-convexity and pseudo-convexity of quadratic functions
- Positive subdefinite matrices, generalized monotonicity, and linear complementarity problems
- Subdefinite Matrices and Quadratic Forms
- A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems
- Convergence of SSOR methods for linear complementarity problems
- Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
- Modified modulus-based matrix splitting iteration methods for linear complementarity problems.
- Even more with the Lemke complementarity algorithm
- More on positive subdefinite matrices and the linear complementarity problem
- Title not available (Why is that?)
- New characterizations of row sufficient matrices
- More with the Lemke complementarity algorithm
- Some Properties of Generalized Positive Subdefinite Matrices
- The PMCGAOR and PMCSSOR methods for solving linear complementarity problems
Cited In (6)
- More on positive subdefinite matrices and the linear complementarity problem
- Some Properties of Generalized Positive Subdefinite Matrices
- Optimization Problems over Positive Pseudopolynomial Matrices
- Positive subdefinite matrices, generalized monotonicity, and linear complementarity problems
- An optimization problem on subsets of the symmetric positive-semidefinite matrices
- On weak generalized positive subdefinite matrices and the linear complementarity problem
This page was built for publication: On generalizations of positive subdefinite matrices and the linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375919)
