An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569)

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
An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
scientific article

    Statements

    An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (English)
    0 references
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    interior point algorithm
    0 references
    positive semi-definite linear complementarity
    0 references
    approximate solution
    0 references
    potential function
    0 references
    central path following algorithm
    0 references
    potential reduction
    0 references
    Karmarkar's algorithm
    0 references
    central trajectory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references