Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity (Q1609646)
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: Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity |
scientific article; zbMATH DE number 1782091
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity |
scientific article; zbMATH DE number 1782091 |
Statements
Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity (English)
0 references
15 August 2002
0 references
complementarity problem
0 references
infeasible-interior-point algorithm
0 references
polynomial-time complexity
0 references
uniform \(P\)-function
0 references
0 references
0.8770736455917358
0 references
0.8728404641151428
0 references
0.8651071786880493
0 references
