An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (Q1915906): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual infeasible-interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming / 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: Polynomiality of infeasible-interior-point algorithms for linear programming / 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: Local convergence of interior-point algorithms for degenerate monotone LCP / 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: Q4060241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible-interior-point algorithm for linear complementarity problems / 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
Property / cites work
 
Property / cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / rank
 
Normal rank

Revision as of 11:55, 24 May 2024

scientific article
Language Label Description Also known as
English
An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
scientific article

    Statements

    An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (English)
    0 references
    0 references
    24 October 1996
    0 references
    infeasible-interior-point algorithm
    0 references
    polynomiality
    0 references
    superlinear convergence
    0 references
    Mizuno-Todd-Ye predictor-corrector algorithm
    0 references
    monotone linear complementarity
    0 references
    0 references

    Identifiers