Complexity of a Mehrotra-type predictor-corrector algorithm for monotone nonlinear complementarity problems (Q2887386)
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 6041741
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of a Mehrotra-type predictor-corrector algorithm for monotone nonlinear complementarity problems |
scientific article; zbMATH DE number 6041741 |
Statements
1 June 2012
0 references
nonlinear complementarity problem
0 references
Mehrotra-type predictor-corrector algorithm
0 references
interior point method
0 references
Lipschitz condition
0 references
polynomial complexity
0 references
Complexity of a Mehrotra-type predictor-corrector algorithm for monotone nonlinear complementarity problems (English)
0 references
0.8937572240829468
0 references
0.8870443105697632
0 references
0.8629798889160156
0 references
0.8580378890037537
0 references
