scientific article; zbMATH DE number 4199963
From MaRDI portal
Publication:3348699
Recommendations
- On the Implementation of a Primal-Dual Interior Point Method
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- scientific article; zbMATH DE number 964349
- Computational experience with a primal-dual interior point method for linear programming
- scientific article; zbMATH DE number 432998
- scientific article; zbMATH DE number 5630197
- Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
- scientific article; zbMATH DE number 4164543
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- Linear Programming on Cray Supercomputers
Cited in
(7)- Smoothed analysis of condition numbers and complexity implications for linear programming
- Interior-point algorithms for semi-infinite programming
- Gigaflops in linear programming
- An interior point method for quadratic programs based on conjugate projected gradients
- Linear Programming on Cray Supercomputers
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348699)