Computing Karmarkar projections quickly (Q1107438): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A monotonic projective algorithm for fractional linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Modification of LDL T Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of Karmarkar's linear programming algorithm for problems in standard form / 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: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's algorithm for linear programming using dual variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental approach to karmarkar’s projective method for linear programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:36, 18 June 2024

scientific article
Language Label Description Also known as
English
Computing Karmarkar projections quickly
scientific article

    Statements

    Computing Karmarkar projections quickly (English)
    0 references
    0 references
    0 references
    1988
    0 references
    The paper presents and investigates a numerical method for computing the projections for Karmarkar's algorithm for linear programming. A comparison is carried out with known methods that factor the matrix at each iteration. The numerical results obtained show that the proposed method promises advantages.
    0 references
    0 references
    Cholesky factorization
    0 references
    computation of projections
    0 references
    rank one updates
    0 references
    sparsity
    0 references
    Karmarkar's algorithm
    0 references