An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677)

From MaRDI portal
Revision as of 16:08, 6 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity
scientific article

    Statements

    An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (English)
    0 references
    0 references
    0 references
    4 June 2007
    0 references
    convex quadratic programming
    0 references
    infeasible interior point algorithm
    0 references
    Mizuno-Todd-Ye type algorithm
    0 references
    polynomial time complexity
    0 references
    convergence
    0 references

    Identifiers

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