An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936)

From MaRDI portal
Revision as of 12:17, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
scientific article

    Statements

    An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Karmarkar's method
    0 references
    primal interior point method
    0 references
    convex quadratic programming
    0 references
    logarithmic barrier function
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references