Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity (Q4979856)
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: Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity |
scientific article; zbMATH DE number 6305469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity |
scientific article; zbMATH DE number 6305469 |
Statements
Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity (English)
0 references
19 June 2014
0 references
linear complementarity
0 references
interior point
0 references
path following
0 references
corrector-predictor
0 references
sufficient matrix
0 references
wide neighborhood
0 references
0.8971176147460938
0 references
0.883960485458374
0 references
0.8839483261108398
0 references
0.8832265734672546
0 references
