New error bounds for the linear complementarity problem with an \(SB\)-matrix (Q2636944): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11075-012-9691-6 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11075-012-9691-6 / rank | |||
Normal rank | |||
Latest revision as of 12:58, 19 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New error bounds for the linear complementarity problem with an \(SB\)-matrix |
scientific article |
Statements
New error bounds for the linear complementarity problem with an \(SB\)-matrix (English)
0 references
18 February 2014
0 references
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.
0 references
error bounds
0 references
linear complementarity problem
0 references
\(B\)-matrices
0 references
\(SB\)-matrices
0 references
\(P\)-matrices
0 references
numerical examples
0 references
0 references
