A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming (Q3068659)

From MaRDI portal
Revision as of 15:33, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming
scientific article

    Statements

    A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming (English)
    0 references
    0 references
    17 January 2011
    0 references
    convex quadratic programming
    0 references
    infeasible interior point algorithm
    0 references
    polynomial complexity
    0 references

    Identifiers