A new and efficient large-update interior-point method for linear optimization (Q2773659)
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: A new and efficient large-update interior-point method for linear optimization |
scientific article; zbMATH DE number 1710279
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new and efficient large-update interior-point method for linear optimization |
scientific article; zbMATH DE number 1710279 |
Statements
24 February 2002
0 references
primal-dual algorithm
0 references
updating the barrier parameter
0 references
polynomial barrier function
0 references
small-update method
0 references
A new and efficient large-update interior-point method for linear optimization (English)
0 references
The authors start with an observation that there is still a gap between the practical behavior of interior-point algorithms for linear optimization problems and the theoretical performance results. The aim of the article is to show that, by slightly modifying the classical primal-dual Newton search direction, the complexity of large-update methods can be improved. The result is an \(O\bigl(\sqrt{n}\log n\log (n/\varepsilon)\bigr)\) iteration bound.
0 references
