A two-step matrix splitting method for the mixed linear complementarity problem
type: Item
instance of: scholarly article
title: A two-step matrix splitting method for the mixed linear complementarity problem
zbMATH Open document ID: 1548.65083
DOI: 10.11948/20230373
author: Cuixia Li
author: Shiliang Wu
published in: Journal of Applied Analysis and Computation
publication date: 2024-10-09T00:00:00Z
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 7924343
zbMATH Keywords: mixed linear complementarity problem
zbMATH Keywords: new modulus-based matrix splitting method
zbMATH Keywords: sufficient condition
zbMATH Keywords: convergence
MaRDI profile type: Publication
cites work: Solution of nonsymmetric, linear complementarity problems by iterative methods
cites work: Modulus-based matrix splitting iteration methods for linear complementarity problems
cites work: Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
cites work: Block Triangular and Skew-Hermitian Splitting Methods for Positive-Definite Linear Systems
cites work: Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hemitian positive semidefinite linear systems
cites work: Modulus-based synchronous multisplitting iteration methods for linear complementarity problems
cites work: Q3943082
cites work: Q4003375
cites work: The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
cites work: Bounded homotopy path approach to the solution of linear complementarity problems
cites work: An RLT approach for solving the binary-constrained mixed linear complementarity problem
cites work: On the extended linear complementarity problem
cites work: Stability Analysis of Variational Inequalities and Nonlinear Complementarity Problems, via the Mixed Linear Complementarity Problem and Degree Theory
cites work: Modulus-based matrix splitting iteration methods for a class of implicit complementarity problems
cites work: A primal-dual infeasible-interior-point algorithm for linear programming
cites work: A class of modulus-based matrix splitting methods for vertical linear complementarity problem
cites work: Solution of symmetric linear complementarity problems by iterative methods
cites work: Modulus-based matrix splitting methods for horizontal linear complementarity problems
cites work: Q4039868
cites work: An Infeasible-Interior-Point Method for Linear Complementarity Problems
cites work: Q5342712
cites work: Modulus-based matrix splitting algorithms for the quasi-complementarity problems
cites work: A class of new modulus-based matrix splitting methods for linear complementarity problem
cites work: Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems
cites work: New modulus-based matrix splitting methods for implicit complementarity problem
cites work: Q5639278
cites work: Two-step modulus-based matrix splitting iteration method for linear complementarity problems
cites work: Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
description: scientific article; zbMATH DE number 7924343