An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (Q1915906)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 894979
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence |
scientific article; zbMATH DE number 894979 |
Statements
An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (English)
0 references
24 October 1996
0 references
infeasible-interior-point algorithm
0 references
polynomiality
0 references
superlinear convergence
0 references
Mizuno-Todd-Ye predictor-corrector algorithm
0 references
monotone linear complementarity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.911242425441742
0 references
0.8905008435249329
0 references
0.8777413964271545
0 references
0.8743648529052734
0 references
