Vector processing in simplex and interior methods for linear programming
From MaRDI portal
Recommendations
- Implementing interior point linear programming methods in the Optimization Subroutine Library
- A parallel algorithm for linear programming problems
- Vector-Supercomputer Experiments with the Primal Affine Linear Programming Scaling Algorithm
- scientific article; zbMATH DE number 4197775
- Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 3521444 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- An implementation of Karmarkar's algorithm for linear programming
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
- Evolution of linear programming computing techniques
- Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Parallel implementation of multifrontal schemes
- Pivot selection methods of the Devex LP code
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
- Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
- The Impact of Hardware Gather/Scatter on Sparse Gaussian Elimination
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The Use of BLAS3 in Linear Algebra on a Parallel Processor with a Hierarchical Memory
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
Cited in
(11)- Integrability of vector and multivector fields associated with interior point methods for linear programming
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- Implementing cholesky factorization for interior point methods of linear programming
- A method of vector processing for shared symbolic data
- Exploiting hardware capabilities in interior point methods
- Towards a practical parallelisation of the simplex method
- Implementing interior point linear programming methods in the Optimization Subroutine Library
- On the efficacy of distributed simplex algorithms for linear programming
- Advances in design and implementation of optimization software
- Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers
- Steepest-edge simplex algorithms for linear programming
This page was built for publication: Vector processing in simplex and interior methods for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751499)
