Abstract
In this paper, we present some novel observations for the semidefinite linear complementarity problems, abbreviated as SDLCPs. Based on these new results, we establish the modulus-based matrix splitting iteration methods, which are obtained by reformulating equivalently SDLCP as an implicit fixed-point matrix equation. The convergence of the proposed modulus-based matrix splitting iteration methods has been analyzed. Numerical experiments have shown that the modulus-based iteration methods are effective for solving SDLCPs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have