Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
From MaRDI portal
Publication:4019975
DOI10.1287/IJOC.1.2.84zbMath0752.90043OpenAlexW2002576214MaRDI QIDQ4019975
Ilan Adler, Geraldo Veiga, Narendra K. Karmarkar, 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
Gaussian eliminationdata structuresimplementation of Karmarkar's algorithmsymbolic factorization step
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (24)
Superlinear convergence of the affine scaling algorithm ⋮ Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods ⋮ Presolving in linear programming ⋮ An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption ⋮ A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation ⋮ Global convergence of the affine scaling methods for degenerate linear programming problems ⋮ Computational results of an interior point algorithm for large scale linear programming ⋮ Sparsity preserving preconditioners for linear systems in interior-point methods ⋮ George B. Dantzig and systems optimization ⋮ On the convergence of the affine-scaling algorithm ⋮ Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method ⋮ A hierarchical algorithm for making sparse matrices sparser ⋮ Efficient solution of two-stage stochastic linear programs using interior point methods ⋮ Exploiting hardware capabilities in interior point methods ⋮ Vector processing in simplex and interior methods for linear programming ⋮ Making sparse matrices sparser: Computational results ⋮ An implementation of Karmarkar's algorithm for linear programming ⋮ An affine-scaling pivot algorithm for linear programming ⋮ A parallel interior point algorithm for linear programming on a network of transputers ⋮ Advances in design and implementation of optimization software ⋮ Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers ⋮ Splitting dense columns in sparse linear systems ⋮ Solving symmetric indefinite systems in an interior-point method for linear programming ⋮ Interior-point methods for linear programming: a review
This page was built for publication: Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
