Computational results of an interior point algorithm for large scale linear programming (Q1181915): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: KORBX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINOS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LOLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable-metric variant of the Karmarkar algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed version of Karmarkar's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acyclic subgraph polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4765898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902876 / 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: Q3968758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3811367 / 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 dual affine variant of Karmarkar's method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4127946 / rank
 
Normal rank

Latest revision as of 13:33, 15 May 2024

scientific article
Language Label Description Also known as
English
Computational results of an interior point algorithm for large scale linear programming
scientific article

    Statements

    Computational results of an interior point algorithm for large scale linear programming (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    computational results
    0 references
    dual projective algorithm
    0 references
    implementation
    0 references
    preconditioned conjugate gradient method
    0 references
    reciprocal estimates
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references