On generalizations of positive subdefinite matrices and the linear complementarity problem

DOI10.1080/03081087.2017.1383348MaRDI QIDQ5375919zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

copositive matricesgeneralized positive subdefinite matricesgeneralized positive subdefinite matrices of level \(k\)Lemke's algorithmlinear complementarity problemrow sufficient matrices

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

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

Cites work

• A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems
• Bimatrix Equilibrium Points and Mathematical Programming
• Convergence of SSOR methods for linear complementarity problems
• Criteria for copositive matrices
• Even more with the Lemke complementarity algorithm
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 1748522 (Why is no real title available?)
• Improved convergence theorems of modulus-based matrix splitting iteration methods for linear complementarity problems
• Matrix-theoretic criteria for the quasi-convexity and pseudo-convexity of quadratic functions
• Modified modulus-based matrix splitting iteration methods for linear complementarity problems.
• More on positive subdefinite matrices and the linear complementarity problem
• More with the Lemke complementarity algorithm
• New characterizations of row sufficient matrices
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• Positive subdefinite matrices, generalized monotonicity, and linear complementarity problems
• Some generalizations of positive definiteness and monotonicity
• Some Properties of Generalized Positive Subdefinite Matrices
• Subdefinite Matrices and Quadratic Forms
• Sufficient matrices and the linear complementarity problem
• The PMCGAOR and PMCSSOR methods for solving linear complementarity problems
• Two characterizations of sufficient matrices
• Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems

Cited in

(8)

• An optimization problem on subsets of the symmetric positive-semidefinite matrices
• Positive subdefinite matrices, generalized monotonicity, and linear complementarity problems
• On weak generalized positive subdefinite matrices and the linear complementarity problem
• Optimization Problems over Positive Pseudopolynomial Matrices
• Some Properties of Generalized Positive Subdefinite Matrices
• More on positive subdefinite matrices and the linear complementarity problem
• On some special matrices and their applications in linear complementarity problem
• Symmetric positive subdefinite tensors

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)