A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668)
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 primal-dual affine-scaling potential-reduction algorithm for linear programming |
scientific article; zbMATH DE number 558711
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A primal-dual affine-scaling potential-reduction algorithm for linear programming |
scientific article; zbMATH DE number 558711 |
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
0 references
0 references
0 references
0 references
0.9430381
0 references
0.9425739
0 references
0.92769486
0 references
0.92514616
0 references
0.9177862
0 references
0.9163293
0 references
