Exploiting hardware capabilities in interior point methods

DOI10.1080/10556788.2015.1104677zbMath1382.90115OpenAlexW2265644731MaRDI QIDQ2815515

Csaba Meszaros

Publication date: 29 June 2016

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: http://eprints.sztaki.hu/8998/

zbMATH Keywords

linear programmingCholesky factorizationinterior point methodshigh performance computing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)

Related Items

On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach

Cites Work

• Recent advances in optimization techniques for statistical tabular data protection
• Advanced preprocessing techniques for linear and quadratic programming
• Multiple centrality corrections in a primal-dual method for linear programming
• Lower bounds for the quadratic assignment problem via triangle decompositions
• On the implementation of interior point methods for dual-core platforms
• The Evolution of the Minimum Degree Ordering Algorithm
• Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
• On Finding Supernodes for Sparse Matrix Computations
• Basic Linear Algebra Subprograms for Fortran Usage
• Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
• The BPMPD interior point solver for convex quadratic problems
• An Approximate Minimum Degree Ordering Algorithm

This page was built for publication: Exploiting hardware capabilities in interior point methods