Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited (Q1321176): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An Implementation of a Primal-Dual Interior Point Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a primal-dual interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Centered Projective Algorithm for Linear Programming / 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

Revision as of 13:56, 22 May 2024

scientific article
Language Label Description Also known as
English
Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited
scientific article

    Statements

    Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited (English)
    0 references
    0 references
    0 references
    25 July 1994
    0 references
    convergence theory
    0 references
    duality gap
    0 references
    primal-dual interior-point methods
    0 references
    superlinear convergence
    0 references

    Identifiers