New error bounds for the linear complementarity problem with an \(SB\)-matrix (Q2636944): Difference between revisions

The authors establish some new error bounds for a linear complementarity problem with an \(SB\)-matrix. The proposed error bounds are sharper than those of the paper by \textit{P.-F. Dai} et al. [Numer. Algorithms 61, No. 1, 121--139 (2012; Zbl 1266.65090)] under some wild assumptions. The computational experiments are provided to illustrate the theoretical results obtained in this paper.