Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem (Q3980606): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0612047 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003570424 / rank | |||
Normal rank | |||
Latest revision as of 22:17, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem |
scientific article |
Statements
Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem (English)
0 references
26 June 1992
0 references
matrix splitting
0 references
sufficient matrices
0 references
interior-point method
0 references
iterative descent algorithms
0 references
linear complementarity problems
0 references
Convergence
0 references
