Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence (Q1893347): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior point potential reduction algorithm for the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial time method for a linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Step Interior Point Algorithms for Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence behavior of interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming / rank
 
Normal rank

Latest revision as of 14:12, 23 May 2024

scientific article
Language Label Description Also known as
English
Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
scientific article

    Statements

    Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence (English)
    0 references
    0 references
    3 July 1995
    0 references
    superlinear convergence
    0 references
    predictor-corrector algorithm
    0 references
    monotone linear complementarity problems
    0 references

    Identifiers