An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term (Q306399)
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: An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term |
scientific article; zbMATH DE number 6621006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term |
scientific article; zbMATH DE number 6621006 |
Statements
An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term (English)
0 references
31 August 2016
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.9346078038215636
0 references
0.9335504174232484
0 references
0.9301950335502625
0 references
0.9262160062789916
0 references
