A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming (Q4697311)

From MaRDI portal
scientific article; zbMATH DE number 221879
Language Label Description Also known as
English
A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming
scientific article; zbMATH DE number 221879

    Statements

    A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming (English)
    0 references
    0 references
    29 June 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomiality
    0 references
    centering parameter
    0 references
    step-length parameter
    0 references
    primal-dual interior-point algorithms
    0 references
    superlinear or quadratic convergence
    0 references
    0 references
    0 references
    0 references