A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:13, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A primal-dual affine-scaling potential-reduction algorithm for linear programming |
scientific article |
Statements
A primal-dual affine-scaling potential-reduction algorithm for linear programming (English)
0 references
28 April 1994
0 references
The authors propose a primal-dual affine-scaling potential-reduction algorithm for linear programming. The step size at each iteration is chosen such that the potential function does not increase. The proposed algorithm is polynomial-time bounded. The authors also propose a modification of this algorithm such that when the current iterate is far from the path of centers, a centering direction is used.
0 references
interior point algorithm
0 references
complexity
0 references
potential function
0 references
primal-dual affine-scaling potential-reduction algorithm
0 references
