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

From MaRDI portal
Revision as of 03:02, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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