A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q453626 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Dorel I. Duca / rank | |||
Normal rank | |||
Revision as of 10:03, 15 February 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
