A polynomial-time algorithm for a class of linear complementarity problems (Q1123139)

From MaRDI portal
Revision as of 10:00, 20 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
A polynomial-time algorithm for a class of linear complementarity problems
scientific article

    Statements

    A polynomial-time algorithm for a class of linear complementarity problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    polynomial-time algorithm
    0 references
    Karmarkar's algorithm
    0 references
    path of centers
    0 references