A polynomial interior-point algorithm for monotone linear complementarity problems (Q353166)
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 polynomial interior-point algorithm for monotone linear complementarity problems |
scientific article; zbMATH DE number 6187320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial interior-point algorithm for monotone linear complementarity problems |
scientific article; zbMATH DE number 6187320 |
Statements
A polynomial interior-point algorithm for monotone linear complementarity problems (English)
0 references
12 July 2013
0 references
monotone linear complementarity problem (MLCP)
0 references
feasible interior-point method
0 references
central path
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
