Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:56, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Long steps in an \(O(n^ 3L)\) algorithm for linear programming |
scientific article |
Statements
Long steps in an \(O(n^ 3L)\) algorithm for linear programming (English)
0 references
16 January 1993
0 references
The authors adapt the safeguarded linesearch of Anstreicher to a partial updating version of Ye's scaled algorithm. One shows that using a Goldstein-Armijo rule to safeguard a linesearch of the potential function during primal steps it is sufficient to control the number of updates. Also one generalizes the dual step construction to apply to partial updating.
0 references
Karmarkar's algorithm
0 references
safeguarded linesearch
0 references
Ye's scaled algorithm
0 references
