On generalized positive subdefinite matrices and interior point algorithm
From MaRDI portal
Recommendations
- On the convergence of an iterative method for solving linear complementarity problem with WGPSBD matrix
- Some Properties of Generalized Positive Subdefinite Matrices
- More on positive subdefinite matrices and the linear complementarity problem
- Positive subdefinite matrices, generalized monotonicity, and linear complementarity problems
- On weak generalized positive subdefinite matrices and the linear complementarity problem
Cited in
(12)- On column competent matrices and linear complementarity problem
- On processability of Lemke's algorithm
- On the convergence of an iterative method for solving linear complementarity problem with WGPSBD matrix
- On semimonotone star matrices and linear complementarity problem
- On generalizations of positive subdefinite matrices and the linear complementarity problem
- More on hidden Z-matrices and linear complementarity problem
- More on matrix splitting modulus-based iterative methods for solving linear complementarity problem
- Projected fixed point iterative method for large and sparse horizontal linear complementarity problem
- On the solution set of semi-infinite tensor complementarity problem
- Error bound for the linear complementarity problem using plus function
- More on semipositive tensor and tensor complementarity problem
- On some properties of \({\omega}\)-uniqueness in tensor complementarity problem
This page was built for publication: On generalized positive subdefinite matrices and interior point algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1625539)
