Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function (Q1177228): 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/bf01586933 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996309927 / rank | |||
Normal rank | |||
Latest revision as of 09:46, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function |
scientific article |
Statements
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function (English)
0 references
26 June 1992
0 references
This paper presents extensions of Gonzaga's \(O(nL)\) iteration algorithm and alternate forms of Ye's \(O(\sqrt nL)\) iteration algorithm for linear programming. These algorithms use only primal scaling and projected gradients of the potential functions.
0 references
interior-point algorithm
0 references
primal scaling
0 references
projected gradients
0 references
0 references
0 references
