New variants of the criss-cross method for linearly constrained convex quadratic programming (Q1877024)

From MaRDI portal
Revision as of 19:56, 6 June 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
New variants of the criss-cross method for linearly constrained convex quadratic programming
scientific article

    Statements

    New variants of the criss-cross method for linearly constrained convex quadratic programming (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2004
    0 references
    0 references
    Linearly constrained convex quadratic optimization
    0 references
    Linear complementarity problems
    0 references
    Criss-cross type algorithms
    0 references
    0 references