Complexity analysis of primal-dual interior-point methods for linear optimization based on a new efficient Bi-parameterized kernel function with a trigonometric barrier term (Q5074328)
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: Complexity analysis of primal-dual interior-point methods for linear optimization based on a new efficient Bi-parameterized kernel function with a trigonometric barrier term |
scientific article; zbMATH DE number 7523417
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity analysis of primal-dual interior-point methods for linear optimization based on a new efficient Bi-parameterized kernel function with a trigonometric barrier term |
scientific article; zbMATH DE number 7523417 |
Statements
Complexity analysis of primal-dual interior-point methods for linear optimization based on a new efficient Bi-parameterized kernel function with a trigonometric barrier term (English)
0 references
9 May 2022
0 references
linear optimization
0 references
kernel function
0 references
interior point methods
0 references
complexity bound
0 references
