Computational experience with a primal-dual interior point method for linear programming (Q808184): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NETLIB LP Test Set / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(91)90275-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030490984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Development of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of degenerate linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modification of the minimum-degree algorithm by multiple elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility issues in a primal-dual interior-point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating Two-Stage Stochastic Programs for Interior Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of a Dual Affine Interior Point Algorithm 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: Q4206561 / 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: Affine-scaling for linear programs with free variables / rank
 
Normal rank

Latest revision as of 18:14, 21 June 2024

scientific article
Language Label Description Also known as
English
Computational experience with a primal-dual interior point method for linear programming
scientific article

    Statements

    Computational experience with a primal-dual interior point method for linear programming (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    This important paper describes the heuristics and implementation details used in the code OB1, which implements a primal-dual interior point algorithm for linear programming. The algorithm is motivated in terms of the logarithmic barrier function, and the strategy for choosing the initial point and the heuristic for decreasing the barrier parameter are described. The authors discuss the main computational engine of the code, namely, the preconditioned conjugate gradient algorithm for solving the sparse linear system of equations that arises at each iteration. The preconditioner is of the incomplete Cholesky type, but special care is needed in handling columns of the constraint matrix which destroy the sparsity of the coefficient matrix. Computational comparisons with the MINOS simplex code are given for problems in the expanded netlib test set.
    0 references
    0 references
    0 references
    0 references
    0 references
    computational experience
    0 references
    implementation
    0 references
    code OB1
    0 references
    primal-dual interior point algorithm
    0 references
    linear programming
    0 references
    logarithmic barrier function
    0 references
    preconditioned conjugate gradient algorithm
    0 references
    preconditioner
    0 references
    incomplete Cholesky type
    0 references
    MINOS simplex code
    0 references
    0 references
    0 references