Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems (Q4240625)
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: Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems |
scientific article; zbMATH DE number 1281327
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems |
scientific article; zbMATH DE number 1281327 |
Statements
Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems (English)
0 references
1 August 1999
0 references
interior point algorithm
0 references
polynomial iterative complexity
0 references
scaled Lipschitz condition
0 references
non-monotone nonlinear complementarity problems
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8937572240829468
0 references
0.8731523752212524
0 references
0.8651071786880493
0 references
0.8537432551383972
0 references
0.8502845168113708
0 references
