A modification of Karmarkar's linear programming algorithm (Q581231): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01840454 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2086920040 / rank | |||
Normal rank |
Latest revision as of 11:39, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A modification of Karmarkar's linear programming algorithm |
scientific article |
Statements
A modification of Karmarkar's linear programming algorithm (English)
0 references
1986
0 references
The authors present a modification of Karmarkar's algorithm, which uses a recentered projected gradient approach thereby obviating a priori knowledge of the optimal value of the objective function. The proof of the convergence is given assuming primal and dual nondegeneracy. Computational comparisons between this algorithm and the revised simplex method are reported. The authors undertook a regression on the algorithm of the time (number of iterations) as a linear function of the logarithms of m and n.
0 references
least squares
0 references
modification
0 references
Karmarkar's algorithm
0 references
projected gradient
0 references
Computational comparisons
0 references
revised simplex method
0 references