Benchmarking interior point Lp/Qp solvers
From MaRDI portal
Recommendations
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- LOQO:an interior point code for quadratic programming
- scientific article; zbMATH DE number 1047679
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- scientific article; zbMATH DE number 1489799
Cites work
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Fast Cholesky factorization for interior point methods of linear programming
- On free variables in interior point methods
- On the Implementation of a Primal-Dual Interior Point Method
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Symmetric indefinite systems for interior point methods
- The role of the augmented system in interior point methods
Cited in
(6)- LOQO:an interior point code for quadratic programming
- Extension of Mittelmann's benchmarks: comparing the solvers of SAS and Gurobi
- Detecting ``dense columns in interior point methods for linear programs
- Inner and outer loop optimization in semiconductor manufacturing supply chain management
- Sparsity in convex quadratic programming with interior point methods
- A server for automated performance analysis of benchmarking data
This page was built for publication: Benchmarking interior point Lp/Qp solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4504797)
