Improving a primal–dual simplex-type algorithm using interior point methods
From MaRDI portal
Publication:4646555
DOI10.1080/02331934.2018.1523906zbMath1416.90021OpenAlexW2893347374MaRDI QIDQ4646555
Nikolaos Samaras, Themistoklis Glavelis, Nikolaos Ploskas
Publication date: 14 January 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1523906
linear programmingexterior point algorithmsimplex algorithminterior point methodscomputational study
Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)
Related Items
Foundations of operations research: from linear programming to data envelopment analysis, A space decomposition-based deterministic algorithm for solving linear optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interior point methods 25 years later
- Exterior point simplex-type algorithms for linear and network optimization problems
- Exterior point algorithms for nearest points and convex quadratic programs
- Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods
- A new polynomial-time algorithm for linear programming
- An infeasible (exterior point) simplex algorithm for assignment problems
- Efficient GPU-based implementations of simplex type algorithms
- Towards a practical parallelisation of the simplex method
- ASYNPLEX, an asynchronous parallel revised simplex algorithm
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- A fast LU update for linear programming
- An exterior point simplex algorithm for (general) linear programming problems
- Recovering an optimal LP basis from an interior point solution
- Steepest-edge simplex algorithms for linear programming
- An efficient simplex type algorithm for sparse and dense linear programs.
- A new efficient primal dual simplex algorithm
- An affine-scaling pivot algorithm for linear programming
- An experimental investigation of a primal–dual exterior point simplexalgorithm
- An Improved Primal Simplex Algorithm for Degenerate Linear Programs
- Pivoting rules for the revised simplex algorithm
- The Criss-Cross Method for Solving Linear Programming Problems
- Advances in the Parallelization of the Simplex Method
- A convergent criss-cross method
- Polynomial algorithms in linear programming
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- On the Implementation of a Primal-Dual Interior Point Method
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
- On Finding Primal- and Dual-Optimal Bases
- New Finite Pivoting Rules for the Simplex Method
- New purification algorithms for linear programming
- Combining Interior-Point and Pivoting Algorithms for Linear Programming
- Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
- A Parallel Implementation of the Revised Simplex Algorithm Using OpenMP: Some Preliminary Results
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit
- A Revised Dual Projective Pivot Algorithm for Linear Programming
- The simplex method of linear programming using LU decomposition
- On using exterior penalty approaches for solving linear programming problems
- Benchmarking optimization software with performance profiles.
- The dual active set algorithm and its application to linear programming
