A self-adjusting interior point algorithm for linear complementarity problems (Q814067): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2773659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear primal-dual affine scaling algorithms for LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant potential primal-dual algorithms: A framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-adjusting primal–dual interior point method for linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: User'S guide To Lipsol linear-programming interior point solvers V0.4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Nonlinear Complementarity Problem by a Homotopy Method / rank
 
Normal rank

Revision as of 09:54, 24 June 2024

scientific article
Language Label Description Also known as
English
A self-adjusting interior point algorithm for linear complementarity problems
scientific article

    Statements

    A self-adjusting interior point algorithm for linear complementarity problems (English)
    0 references
    0 references
    0 references
    0 references
    2 February 2006
    0 references
    linear complementarity problems
    0 references
    central path
    0 references
    proximity measure
    0 references
    interior point algorithm
    0 references
    self-adjusting
    0 references

    Identifiers