Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function (Q1177228)

From MaRDI portal
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
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    interior-point algorithm
    0 references
    primal scaling
    0 references
    projected gradients
    0 references
    0 references