Superlinear convergence of infeasible-interior-point methods for linear programming (Q1337141): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yin Zhang / rank
Normal rank
 
Property / author
 
Property / author: Yin Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Computational experience with a primal-dual interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming / rank
 
Normal rank
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: Error bounds for nondegenerate monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / 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: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / 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: Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01581155 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083305491 / rank
 
Normal rank

Latest revision as of 10:17, 30 July 2024

scientific article
Language Label Description Also known as
English
Superlinear convergence of infeasible-interior-point methods for linear programming
scientific article

    Statements

    Superlinear convergence of infeasible-interior-point methods for linear programming (English)
    0 references
    0 references
    0 references
    26 September 1995
    0 references
    interior-point methods
    0 references
    primal-dual infeasible-interior-point framework
    0 references
    local convergence properties
    0 references
    \(Q\)-superlinear convergence
    0 references

    Identifiers