New error bounds for linear complementarity problems of Nekrasov matrices and B-Nekrasov matrices
Chaoqian Li, Pingfan Dai, Yaotang Li
TL;DR
This paper introduces improved error bounds for linear complementarity problems involving Nekrasov and B-Nekrasov matrices, demonstrating their effectiveness through numerical examples that outperform previous bounds in certain cases.
Contribution
The paper provides new, tighter error bounds for these classes of matrices in linear complementarity problems, advancing the theoretical understanding and practical accuracy.
Findings
New bounds are better than previous ones in some cases
Numerical examples confirm the improved accuracy
Enhanced understanding of error behavior for Nekrasov matrices
Abstract
New error bounds for the linear complementarity problems are given respectively when the involved matrices are Nekrasov matrices and B-Nekrasov matrices. Numerical examples are given to show that new bounds are better respectively than those provided by Garcia-Esnaola and Pena in [15,16] in some cases.
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 · Electromagnetic Scattering and Analysis