On sparse matrix orderings in interior point methods

DOI10.1007/s11081-013-9233-7zbMath1294.65051OpenAlexW2015874996MaRDI QIDQ402236

Csaba Meszaros

Publication date: 27 August 2014

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-013-9233-7

zbMATH Keywords

interior point methodsnested dissectionsparse matrix ordering

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical optimization and variational techniques (65K10) Linear programming (90C05)

Related Items (1)

Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming

Uses Software

• BPMPD
• METIS
• symrcm
• Chaco
• Decision tree for optimization software

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing extremal and approximate distances in graphs having unit cost edges
• The augmented system variant of IPMs in two-stage stochastic linear programming computation
• Using domain decomposition to find graph bisectors
• Advanced preprocessing techniques for linear and quadratic programming
• Detecting ``dense columns in interior point methods for linear programs
• The Use of Linear Graphs in Gauss Elimination
• On the implementation of interior point methods for dual-core platforms
• The Evolution of the Minimum Degree Ordering Algorithm
• Computing the Minimum Fill-In is NP-Complete
• An Efficient Heuristic Procedure for Partitioning Graphs
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Improving the Run Time and Quality of Nested Dissection Ordering
• Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
• Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
• Robust Ordering of Sparse Matrices using Multisection
• The BPMPD interior point solver for convex quadratic problems
• Nested Dissection of a Regular Finite Element Mesh

This page was built for publication: On sparse matrix orderings in interior point methods