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

From MaRDI portal
Revision as of 07:56, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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
    1991
    0 references
    Karmarkar's method
    0 references
    primal interior point method
    0 references
    convex quadratic programming
    0 references
    logarithmic barrier function
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references