Exploiting hardware capabilities in interior point methods
From MaRDI portal
Recommendations
- On the implementation of interior point methods for dual-core platforms
- scientific article; zbMATH DE number 432998
- Vector processing in simplex and interior methods for linear programming
- Structure-exploiting interior point methods
- Implementing interior point linear programming methods in the Optimization Subroutine Library
Cites work
- Advanced preprocessing techniques for linear and quadratic programming
- An Approximate Minimum Degree Ordering Algorithm
- Basic Linear Algebra Subprograms for Fortran Usage
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Lower bounds for the quadratic assignment problem via triangle decompositions
- Multiple centrality corrections in a primal-dual method for linear programming
- On Finding Supernodes for Sparse Matrix Computations
- On the implementation of interior point methods for dual-core platforms
- Recent advances in optimization techniques for statistical tabular data protection
- The BPMPD interior point solver for convex quadratic problems
- The Evolution of the Minimum Degree Ordering Algorithm
Cited in
(3)
This page was built for publication: Exploiting hardware capabilities in interior point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815515)