Nonstationary relaxed multisplitting methods for solving linear complementarity problems with H-matrices
Cuiyu Liu, Chenliang Li
TL;DR
This paper introduces non-stationary relaxed multi-splitting methods for linear complementarity problems with H-matrices, providing convergence proofs and demonstrating efficiency through numerical tests.
Contribution
It presents novel non-stationary relaxed multi-splitting algorithms with proven convergence for H-matrix-based linear complementarity problems.
Findings
Methods converge under specified conditions
Numerical tests show high efficiency
Applicable to both synchronous and asynchronous settings
Abstract
In this paper we consider some non-stationary relaxed synchronous and asynchronous multi-splitting methods for solving the linear complementarity problems with their coefficient matrices being H-matrices. The convergence theorems of the methods are given,and the efficiency is shown by numerical tests.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Numerical methods for differential equations · Advanced Optimization Algorithms Research