The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems (Q4946716)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:4946716 |
scientific article; zbMATH DE number 1422771
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems |
scientific article; zbMATH DE number 1422771 |
Statements
The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems (English)
0 references
1998
0 references
horizontal linear complementarity problems
0 references
sufficient matrices
0 references
infeasible interior-point-paths
0 references
0.9297134280204772
0 references
0.9119868874549866
0 references
0.896392822265625
0 references
0.8916802406311035
0 references
