Error Bound for the Linear Complementarity Problem using Plus Function
Bharat Kumar, Deepmala, A. Dutta, A. K. Das

TL;DR
This paper derives error bounds for the linear complementarity problem with P-matrices using the plus function, introducing a new fundamental quantity to improve understanding of solution stability.
Contribution
It introduces a new fundamental quantity related to P-matrices and uses it to establish error bounds for the linear complementarity problem, advancing theoretical understanding.
Findings
Established error bounds for P-matrix LCPs using the plus function
Introduced a new fundamental quantity associated with P-matrices
Derived bounds for this quantity, enhancing solution analysis
Abstract
In this article we establish error bound for linear complementarity problem with -matrix using plus function. We introduce a fundamental quantity associated with a -matrix and show how this quantity is useful in deriving error bounds for the linear complementarity problem of the -type. We also obtain (upper and lower) bounds for the quantity introduced. Keywords: Linear complementarity problem, plus function, error bound, relative error bound.
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 · Mathematical Inequalities and Applications
