A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Following Methods for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / 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: Q3491304 / 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(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems / 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: Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding an interior point in the optimal face of linear programs / 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: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of iterations of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of following the central path of linear programs by linear extrapolation. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming / rank
 
Normal rank

Latest revision as of 12:55, 24 May 2024

scientific article
Language Label Description Also known as
English
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
scientific article

    Statements

    A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (English)
    0 references
    0 references
    0 references
    0 references
    1 July 1996
    0 references
    0 references
    interior-point algorithms
    0 references
    primal-dual affine-scaling method
    0 references
    duality gap
    0 references
    lower bound
    0 references
    polynomiality
    0 references
    path-following
    0 references