Note on error bounds for linear complementarity problems of Nekrasov matrices (Q2287869): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q128233023, #quickstatements; #temporary_batch_1722793424638 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11075-019-00685-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11075-019-00685-Y / rank | |||
Normal rank | |||
Latest revision as of 20:21, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on error bounds for linear complementarity problems of Nekrasov matrices |
scientific article |
Statements
Note on error bounds for linear complementarity problems of Nekrasov matrices (English)
0 references
22 January 2020
0 references
The authors apply the monotonicity of functions of a parameter for linear complementarity problems of Nekrasov matrices to determine the optimal value of the error bound of such a problem, and give numerical examples to verify their results. This solves the error bound issue (see [\textit{M. García-Esnaola} and \textit{J. M. Peña}, Numer. Algorithms 67, No. 3, 655--667 (2014; Zbl 1338.90406)]) as the parameter tends to zero.
0 references
linear complementarity problems
0 references
error bounds
0 references
Nekrasov matrices
0 references
0 references
0 references
