An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412)

From MaRDI portal
Revision as of 16:34, 11 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q233995)
scientific article
Language Label Description Also known as
English
An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs
scientific article

    Statements

    An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (English)
    0 references
    0 references
    0 references
    27 March 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    interior point method
    0 references
    Karmarkar's method
    0 references
    rank-one update
    0 references
    partial updating
    0 references
    primal-dual potential function
    0 references
    linear complementarity
    0 references
    convex quadratic programming
    0 references