Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm

DOI10.1287/IJOC.1.2.84MaRDI QIDQ4019975zbMATH OpenOpenAlexFDO

Authors Ilan Adler, Narendra K. Karmarkar, Geraldo Veiga, Mauricio G. C. Resende

Publication date 16 January 1993

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4700325bc5bbb2be20de8ef90f90451bd9dc604f

zbMATH Keywords

Gaussian eliminationdata structuresimplementation of Karmarkar's algorithmsymbolic factorization step

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• scientific article; zbMATH DE number 930345
• Algorithmen und Datenstrukturen
• Algorithms and data structures
• Algorithms and data structures

Cited in

(24)

• A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
• Solving symmetric indefinite systems in an interior-point method for linear programming
• Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
• Sparsity preserving preconditioners for linear systems in interior-point methods
• Global convergence of the affine scaling methods for degenerate linear programming problems
• Presolving in linear programming
• Computational results of an interior point algorithm for large scale linear programming
• An implementation of Karmarkar's algorithm for linear programming
• Superlinear convergence of the affine scaling algorithm
• An affine-scaling pivot algorithm for linear programming
• A parallel interior point algorithm for linear programming on a network of transputers
• An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
• Making sparse matrices sparser: Computational results
• Vector processing in simplex and interior methods for linear programming
• Exploiting hardware capabilities in interior point methods
• Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method
• A hierarchical algorithm for making sparse matrices sparser
• Splitting dense columns in sparse linear systems
• Advances in design and implementation of optimization software
• On the convergence of the affine-scaling algorithm
• Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers
• Efficient solution of two-stage stochastic linear programs using interior point methods
• Interior-point methods for linear programming: a review
• George B. Dantzig and systems optimization

This page was built for publication: Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4019975)