Vector processing in simplex and interior methods for linear programming
type: Item
instance of: scholarly article
title: Vector processing in simplex and interior methods for linear programming
zbMATH Open document ID: 0714.90064
DOI: 10.1007/BF02023049
author: D. Kharzeev
published in: Annals of Operations Research
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4176825
zbMATH Keywords: simplex method
zbMATH Keywords: interior point methods
describes a project that uses: CRAIG
describes a project that uses: DEVEX
describes a project that uses: symrcm
describes a project that uses: LSQR
MaRDI profile type: Publication
cites work: An implementation of Karmarkar's algorithm for linear programming
cites work: Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
cites work: Q4099145
cites work: The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
cites work: Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
cites work: Parallel implementation of multifrontal schemes
cites work: Q3740904
cites work: The Multifrontal Solution of Indefinite Sparse Symmetric Linear
cites work: Updated triangular factors of the basis to maintain sparsity in the product form simplex method
cites work: The Use of BLAS3 in Linear Algebra on a Parallel Processor with a Hierarchical Memory
cites work: Q3664299
cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
cites work: Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
cites work: Q5185900
cites work: Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
cites work: Pivot selection methods of the Devex LP code
cites work: A new polynomial-time algorithm for linear programming
cites work: The Impact of Hardware Gather/Scatter on Sparse Gaussian Elimination
cites work: An Implementation of a Primal-Dual Interior Point Method for Linear Programming
cites work: Evolution of linear programming computing techniques
cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
cites work: A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
full work available at URL: https://doi.org/10.1007/bf02023049
OpenAlex ID: W2079547145
description: scientific article; zbMATH DE number 4176825