Refine
Document Type
- Article (7)
- ZIB-Report (7)
- In Proceedings (4)
- Book chapter (1)
- Doctoral Thesis (1)
Language
- English (20)
Keywords
Institute
- Applied Algorithmic Intelligence Methods (20) (remove)
In linear optimization, matrix structure can often be exploited algorithmically. However, beneficial presolving reductions sometimes destroy the special structure of a given problem. In this article, we discuss structure-aware implementations of presolving as part of a parallel interior-point method to solve linear programs with block-diagonal structure, including both linking variables and linking constraints. While presolving reductions are often mathematically simple, their implementation in a high-performance computing environment is a complex endeavor. We report results on impact, performance, and scalability of the resulting presolving routines on real-world energy system models with up to 700 million nonzero entries in the constraint matrix.