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 this page instead for the normal view: A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function |
scientific article |
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
