Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path (Q4943612)
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: Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path |
scientific article; zbMATH DE number 1416839
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path |
scientific article; zbMATH DE number 1416839 |
Statements
Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path (English)
0 references
19 March 2000
0 references
linear complementarity problem
0 references
primal-dual interior point algorithm
0 references
predictor-corrector algorithms
0 references
0.89104736
0 references
0.87493515
0 references
0.87215275
0 references
0.8628626
0 references
0.8555769
0 references
0.85175246
0 references
0.8494363
0 references
