A new improved error bound for linear complementarity problems for B-matrices
Lei Gao, Chaoqian Li
TL;DR
This paper introduces an improved error bound for linear complementarity problems involving B-matrices, enhancing previous bounds and providing conditions for its superiority over existing results.
Contribution
The paper presents a new, sharper error bound for B-matrix linear complementarity problems and establishes conditions under which it outperforms earlier bounds.
Findings
New error bound for B-matrix problems
Conditions for the bound's superiority
Comparison with previous bounds
Abstract
A new error bound for the linear complementarity problem when the matrix involved is a B-matrix is presented, which improves the corresponding result in [C.Q. Li et al., A new error bound for linear complementarity problems for B-matrices. Electron. J. Linear Al., 31:476-484, 2016]. In addition some sufficient conditions such that the new bound is sharper than that in [M. Garca-Esnaola and J.M. Pena. Error bounds for linear complementarity problems for B-matrices. Appl. Math. Lett., 22:1071-1075, 2009] are provided.
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 · Stability and Control of Uncertain Systems