Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function (Q2493765)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function |
scientific article |
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
