A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity (Q4340802)
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: A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity |
scientific article; zbMATH DE number 1021253
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity |
scientific article; zbMATH DE number 1021253 |
Statements
A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity (English)
0 references
12 June 1997
0 references
linear complementarity problems
0 references
predictor--corrector
0 references
infeasible-interior-point algorithm
0 references
polynomiality
0 references
superlinear convergence
0 references
infeasible starting points
0 references
0.911242425441742
0 references
0.8487303853034973
0 references
0.8449787497520447
0 references
0.8410758376121521
0 references
