A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem (Q1939694)

From MaRDI portal
Revision as of 05:32, 6 July 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 the tridiagonal and Hessenberg P-matrix linear complementarity problem
scientific article

    Statements

    A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem (English)
    0 references
    0 references
    0 references
    5 March 2013
    0 references
    linear complementarity
    0 references
    tridiagonal matrix
    0 references
    Hessenberg matrix
    0 references
    P-matrix
    0 references
    polynomial-time algorithm
    0 references
    dynamic programming
    0 references

    Identifiers