An interior-point algorithm for linear optimization based on a new barrier function (Q720625): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 11:19, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An interior-point algorithm for linear optimization based on a new barrier function |
scientific article |
Statements
An interior-point algorithm for linear optimization based on a new barrier function (English)
0 references
11 October 2011
0 references
The author proposes a new primal-dual interior-point algorithm for the following standard linear optimization problem \[ \min\{c^T x: Ax= b,x\geq 0\}. \] It is shown that the new algorithm has \(O(\sqrt{n}\log n\log{n\over\varepsilon})\) iteration bound for large-update and \(O(\sqrt{n}\log{n\over \varepsilon})\) for small-update methods which are currently the best known bounds, respectively. -- No numerical examples are given.
0 references
primal-dual interior point method
0 references
kernel function
0 references
complexity
0 references
polynomial algorithm
0 references
linear optimization
0 references