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

DOI10.1007/s00186-017-0571-7zbMath1362.90283OpenAlexW2578306489MaRDI QIDQ522098

Daniele Silva, Marta Velazco, Aurelio Ribeiro Leite Oliveira

Publication date: 13 April 2017

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-017-0571-7

zbMATH Keywords

linear systemsiterative methodspreconditionerinterior point methodsreordering heuristics

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Interior-point methods (90C51)

Related Items (2)

A Hypergraph Partitioning Model for Profile Minimization ⋮ Computing the Splitting Preconditioner for Interior Point Method Using an Incomplete Factorization Approach

Uses Software

• symrcm
• profile wavefront

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On sparse matrix orderings in interior point methods
• A new polynomial-time algorithm for linear programming
• The effect of ordering on preconditioned conjugate gradients
• Two improved algorithms for envelope and wavefront reduction
• A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
• Multiple centrality corrections in a primal-dual method for linear programming
• Preconditioning techniques for large linear systems: A survey
• Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
• Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
• A Multilevel Algorithm for Wavefront Reduction
• A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
• An algorithm for profile and wavefront reduction of sparse matrices
• A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs
• Computing the Minimum Fill-In is NP-Complete
• On the Implementation of a Primal-Dual Interior Point Method
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• PCx: an interior-point code for linear programming
• A FORTRAN program for profile and wavefront reduction
• Nested Dissection of a Regular Finite Element Mesh

This page was built for publication: Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming