Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function (Q2493765)
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 interior-point methods for linear optimization based on some conditions on kernel function |
scientific article; zbMATH DE number 5033046
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function |
scientific article; zbMATH DE number 5033046 |
Statements
Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function (English)
0 references
16 June 2006
0 references
The authors suggest and study a class of interior-point methods for solving the linear optimization problem \(\min \{ c^T x: Ax=b, x \geq 0 \}\). Estimates for the complexity of the methods are derived.
0 references
linear optimization
0 references
primal-dual interior point method
0 references
kernel function
0 references
proximity function
0 references
large update method
0 references
polynomial complexity
0 references
0 references
0.8844660520553589
0 references
0.8768901824951172
0 references
0.8716299533843994
0 references
0.8609058856964111
0 references
