A new error bound for linear complementarity problems for B-matrices
Chaoqian Li, Mengting Gan, Shaorong Yang
TL;DR
This paper introduces a new, sharper error bound for linear complementarity problems involving B-matrices, improving upon previous bounds and enhancing the accuracy of solutions in this mathematical context.
Contribution
The paper presents a novel error bound for B-matrix linear complementarity problems that is demonstrably more precise than existing bounds.
Findings
The new bound is sharper than previous bounds.
The bound applies specifically to B-matrices.
It improves solution accuracy for related problems.
Abstract
A new error bound for the linear complementarity problem is given when the involved matrix is a B-matrix. It is shown that this bound is sharper than some previous bounds [C.Q. Li, Y.T. Li. Note on error bounds for linear complementarity problems for B-matrices, Applied Mathematics Letters, 57:108-113,2016] and [C.Q. Li, Y.T. Li. Weakly chained diagonally dominant B-matrices and error bounds for linear complementarity problems, to appear in Numer.Algor.].
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 · Advanced Optimization Algorithms Research · graph theory and CDMA systems