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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 23:31, 4 March 2024

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