.png){kind=icon}
Return
A relaxed scalable modulus-based matrix splitting method for vertical nonlinear complementarity problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10589-026-00794-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A scalable modulus-based matrix splitting (SMMS) method is extended for solving the vertical nonlinear complementarity problem (VNCP) which shuns any auxiliary variables. With the aim to further enhance the efficiency, by introducing the relaxation matrix based on SMMS method, the relaxed scalable modulus-based matrix splitting (RSMMS) method is presented. When s=2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s=2$$\end{document}, a comparison theorem between SMMS and RSMMS methods is presented to theoretically demonstrate the effectiveness of introducing the relaxation matrix. Under mild conditions, the convergence of the RSMMS method for arbitrary s is established and the RSMMS method is proved to converge to the unique solution of the VNCP. As a by-product, sufficient conditions are established for a VNCP to have a unique solution. Numerical results are given to demonstrate the efficiency of SMMS and RSMMS methods.
Keywords:
Vertical nonlinear complementarity problem
Modulus-based matrix splitting method
Relaxation matrix
Unique solvability
Convergence analysis
Journal
C
IF:
2
Papers:
74
Citations:
3.5K
Organization
View more organizations
Cited Papers
No cited papers available