Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Subspace SSOR methods for a class of generalized linear complementarity problem

  • 期刊论文

  • 发表日期：

    2026年6月1日

查看全文
  • Ge Li,
  • Jicheng Li

摘要

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.