A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function (Q843962)
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 5659693
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function |
scientific article; zbMATH DE number 5659693 |
Statements
A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function (English)
0 references
18 January 2010
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0.9056605100631714
0 references
0.8906564712524414
0 references
0.8877493739128113
0 references
0.8821284770965576
0 references
