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

From MaRDI portal
Revision as of 08:58, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(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
    1989
    0 references
    polynomial-time algorithm
    0 references
    Karmarkar's algorithm
    0 references
    path of centers
    0 references

    Identifiers