Login / Signup

A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems.

Dong-Kai LiLi WangYu-Ying Liu
Published in: J. Comput. Appl. Math. (2022)
Keyphrases
  • linear complementarity problem
  • objective function
  • pairwise
  • dynamic programming
  • lower bound
  • clustering method
  • computational complexity
  • support vector machine
  • sensitivity analysis
  • quadratic programming