Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362)
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 6674251
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity analysis of interior point methods for linear programming based on a parameterized kernel function |
scientific article; zbMATH DE number 6674251 |
Statements
Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (English)
0 references
12 January 2017
0 references
linear optimization
0 references
kernel function
0 references
interior point methods
0 references
complexity bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9226678609848022
0 references
0.9152464270591736
0 references
0.9121026992797852
0 references
0.9116507172584534
0 references
