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-7zbMATH Open1362.90283OpenAlexW2578306489MaRDI QIDQ522098FDOQ522098
Authors: Daniele Silva, Marta Velazco, Aurelio R. L. 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
Recommendations
- Improving the preconditioning of linear systems from interior point methods
- scientific article; zbMATH DE number 1187129
- An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
- Towards a cost-effective ILU preconditioner with high level fill
Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Interior-point methods (90C51)
Cites Work
- PCx: an interior-point code for linear programming
- Preconditioning techniques for large linear systems: A survey
- Title not available (Why is that?)
- On the Implementation of a Primal-Dual Interior Point Method
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Nested Dissection of a Regular Finite Element Mesh
- The effect of ordering on preconditioned conjugate gradients
- Computing the Minimum Fill-In is NP-Complete
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Multiple centrality corrections in a primal-dual method for linear programming
- Title not available (Why is that?)
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
- On sparse matrix orderings in interior point methods
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
- Two improved algorithms for envelope and wavefront reduction
- A multilevel algorithm for wavefront reduction
- An algorithm for profile and wavefront reduction of sparse matrices
- A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs
- Title not available (Why is that?)
- A FORTRAN program for profile and wavefront reduction
Cited In (4)
- Computing the splitting preconditioner for interior point method using an incomplete factorization approach
- A note on matrix reordering for linear system solutions by iterative methods in interior point methods
- Improving the preconditioning of linear systems from interior point methods
- A hypergraph partitioning model for profile minimization
Uses Software
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522098)
