On column competent matrices and linear complementarity problem

DOI10.1007/978-981-16-6890-6_46zbMath1502.90175arXiv2108.06495OpenAlexW3196164445MaRDI QIDQ2079987

Yanyan Li

Publication date: 7 October 2022

Full work available at URL: https://arxiv.org/abs/2108.06495

zbMATH Keywords

linear complementarity problemcolumn competent matrices\(w\)-uniquenesscolumn adequate matrices

Mathematics Subject Classification ID

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

Related Items (1)

More on matrix splitting modulus-based iterative methods for solving linear complementarity problem

Cites Work

• Properties of some matrix classes based on principal pivot transform
• Two characterization theorems in complementarity theory
• The linear complementarity problem, sufficient matrices, and the criss- cross method
• On local \(w\)-uniqueness of solutions to linear complementarity problem
• On generalized positive subdefinite matrices and interior point algorithm
• Principal pivot transforms of some classes of matrices
• \(P_ *\)-matrices are just sufficient
• On hidden \(Z\)-matrix and interior point algorithm
• Finiteness of Criss-Cross Method in Complementarity Problem
• Some Properties of Generalized Positive Subdefinite Matrices
• A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution
• A Probelm in Linear Inequalities
• On almost type classes of matrices withQ-property
• A Partition Theorem for Euclidean n-Space
• More on hidden Z-matrices and linear complementarity problem
• On the classes of fully copositive and fully semimonotone matrices
• More on positive subdefinite matrices and the linear complementarity problem
• Unnamed Item

This page was built for publication: On column competent matrices and linear complementarity problem