Journal
OPTIMIZATION METHODS & SOFTWARE
Volume -, Issue -, Pages -Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/10556788.2023.2278090
Keywords
Vertical linear complementarity problem; modulus-based matrix splitting iteration method; convergence
Ask authors/readers for more resources
This paper introduces a new method for solving the vertical linear complementarity problem (VLCP) and confirms its efficiency and superiority through numerical experiments.
In this paper, for solving the vertical linear complementarity problem (VLCP) effectively, a two-step new modulus-based matrix splitting (TNMMS) iteration method is introduced. Its convergence properties are discussed in depth. The efficiency of the proposed method is confirmed by some numerical experiments from the 2-D boundary problem. Numerical results show that the proposed method is superior to some existing methods, such as the two modulus-based matrix splitting (TMMS) iteration method (Numer. Algor., 2011, 57: 83-99) and the new modulus-based matrix splitting (NMMS) iteration method (Optim., 2023, 72: 2499-2516).
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available