TY - JOUR
T1 - Subspace SSOR methods for a class of generalized linear complementarity problem
AU - Li, Ge
AU - Li, Jicheng
N1 - Publisher Copyright:
© The Author(s), under exclusive licence to Operational Research Society of India 2026.
PY - 2026
Y1 - 2026
N2 - In this paper, we introduce a class of generalized linear complementarity problem(G-LCP), which only needs to satisfy the complementarity condition in a nonempty index set. Then, we propose subspace SSOR methods to solve G-LCP and prove that the iterations are contractions. It is pointed out that G-LCP can be applied to some convex quadratic programming problems. Numerical examples are tested to illustrate the efficiency of our proposed methods.
AB - In this paper, we introduce a class of generalized linear complementarity problem(G-LCP), which only needs to satisfy the complementarity condition in a nonempty index set. Then, we propose subspace SSOR methods to solve G-LCP and prove that the iterations are contractions. It is pointed out that G-LCP can be applied to some convex quadratic programming problems. Numerical examples are tested to illustrate the efficiency of our proposed methods.
KW - Convergence analysis
KW - Convex quadratic programming
KW - Generalized linear complementarity problem
KW - Subspace SSOR methods
UR - https://www.scopus.com/pages/publications/105040701037
U2 - 10.1007/s12597-026-01191-1
DO - 10.1007/s12597-026-01191-1
M3 - 文章
AN - SCOPUS:105040701037
SN - 0030-3887
JO - OPSEARCH
JF - OPSEARCH
ER -