An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term (Q306399): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10957-016-0895-0 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10957-016-0895-0 / rank | |||
Normal rank | |||
Latest revision as of 13:52, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 |
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
