Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's (Q3657800)

From MaRDI portal
Revision as of 06:40, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's
scientific article

    Statements

    Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's (English)
    0 references
    0 references
    0 references
    1983
    0 references
    computational complexity
    0 references
    linear complementarity problem
    0 references
    variable dimension algorithm
    0 references
    pivot step requirement
    0 references

    Identifiers